Prediciendo el generador cuadratico (in Spanish)

Details Prediciendo el generador cuadratico (in Spanish) Prediciendo el generador cuadratico (in Spanish)

2008-04-10

arxiv.org/abs/0804.1788v1

Proceedings of the VIII Reunion Espanola sobre Criptologia y Seguridad de la Informacion (RECSI), p. 185-195, Diaz de Santos,

Computer Science

Cryptography and Security

11 pages, in Spanish

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Prediciendo el generador cuadratico (in Spanish) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Prediciendo el generador cuadratico (in Spanish), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prediciendo el generador cuadratico (in Spanish) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-356637