Improved known plaintexts attack on Domingo-Ferrer homomorphic cryptosystem
This paper is devoted to known plaintexts cryptanalysis of homomorphic cryptosystem proposed by Domingo-Ferrer. In previous works it was shown that at least pairs (plaintext, ciphertext) are necessary to recover secret key, where is a degree of polynomials representing ciphertexts. Here we analyze e...
| الحاوية / القاعدة: | Труды Института системного программирования РАН |
|---|---|
| المؤلف الرئيسي: | |
| التنسيق: | مقال |
| اللغة: | الإنجليزية |
| منشور في: |
Russian Academy of Sciences, Ivannikov Institute for System Programming
2018-10-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://ispranproceedings.elpub.ru/jour/article/view/837 |
