Turning Hard Problems into Post-quantum Solutions
Today, mathematicians, computer scientists, engineers, and others are rushing to find what my dad luckily did not have to: problems that are hard for both classical and quantum computers to soke. Present-day cryptography is based on mathematical problems that are time-consuming for classical machine...
Saved in:
| Published in | American scientist Vol. 112; no. 2; pp. 82 - 86 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Research Triangle Park
Sigma XI-The Scientific Research Society
01.03.2024
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0003-0996 1545-2786 |
| DOI | 10.1511/2024.112.2.82 |
Cover
| Summary: | Today, mathematicians, computer scientists, engineers, and others are rushing to find what my dad luckily did not have to: problems that are hard for both classical and quantum computers to soke. Present-day cryptography is based on mathematical problems that are time-consuming for classical machines. Hackers try to solve these problems to extract raw data from its encrypted form. As computational speed increases, we make the problems longer, just like my dad did. Up to this point, making small adjustments and cleverly expounding upon previous ideas has been sufficient. Cryptography is an ancient secret-keeping practice. The word is derived from the Greek krypk, which means to keep hidden, and graphia, which means writing. It is the art and science of obscuring information (text or numerical data) in such a way that it becomes unreadable. It is used in powerful ways behind the scenes to allow secure communications, financial transactions, and blockchain ledgers used to validate bitcoin transactions. |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Commentary-1 content type line 14 |
| ISSN: | 0003-0996 1545-2786 |
| DOI: | 10.1511/2024.112.2.82 |