(Inspiration) Using quantum computing to further cryptography
(What it does) Select number for a and N; a is set to a number that is less than N for the code to run/find the coprimes of N.
(How we built it)
(Challenges we ran into) We had trouble setting up the code to match the math we did out classically considering we needed to understand modular exponentiation.
(Accomplishments) We're proud of taking the time to work through the issues encounter when setting up the code.
(What we learned) The period has to be an even number as when applying an odd numer to solve for the gcd leads to irrational numbers from the power being a fraction.
Log in or sign up for Devpost to join the conversation.