Due to recent developments in the field of quantum computers, cryptologists are actively looking to build quantum-resistant cryptographic algorithms. Using those machines, many of today’s most prevalent cryptosystems can be cracked by Shor's Algorithm which uses quantum computation to equate the prime number phases expressed as sine waves to factor large integers, effectively solving the discrete logarithm problem that many current cryptographic algorithms are focused on.
-
Notifications
You must be signed in to change notification settings - Fork 0
Due to recent developments in the field of quantum computers, cryptologists are actively looking to build quantum-resistant cryptographic algorithms. Using those machines, many of today’s most prevalent cryptosystems can be cracked by Shor's Algorithm which uses quantum computation to equate the prime number phases expressed as sine waves to fac…
devanshi-code18/post_quantum_cryptography
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Due to recent developments in the field of quantum computers, cryptologists are actively looking to build quantum-resistant cryptographic algorithms. Using those machines, many of today’s most prevalent cryptosystems can be cracked by Shor's Algorithm which uses quantum computation to equate the prime number phases expressed as sine waves to fac…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published