An official website of the United States government
We describe a generic high-speed hardware architecture for the lattice-based post-quantum cryptosystem Round5. This architecture supports both public-key encryption (PKE) and a key encapsulation mechanism (KEM). Due to several hardware-friendly features, Round5 can achieve very high performance when implemented in modern FPGAs.
more »
« less
Code Structures for Quantum Encryption and Decryption
The paradigm of quantum computation has led to the development of new algorithms as well variations on existing algorithms. In particular, novel cryptographic techniques based upon quantum computation are of great interest. Many classical encryption techniques naturally translate into the quantum paradigm because of their well-structured factorizations and the fact that they can be phased in the form of unitary operators. In this work, we demonstrate a quantum approach to data encryption and decryption based upon the McEliece cryptosystem using Reed-Muller codes. This example is of particular interest given that post-quantum analyses have highlighted this system as being robust against quantum attacks. Finally, in anticipation of quantum computation operating over binary fields, we discuss alternative operator factorizations for the proposed cryptosystem.
more »
« less
- Award ID(s):
- 2000136
- PAR ID:
- 10213979
- Date Published:
- Journal Name:
- 2021 IEEE 5th International Conference on Cryptography, Security and Privacy
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Homomorphic encryption can address key privacy challenges in cloud-based outsourcing by enabling potentially untrusted servers to perform meaningful computation directly on encrypted data. While most homomorphic encryption schemes offer addition and multiplication over ciphertexts natively, any non-linear functions must be implemented as costly polynomial approximations due to this restricted computational model. Nevertheless, the CGGI cryptosystem is capable of performing arbitrary univariate functions over ciphertexts in the form of lookup tables through the use of programmable bootstrapping. While promising, this procedure can quickly become costly when high degrees of precision are required. To address this challenge, we propose Ripple: a framework that introduces different approximation methodologies based on discrete wavelet transforms (DWT) to decrease the number of entries in homomorphic lookup tables while maintaining high accuracy. Our empirical evaluations demonstrate significant error reduction compared to plain quantization methods across multiple non-linear functions. Notably, Ripple improves runtime performance for realistic applications, such as logistic regression and Euclidean distance.more » « less
-
Advanced sensing and cloud systems propel the rapid advancements of service-oriented smart manufacturing. As a result, there is widespread generation and proliferation of data in the interest of manufacturing analytics. The sheer amount and velocity of data have also attracted a myriad of malicious parties, unfortunately resulting in an elevated prevalence of cyber-attacks whose impacts are only gaining in severity. Therefore, this article presents a new distributed cryptosystem for analytical computing on encrypted data in the manufacturing environment, with a case study on manufacturing resource planning. This framework harmonizes Paillier cryptography with the Alternating Direction Method of Multipliers (ADMM) for decentralized computation on encrypted data. Security analysis shows that the proposed Paillier-ADMM system is resistant to attacks from external threats, as well as privacy breaches from trusted-but-curious third parties. Experimental results show that smart allocation is more cost-effective than the benchmarked deterministic and stochastic policies. The proposed distributed cryptosystem shows strong potential to leverage the distributed data for manufacturing intelligence, while reducing the risk of data breaches.more » « less
-
The success of matrix factorizations such as the singular value decomposition (SVD)has motivated the search for even more factorizations. We catalog 53 matrix factorizations, most ofwhich we believe to be new. Our systematic approach, inspired by the generalized Cartan decom-position of the Lie theory, also encompasses known factorizations such as the SVD, the symmetriceigendecomposition, the CS decomposition, the hyperbolic SVD, structured SVDs, the Takagi factor-ization, and others thereby covering familiar matrix factorizations, as well as ones that were waitingto be discovered. We suggest that the Lie theory has one way or another been lurking hidden in thefoundations of the very successful field of matrix computations with applications routinely used in somany areas of computation. In this paper, we investigate consequences of the Cartan decompositionand the little known generalized Cartan decomposition for matrix factorizations. We believe thatthese factorizations once properly identified can lead to further work on algorithmic computationsand applications.more » « less
-
Quantum information can be used to achieve novel cryptographic primitives that are impossible to achieve classically. A recent work by Ananth, Poremba, Vaikuntanathan (TCC 2023) focuses on equipping the dual-Regev encryption scheme, introduced by Gentry, Peikert, Vaikuntanathan (STOC 2008), with key revocation capabilities using quantum information. They further showed that the key-revocable dual-Regev scheme implies the existence of fully homomorphic encryption and pseudorandom functions, with both of them also equipped with key revocation capabilities. Unfortunately, they were only able to prove the security of their schemes based on new conjectures and left open the problem of basing the security of key revocable dual-Regev encryption on well-studied assumptions. In this work, we resolve this open problem. Assuming polynomial hardness of learning with errors (over sub-exponential modulus), we show that key-revocable dual-Regev encryption is secure. As a consequence, for the first time, we achieve the following results: Key-revocable public-key encryption and key-revocable fully-homomorphic encryption satisfying classical revocation security and based on polynomial hardness of learning with errors. Prior works either did not achieve classical revocation or were based on sub-exponential hardness of learning with errors. Key-revocable pseudorandom functions satisfying classical revocation from the polynomial hardness of learning with errors. Prior works relied upon unproven conjectures.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript
- Conference Paper:
- The DOI is not currently available.
