Geodesic
Ciphertexts-only attack on a~linear fully homomorphic cryptosystem
Prikladnaya Diskretnaya Matematika. Supplement, no. 8 (2015), pp. 75-78.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
Keywords: fully homomorphic encryption, factorization problem, ciphertexts-only attack. 
@article{PDMA_2015_8_a27,
     author = {A. V. Trepacheva},
     title = {Ciphertexts-only attack on a~linear fully homomorphic cryptosystem},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {75--78},
     publisher = {mathdoc},
     number = {8},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2015_8_a27/}
}
TY  - JOUR
AU  - A. V. Trepacheva
TI  - Ciphertexts-only attack on a~linear fully homomorphic cryptosystem
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2015
SP  - 75
EP  - 78
IS  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2015_8_a27/
LA  - ru
ID  - PDMA_2015_8_a27
ER  - 
%0 Journal Article
%A A. V. Trepacheva
%T Ciphertexts-only attack on a~linear fully homomorphic cryptosystem
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2015
%P 75-78
%N 8
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2015_8_a27/
%G ru
%F PDMA_2015_8_a27
A. V. Trepacheva. Ciphertexts-only attack on a~linear fully homomorphic cryptosystem. Prikladnaya Diskretnaya Matematika. Supplement, no. 8 (2015), pp. 75-78. http://geodesic.mathdoc.fr/item/PDMA_2015_8_a27/

[1] Guellier A., Can Homomorphic Cryptography ensure Privacy?, PhD thesis, Inria; IRISA; Supélec Rennes, équipe Cidre; Université de Rennes 1, 2014

[2] Kipnis A., Hibshoosh E., Efficient methods for practical fully homomorphic symmetric-key encrypton, randomization and verification, IACR Cryptology ePrint Archive, No 637, 2012

[3] Vizár D., Vaudenay S., “Analysis of chosen symmetric homomorphic schemes”, Central European Crypto Conference, Budapest, Hungary, 2014, EPFL-CONF-198992