DocumentCode
2211375
Title
Producing secure pseudorandom sequences with combined multiplicative congruential generators
Author
Jessa, Mieczyslaw ; Jaworski, Michal
Author_Institution
Fac. of Electron. & Telecommun., Poznan Univ. of Technol., Poznan, Poland
fYear
2012
fDate
11-13 April 2012
Firstpage
160
Lastpage
163
Abstract
In this paper, we propose a novel method for producing secure pseudorandom sequences with combined multiplicative congruential generators that have been defined recently. The specific properties of field programmable gate arrays (FPGA) and the combined multiplicative congruential generators enable the generation of secure sequences in only three cycles of the system clock. The output bit rate of the described design, which is composed of eight generators, achieves 1.227 Gbit/s, and this rate can be significantly increased with more generators. In practice the output throughput is limited only by the available resources of the FPGA used in the design.
Keywords
cryptography; field programmable gate arrays; random number generation; random sequences; FPGA; bit rate 1.227 Gbit/s; combined multiplicative congruential generators; field programmable gate arrays; pseudorandom sequence security; system clock; Cryptography; Field programmable gate arrays; Generators; NIST; Random sequences; Pseudorandom generators; cryptography; field programmable gate array; security;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Signals and Image Processing (IWSSIP), 2012 19th International Conference on
Conference_Location
Vienna
ISSN
2157-8672
Print_ISBN
978-1-4577-2191-5
Type
conf
Filename
6208096
Link To Document