loading
Papers

Research.Publish.Connect.

Paper

Authors: Mohammed Bakiri 1 ; Jean-François Couchot 2 and Christophe Guyeux 2

Affiliations: 1 FEMTO-ST Institute, UMR 6174 CNRS, Université of Bourgogne Franche, Centre de Développement des Technologies Avancées and ASM-IPLS Team, France ; 2 FEMTO-ST Institute, UMR 6174 CNRS and Université of Bourgogne Franche, France

ISBN: 978-989-758-259-2

Keyword(s): Random Number Generators, Chaotic Circuits, Discrete Dynamical Systems, Statistical Tests, Cryptography Hardware and Implementation, Applied Cryptography, FPGA.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data and Application Security and Privacy ; Data Engineering ; Databases and Data Security ; Information and Systems Security ; Network Security ; Privacy ; Security and Privacy in Pervasive/Ubiquitous Computing ; Security in Information Systems ; Security Information Systems Architecture and Design and Security Patterns ; Security Requirements ; Software Security ; Ubiquitous Computing Security

Abstract: Sub-categories of mathematical topology, like the mathematical theory of chaos, offer interesting applications devoted to information security. In this research work, we have introduced a new chaos-based pseudorandom number generator implemented in FPGA, which is mainly based on the deletion of a Hamilton cycle within the n-cube (or on the vectorial negation), plus one single permutation. By doing so, we produce a kind of post-treatment on hardware pseudorandom generators, but the obtained generator has usually a better statistical profile than its input, while running at a similar speed. We tested 6 combinations of Boolean functions and strategies that all achieve to pass the most stringent TestU01 battery of tests. This generation can reach a throughput/latency ratio equal to 6.7 Gbps, being thus the second fastest FPGA generator that can pass TestU01.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.210.22.132

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Bakiri, M.; Couchot, J. and Guyeux, C. (2017). One Random Jump and One Permutation: Sufficient Conditions to Chaotic, Statistically Faultless, and Large Throughput PRNG for FPGA.In Proceedings of the 14th International Joint Conference on e-Business and Telecommunications - Volume 6: SECRYPT, (ICETE 2017) ISBN 978-989-758-259-2, pages 295-302. DOI: 10.5220/0006418502950302

@conference{secrypt17,
author={Mohammed Bakiri. and Jean{-}Fran\c{C}ois Couchot. and Christophe Guyeux.},
title={One Random Jump and One Permutation: Sufficient Conditions to Chaotic, Statistically Faultless, and Large Throughput PRNG for FPGA},
booktitle={Proceedings of the 14th International Joint Conference on e-Business and Telecommunications - Volume 6: SECRYPT, (ICETE 2017)},
year={2017},
pages={295-302},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006418502950302},
isbn={978-989-758-259-2},
}

TY - CONF

JO - Proceedings of the 14th International Joint Conference on e-Business and Telecommunications - Volume 6: SECRYPT, (ICETE 2017)
TI - One Random Jump and One Permutation: Sufficient Conditions to Chaotic, Statistically Faultless, and Large Throughput PRNG for FPGA
SN - 978-989-758-259-2
AU - Bakiri, M.
AU - Couchot, J.
AU - Guyeux, C.
PY - 2017
SP - 295
EP - 302
DO - 10.5220/0006418502950302

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.