|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Prediciendo el generador cuadratico (in Spanish) | | Domingo Gomez-Perez
; Jaime Gutierrez
; Alvar Ibeas
; David Sevilla
; | | Date: |
10 Apr 2008 | | 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. | | Source: | arXiv, 0804.1788 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER