.png){kind=icon}
.png){kind=icon}
Return
An efficient binary sequence generator with cryptographic applications
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2004.06.065.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As the Internet has become more and more important, the need for secure systems has increased accordingly. Our proposal is an efficient sequence generator that can be used in these secure systems. It is based on the powers of a block upper triangular matrix and, besides achieving great statistical results and efficiency, it is very flexible and can be easily adapted to different applications. The matricial techniques employed can also be used in other kinds of cryptographic primitives. (c) 2004 Elsevier Inc. All rights reserved.
Keywords:
pseudorandom generator
blum-blum-shub generator
binary sequence
cipher
efficient
cryptography
security
monobit test
serial test
poker test
autocorrelation
linear
complexity
primitive polynomial
companion matrix
block tipper triangular matrix
order
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available