Linear complexity of the \(x^{2} \bmod p\) orbits

DOI10.1016/S0020-0190(99)00126-XzbMath1338.68115OpenAlexW2182558364MaRDI QIDQ294691

F. Montoya Vitini, A. Peinado Domínguez, Jaime Muñoz Masqué

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909900126X?np=y

zbMATH Keywords

computational complexityfinite fieldscryptographypseudorandom number generationlinear complexityquadratic functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Cites Work

• Probabilistic encryption
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Simple Unpredictable Pseudo-Random Number Generator
• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
• Linear Complexity and Random Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear complexity of the \(x^{2} \bmod p\) orbits