1Department of Mathematics, Bar-Ilan University, Ramat Gan 5290002; and
Department of Mathematics, Weizmann Institute of Science, Rehovot 7610001, Israel
2Department of Mathematics, Bar-Ilan University, Ramat Gan 5290002, Israel
Citation Information: Journal of Mathematical Cryptology. Volume 9, Issue 2, Pages 75–78, ISSN (Online) 1862-2984, ISSN (Print) 1862-2976, DOI: 10.1515/jmc-2014-0013, November 2014

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.
Comments (0)