cryptography

Shor's algorithm breaks RSA cryptography by applying quantum phase estimation and period finding to factor integers in polynomial time. This Skill demonstrates the process through hands-on Python simulations, allowing you to observe how quantum circuits reveal the cryptographic structure of factoring and order finding.

For the discrete logarithm problem, this Skill provides discrete log attack demonstrations using quantum circuits. It applies quantum phase estimation to analyze and break cryptographic primitives, offering a hands-on look at how hidden subgroup structure is exploited.

Yes, you need understanding of QFT, quantum phase estimation, modular arithmetic, and linear algebra to use this cryptography Skill. It is designed for advanced educational demonstrations and research tasks involving cryptographic vulnerabilities.

You can simulate Simon's problem and the hidden subgroup problem in Python by running the included Simon examples in this Skill. It involves hands-on circuit construction, simulation, and classical post-processing to recover secret cryptographic quantities.

No, this Skill is intended for educational demonstrations and research tasks, not real-world production systems. It uses Python-based simulations to identify cryptographic vulnerabilities by applying quantum phase estimation to factoring, discrete logarithm, and hidden-subgroup problems.