An efficient binary sequence generator with cryptographic applications

DOI10.1016/j.amc.2004.06.065zbMath1086.94019OpenAlexW2063566399MaRDI QIDQ2570684

Antonio Zamora, Rafael Álvarez, Joan-Josep Climent, Leandro Tortosa

Publication date: 28 October 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.065

zbMATH Keywords

CryptographyEfficientBlum-Blum-Shub generatorSecurityOrderAutocorrelationLinear complexityBinary sequencePseudorandom generatorPrimitive polynomialCompanion matrixBlock upper triangular matrixCipherMonobit testPoker testSerial test

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items

A new approach to analyze the independence of statistical tests of randomness, Optimizing matrix operations in \(\mathbb Z_2\) by word packing, A matrix PRNG with s-box output filtering

Cites Work

• A Simple Unpredictable Pseudo-Random Number Generator
• Linear Complexity and Random Sequences
• Shift-register synthesis and BCH decoding
• A family of keystream generators with large linear complexity
• An efficient algorithm to generate binary sequences for cryptographic purposes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item