An efficient binary sequence generator with cryptographic applications
作者：
Highlights：
•
摘要
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.
论文关键词：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 upper triangular matrix,Order
论文评审过程：Available online 9 September 2004.
论文官网地址：https://doi.org/10.1016/j.amc.2004.06.065
