Name
Abstract | ||
|---|---|---|
Let p be a prime and a, c be integers such that a<>0 mod p. The quadratic
generator is a sequence (u_n) of pseudorandom numbers defined by
u_{n+1}=a*(u_n)^2+c mod p. In this article we probe that if we know
sufficiently many of the most significant bits of two consecutive values u_n,
u_{n+1}, then we can compute the seed u_0 except for a small number of
exceptional values.
-----
Sean p un primo, a y c enteros tales que a<>0 mod p. El generador cuadratico
es una sucesion (u_n) de numeros pseudoaleatorios definidos por la relacion
u_{n+1}=a*(u_n)^2+c mod p. En este trabajo demostramos que si conocemos un
numero suficientemente grande de los bits mas significativos para dos valores
consecutivos u_n, u_{n+1}, entonces podemos descubrir en tiempo polinomial la
semilla u_0, excepto para un conjunto pequeno de valores excepcionales. |
Year | Venue | Field |
|---|---|---|
2008 | Clinical Orthopaedics and Related Research | Prime (order theory),Integer,Combinatorics,Algorithm,Theoretical computer science,Mathematics |
DocType | Volume | ISSN |
Journal | abs/0804.1 | Proceedings of the VIII Reunion Espanola sobre Criptologia y
Seguridad de la Informacion (RECSI), p. 185-195, Diaz de Santos, 2004. ISBN
84-7978-650-7 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Domingo Gomez-perez | 1 | 61 | 10.22 |
| Jaime Gutierrez | 2 | 154 | 18.15 |
| Álvar Ibeas | 3 | 40 | 5.30 |
| David Sevilla | 4 | 2 | 1.66 |