Abstract
We consider cryptosystems for homomorphic encryption schemes based on the Residue Number System (RNS) and Secret Sharing Schemes. One of their disadvantages is that they are directly related to data redundancy, and hence, increasing the size of the storage. To minimize it, homophonic encryption can be combined with the arithmetic coding known as Chinese remainder theorem. We describe a new method of cryptanalysis based on a property of RNS and theory of numbers. We prove that an attacker needs only η · [log2 log2(k · pn)l arbitrary generated input files that form the 'known-plaintext', where pi is moduli RNS, to calculate the secret key required to decrypt the entire data. © 2018 IEEE.
Original language | English |
---|---|
Pages | 270-274 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 2018 |
Event | 2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering - St. Petersburg Electrotechnical University “LETI”, St. Petersburg, Russian Federation Duration: 29 Jan 2018 → 1 Feb 2018 |
Conference
Conference | 2018 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering |
---|---|
Abbreviated title | ElConRus 2018 |
Country/Territory | Russian Federation |
City | St. Petersburg |
Period | 29/01/18 → 1/02/18 |
Keywords
- cloud computing
- homomorphic encryption
- known-plaintext attack
- Cloud computing
- Computation theory
- Digital storage
- Number theory
- Numbering systems
- Arithmetic Coding
- Chinese remainder theorem
- Ho-momorphic encryptions
- Homomorphic Encryption Schemes
- Known-plaintext attacks
- Residue number system
- Secret sharing schemes
- Security analysis
- Cryptography