Abstract
This paper examines possible trapdoor structures which can be used to design public key cryptosystems based on the factorization problem. Some examples of such finite trapdoor systems which might serve as a basis for a generalized RSA cryptosystem are proposed.
| Original language | English |
|---|---|
| Pages (from-to) | 153-173 |
| Number of pages | 21 |
| Journal | International Journal of Computer Mathematics |
| Volume | 19 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1986 |
| Externally published | Yes |
Keywords
- computation in finite fields and rings
- cryptography
- data encryption
- factorization
- prime numbers
- privacy
- Public key cryptosystems
- security
- trapdoor systems