About Cryptanalysis of One Fully Homomorphic Cryptosystem Based on Factorization Problem
We present a known plaintext attack (KPA) on a recently proposed fully homomorphic cryptosystem (FHC), based on the problem of big integers factoring. We show that the considered FHC is insecure against KPA even if only one pair (plaintext, ciphertext) was intercepted by an adversary. The complexity...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Joint Stock Company "Experimental Scientific and Production Association SPELS
2015-12-01
|
| Series: | Безопасность информационных технологий |
| Subjects: | |
| Online Access: | https://bit.mephi.ru/index.php/bit/article/view/61 |