Ciphertexts-only attack on a linear fully ho-momorphic cryptosystem
The paper proposes a new ciphertexts-only attack on a linear fully homomorphic cryptosystem based on the problem of big numbers factorization. Theoretical and practical estimations of probability to find a key using this attack are given. Also, a link between factorization problem and cryptosystem security is analysed. It is shown how to increase the efficiency by replacing modulo n without loss of cipher strength.
Download file
Counter downloads: 245
Keywords
ciphertexts-only attack, factorization problem, fully homomorphic encryption, атака по шифртекстам, задача факторизации чисел, полностью гомоморфное шифрованиеAuthors
| Name | Organization | |
| Trepacheva A. V. | Southern Federal University (Rostov-on-Don) | alina1989malina@ya.ru |
References
Kipnis A. and Hibshoosh E. Efficient methods for practical fully homomorphic symmetric-key encrypton, randomization and verification // IACR Cryptology ePrint Archive. 2012. No. 637.
Vizar D. and Vaudenay S. Analysis of chosen symmetric homomorphic schemes // Central European Crypto Conference, Budapest, Hungary, 2014, EPFL-CONF-198992.
Guellier A. Can Homomorphic Cryptography ensure Privacy? PhD thesis, Inria; IRISA; Supelec Rennes, equipe Cidre; Universite de Rennes 1, 2014.
Ciphertexts-only attack on a linear fully ho-momorphic cryptosystem | Applied Discrete Mathematics. Supplement. 2015. № 8.
Download full-text version
Counter downloads: 1755