Um gerador de bits pseudo-aleatórios seguro baseado em curvas elípticas
Abstract
This paper presents the proposal of a cryptographically strong pseudorandom bit generator with a hybrid architecture based on both modular exponentiation and elliptic scalar product over a pair of elliptic curves. Its security is presented in theoretical terms. This proposal is part of a research about the viability of a stream cipher based on elliptic curves.
References
B. S. Kaliski, J. (1988). Elliptic curves and cryptography: A pseudorandom bit generator and other tools. In Phd Thesis. MIT.
Bellare, M., Goldwasser, S., and Micciancio, D. (1997). "Pseudo-Random" number generation within cryptographic algorithms: The DSS case. In CRYPTO '97, pages 277-291, London, UK. Springer-Verlag.
Blum, M. and Micali, S. (1982). How to generate cryptographically strong sequences of pseudorandom bits. In Proceedings of IEEE Symposium on Foundations of Computer Science. IEEE.
Boyar, J. (1989). Inferring sequences produced by pseudo-random number generators. J. ACM, 36(1):129-141.
Goldreich, O. and Rosen, V. (2000). On the security of modular exponentiation with application to the construction of pseudorandom generators. Cryptology ePrint Archive.
Schnorr, C. P. (1998). Security of almost all discrete log bits. ECCC, (TR98-033).
Yao, A. C. (1982). Theory and applications of trapdoor functions. In 23rd Annual Symposium on Foundations of Computer Science, pages 80-91. IEEE.
Bellare, M., Goldwasser, S., and Micciancio, D. (1997). "Pseudo-Random" number generation within cryptographic algorithms: The DSS case. In CRYPTO '97, pages 277-291, London, UK. Springer-Verlag.
Blum, M. and Micali, S. (1982). How to generate cryptographically strong sequences of pseudorandom bits. In Proceedings of IEEE Symposium on Foundations of Computer Science. IEEE.
Boyar, J. (1989). Inferring sequences produced by pseudo-random number generators. J. ACM, 36(1):129-141.
Goldreich, O. and Rosen, V. (2000). On the security of modular exponentiation with application to the construction of pseudorandom generators. Cryptology ePrint Archive.
Schnorr, C. P. (1998). Security of almost all discrete log bits. ECCC, (TR98-033).
Yao, A. C. (1982). Theory and applications of trapdoor functions. In 23rd Annual Symposium on Foundations of Computer Science, pages 80-91. IEEE.
Published
2005-09-26
How to Cite
NETO, Afonso Comba de Araujo; WEBER, Raul Fernando.
Um gerador de bits pseudo-aleatórios seguro baseado em curvas elípticas. In: BRAZILIAN SYMPOSIUM ON CYBERSECURITY (SBSEG), 5. , 2005, Florianópolis.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2005
.
p. 28-31.
DOI: https://doi.org/10.5753/sbseg.2005.21541.
