Abstract
The fully homomorphic symmetric encryption scheme MORE encrypts random keys by conjugation with a random invertible matrix over an RSA modulus. We provide a known-ciphertext cryptanalysis recovering a linear dependence among any pair of encrypted keys.
| Original language | English |
|---|---|
| Pages (from-to) | 75-78 |
| Number of pages | 4 |
| Journal | Journal of Mathematical Cryptology |
| Volume | 9 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1 Jun 2015 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2015 by De Gruyter.
Keywords
- Fully homomorphic encryption
- conjugacy problem
- symmetric key cryptography