About Cryptanalysis of One Fully Homomorphic Cryptosystem Based on Factorization Problem
Abstract
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 of the proposed KPA depends polynomially on the parameters of FHC and logarithmically on the size of plaintexts space. Also we discuss how ciphertexts only attack (COA) on this FHC may be reduced to KPA.
Keywords
Citation
ID:
61560
References
Blockchain Verification
Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
61560
Unique Identifier:
2aa023795b968538122e9a2c95aa5912
Network:
Scimatic Chain (ID: 481)
Loading...
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
Creates 1,000,000 NFT tokens for this article
Token Features:
- ERC-1155 Standard NFT
- 1 Million Supply per Article
- Transferable via MetaMask
- Permanent Blockchain Record
Scan with Saymatik Web3.0 Wallet