default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammed Bakiri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j6]Ahmed Liacha
, Abdelkrim Kamel Oudjida, Mohammed Bakiri, José Monteiro, Paulo F. Flores:
Radix-2 r recoding with common subexpression elimination for multiple constant multiplication. IET Circuits Devices Syst. 14(7): 990-994 (2020)
2010 – 2019
- 2019
- [c3]Sylvain Contassot-Vivier, Jean-François Couchot, Mohammed Bakiri, Pierre-Cyrille Héam:
Fast and robust PRNGs based on jumps in N-cubes for simulation, but not exclusively for that. HPCS 2019: 650-657 - 2018
- [b1]Mohammed Bakiri:
Hardware Implementation of Pseudo Random Number Generator Based on Chaotic Iterations. (Implémentation matérielle de générateurs de nombres pseudo-aléatoires basés sur les itérations chaotiques). University of Burgundy Franch-Comté, France, 2018 - [j5]Mohammed Bakiri, Christophe Guyeux, Jean-François Couchot, Abdelkrim Kamel Oudjida:
Survey on hardware implementation of random number generators on FPGA: Theory and experimental analyses. Comput. Sci. Rev. 27: 135-153 (2018) - [j4]Ahmed Liacha, Abdelkrim Kamel Oudjida, Farid Ferguene, Mohammed Bakiri, Mohamed Lamine Berrandjia:
Design of high-speed, low-power, and area-efficient FIR filters. IET Circuits Devices Syst. 12(1): 1-11 (2018) - [j3]Mohammed Bakiri, Jean-François Couchot, Christophe Guyeux:
CIPRNG: A VLSI Family of Chaotic Iterations Post-Processings for $\mathbb {F}_{2}$ -Linear Pseudorandom Number Generation Based on Zynq MPSoC. IEEE Trans. Circuits Syst. I Regul. Pap. 65-I(5): 1628-1641 (2018) - [j2]Mohammed Bakiri, Christophe Guyeux, Jean-François Couchot, Luigi Marangio, Stefano Galatolo:
A Hardware and Secure Pseudorandom Generator for Constrained Devices. IEEE Trans. Ind. Informatics 14(8): 3754-3765 (2018) - 2017
- [c2]Mohammed Bakiri, Jean-François Couchot, Christophe Guyeux:
One Random Jump and One Permutation: Sufficient Conditions to Chaotic, Statistically Faultless, and Large Throughput PRNG for FPGA. SECRYPT 2017: 295-302 - [i2]Mohammed Bakiri, Jean-François Couchot, Christophe Guyeux:
One random jump and one permutation: sufficient conditions to chaotic, statistically faultless, and large throughput PRNG for FPGA. CoRR abs/1706.08093 (2017) - 2016
- [j1]Abdelkrim Kamel Oudjida, Ahmed Liacha, Mohammed Bakiri, Nicolas Chaillet:
Multiple Constant Multiplication Algorithm for High-Speed and Low-Power Design. IEEE Trans. Circuits Syst. II Express Briefs 63-II(2): 176-180 (2016) - [c1]Mohammed Bakiri, Jean-François Couchot, Christophe Guyeux:
FPGA Implementation of F2-Linear Pseudorandom Number Generators based on Zynq MPSoC: A Chaotic Iterations Post Processing Case Study. SECRYPT 2016: 302-309 - [i1]Mohammed Bakiri, Jean-François Couchot, Christophe Guyeux:
FPGA Implementation of $\mathbb{F}_2$-Linear Pseudorandom Number Generators Based on Zynq MPSoC: a Chaotic Iterations Post Processing Case Study. CoRR abs/1611.08410 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
