Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Telecommunications Symposium (ITS)

Quantum Permanent Compromise Attack to Blum-Micali Pseudorandom Generator

Elloá B. Guedes, Francisco de Assis, Bernardo Jr.

Published Jan 1, 2010• 3 citations
Publisher
DOI
10.14209/sbrt.2010.26

Related papers

Quantum Attacks on the Sum of Even-Mansour Pseudorandom Function

Kazuo Shinagawa, Tetsu Iwata

IEICE Technical Report; IEICE Tech. Rep.•Jul 13, 2020•0 citations

Distributed Quantum Key Recovery Attack on Pseudorandom Functions

Kun Zhang, Tao Shang, Yuanjing Zhang +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

Scalable, Quantum-Accessible, and Adaptive Pseudorandom Quantum State and Pseudorandom Function-Like Quantum State Generators

Rishabh Batra, Zhili Chen, Rahul Jain +1 more

arXiv:2507.22535•Lecture notes in computer science•Jan 1, 2026•2 citations

Quantum Pseudorandom Scramblers

Chuhan Lu, Minglong Qin, Fang Song +2 more

Lecture notes in computer science•Nov 27, 2024•15 citations

Examples of the Generalized Quantum Permanent Compromise Attack to the Blum-Micali Construction

Elloá B. Guedes, Francisco de Assis, Bernardo Lula

This paper presents examples of the quantum permanent compromise attack to the Blum-Micali construction. Such attacks illustrate how a previous attack to the Blum-Micali generator can be extended to the whole Blum-Micali construction, including the Blum-Blum-Shub and Kaliski generators.

arXiv:1012.1776•Dec 8, 2010•1 citation

Quantum attacks on pseudorandom generators

Elloá B. Guedes, Francisco de Assis, Bernardo Lula

There are advantages in the use of quantum computing in the elaboration of attacks on certain pseudorandom generators when compared with analogous attacks using classical computing. This paper presents a polynomial time quantum attack on the Blum–Micali generator, which is considered secure against threats from classical computers. The proposed attack uses a Grover inspired procedure together with the quantum discrete logarithm, and is able to recover previous and future outputs of the generator under attack, thereby completely compromising its unpredictability. The attack can also be adapted to other generators, such as Blum–Micali generators with multiple hard-core predicates and generators from the Blum–Micali construction, and also to scenarios where the requirements on the bits are relaxed. Such attacks represent a threat to the security of the pseudorandom generators adopted in many real-world cryptosystems.

Mathematical Structures in Computer Science•Dec 20, 2012•7 citations
There are advantages in the use of quantum computing in the elaboration of attacks on certain pseudorandom generators when compared with analogous attacks using classical computing. This paper presents a polynomial time quantum attack on the Blum–Micali generator, which is considered secure against threats from classical computers. The proposed attack uses a Grover inspired procedure together with the quantum discrete logarithm, and is able to recover previous and future outputs of the generator under attack, thereby completely compromising its unpredictability. The attack can also be adapted to other generators, such as Blum–Micali generators with multiple hard-core predicates and generators from the Blum–Micali construction, and also to scenarios where the requirements on the bits are relaxed. Such attacks represent a threat to the security of the pseudorandom generators adopted in many real-world cryptosystems.