Idempotent Factorizations in the Cryptography Classroom
| Autor: | Barry Fagin |
|---|---|
| Rok vydání: | 2020 |
| Předmět: | |
| Zdroj: | The College Mathematics Journal. 51:195-203 |
| ISSN: | 1931-1346 0746-8342 |
| Popis: | The RSA cryptosystem [14] requires two primes (p, q). Its security is based on the time required to factor n = pq without knowing p or q, since no polynomial-time factoring algorithms are known. Cu... |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|