DocumentCode
1809438
Title
Random number generator architecture and VLSI implementation
Author
Sklavos, Nicolas ; Kitsos, P. ; Papadomanolakis, K. ; Koufopavlou, O.
Author_Institution
Electr. & Comput. Eng. Dept., Patras Univ., Greece
Volume
4
fYear
2002
fDate
2002
Abstract
Security protocols and encryption algorithms are basically based on random number generators. In this paper, a new random number generator architecture is introduced. The produced number word length is equal to 160 bits. The philosophy of the architecture relies on the usage of the SHA hash function. The offered security strength of this hash function ensures the unpredictability of the produced number. Additionally, an efficient VLSI implementation for FPGA devices of the proposed system is described. The proposed architecture is a flexible solution in applications where the original physical sources of random number generators, such as electrical noise, are not available or at least not convenient. This architecture can also be used in any cryptographic algorithm and encryption/decryption system with high-speed performance.
Keywords
VLSI; cryptography; digital arithmetic; field programmable gate arrays; integrated logic circuits; random number generation; 160 bit; FPGA device; SHA hash function; VLSI implementation; cryptographic algorithm; encryption algorithms; encryption/decryption system; high-speed performance; produced number word length; random number generator architecture; security protocols; security strength; Algorithm design and analysis; Computer architecture; Cryptography; Entropy; Field programmable gate arrays; Noise generators; Protocols; Random number generation; Security; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on
Print_ISBN
0-7803-7448-7
Type
conf
DOI
10.1109/ISCAS.2002.1010592
Filename
1010592
Link To Document