Paper 2014/250

Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme

Boaz Tsaban and Noam Lifshitz

Abstract

The fully homomorphic symmetric encryption scheme \emph{MORE} encrypts keys by conjugation with a random invertible matrix over an RSA modulus. We provide a two known-ciphertexts cryptanalysis recovering a linear dependence among the two encrypted keys.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. MAJOR revision.Journal of Mathematical Cryptology 9 (2015), 75-78.
DOI
10.1515/jmc-2014-0013
Keywords
symmetric fully homomorphic encryption
Contact author(s)
tsaban @ math biu ac il
History
2015-06-05: revised
2014-04-20: received
See all versions
Short URL
https://ia.cr/2014/250
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/250,
      author = {Boaz Tsaban and Noam Lifshitz},
      title = {Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme},
      howpublished = {Cryptology ePrint Archive, Paper 2014/250},
      year = {2014},
      doi = {10.1515/jmc-2014-0013},
      note = {\url{https://eprint.iacr.org/2014/250}},
      url = {https://eprint.iacr.org/2014/250}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.