Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware

Pöppelmann, Thomas; Güneysu, Tim

doi:10.1007/978-3-662-43414-7_4

Cited by 94 publications

(97 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In conclusion, it can be seen that the polynomial multiplier proposed in this chapter was a huge improvement over previous work [GFS + 12] and applicable for the implementation of latticebased encryption [PG13] and signature schemes [PDG14a,GLP15]. Moreover, our initial design was a first approach that has been extended by follow-up work.…”

Section: Discussionmentioning

confidence: 84%

“…However, more detailed coverage of efficient methods to realize the processing element (PE) and general improvements to the architecture have been added. Details on the microcode engine were published in [PG13] and the instruction set appeared in [GLP15]. …”

Section: Chapter 4 Polynomial Multiplication On Reconfigurable Hardwarementioning

confidence: 99%

“…In this section we discuss follow-up works by other authors [APS13, CMV + 14, RVM + 14] works who directly refer to the original publication of the proposed polynomial multiplier [PG12] or the microcode engine [PG13] for comparison.…”

Section: Review Of Follow-up Work On Polynomial Multiplicationmentioning

confidence: 99%

“…Additionally, we cover some techniques to reduce decryption errors and ciphertext expansion. The high-speed implementation presented in this chapter is based on [PG13] and the low-area implementation appeared in [PG14]. Some background material from [POG15a] is also used.…”

Section: Chapter 5 Implementation Of Ring-lwe Encryption Onmentioning

confidence: 99%

See 3 more Smart Citations

Efficient implementation of ideal lattice-based cryptography

Pöppelmann¹

2017

It - Information Technology

Self Cite

View full text Add to dashboard Cite

Digital signatures and public-key encryption are used to protect almost any secure communication channel on the Internet or between embedded devices. Currently, protocol designers and engineers usually rely on schemes that are either based on the factoring assumption (RSA) or on the hardness of the discrete logarithm problem (DSA/ECDSA). But in case of advances in classical cryptanalysis or progress on the development of quantum computers the hardness of these closely related problems might be seriously weakened. In order to prepare for such an event, research on alternatives is required to provide long-term security.In this thesis, we focus on the efficient implementation of such alternative public-key cryptosystems whose security is based on the intractability of certain computational problems on ideal lattices. While an extensive theoretical background exists for lattice-based and ideal latticebased cryptography, not much is known about the efficiency of practical instantiations, especially on constrained and cost-sensitive platforms. We thus investigate novel algorithms and implementation techniques for fast and flexible polynomial multiplication and Gaussian sampling and then use these building blocks to implement public-key encryption and signature schemes. The results provided in this thesis show that lattice-based schemes can be optimized for high performance or resource efficiency on embedded microcontrollers and reconfigurable hardware. Our implementations of a public-key encryption scheme based on the ring learning with errors problems (RLWE) or of the bimodal lattice signature scheme (BLISS) can even outperform classical ECC-and RSA-based implementations.Lattice-based cryptography can also be used to realize homomorphic cryptography that allows computation on encrypted data. However, due to the large parameter sets and complex operations required, even for simple homomorphic evaluation operations, the performance of these schemes is a major issue preventing practical usage. In this thesis we investigate options for acceleration of homomorphic cryptography in a cloud environment using reconfigurable hardware. We implement all evaluation operations of the YASHE homomorphic encryption scheme and propose methods to deal with large ciphertext and key sizes as well as limited memory bandwidth. KeywordsPost-quantum cryptography, public-key cryptosystem, embedded system, microcontroller, FPGA KurzfassungDigitale Signaturen und Public-Key-Verschlüsselung werden für den Schutz nahezu jeder sicheren Kommunikation über das Internet oder zwischen eingebetteten Systemen genutzt. Die Sicherheit basiert dabei entweder auf der Faktorisierungsannahme (RSA) oder der Annahme, dass es schwer ist, das diskrete Logarithmus-Problem (DSA/ECDSA) zu lösen. Durch Fortschritte in der klassischen Kryptoanalyse oder bei der Entwicklung von Quantencomputern könnten diese Probleme allerdings in Zukunft ernsthaft geschwächt oder gelöst werden. Daher ist Forschung zu alternativen Public-Key-Kryptosystemen erforderlich, die in ...

show abstract

Section: Discussionmentioning

confidence: 84%

Section: Chapter 4 Polynomial Multiplication On Reconfigurable Hardwarementioning

confidence: 99%

Section: Review Of Follow-up Work On Polynomial Multiplicationmentioning

confidence: 99%

Section: Chapter 5 Implementation Of Ring-lwe Encryption Onmentioning

confidence: 99%

See 2 more Smart Citations

Efficient implementation of ideal lattice-based cryptography

Pöppelmann¹

2017

It - Information Technology

Self Cite

View full text Add to dashboard Cite

show abstract

“…After the proposal of the encryption scheme, several implementations of the encryption scheme followed [12,25,29,7,3,18,27]. The basic arithmetic operations are polynomial multiplication, addition, subtraction, and generation of error polynomials from a discrete Gaussian distribution.…”

Section: Public-key Encryption Schemesmentioning

confidence: 99%

Ring-LWE: Applications to Cryptography and Their Efficient Realization

Roy

Karmakar

Verbauwhede

2016

Security, Privacy, and Applied Cryptography Engineering

View full text Add to dashboard Cite

Abstract. The persistent progress of quantum computing with algorithms of Shor and Proos and Zalka has put our present RSA and ECC based public key cryptosystems at peril. There is a flurry of activity in cryptographic research community to replace classical cryptography schemes with their post-quantum counterparts. The learning with errors problem introduced by Oded Regev offers a way to design secure cryptography schemes in the post-quantum world. Later for efficiency LWE was adapted for ring polynomials known as Ring-LWE. In this paper we discuss some of these ring-LWE based schemes that have been designed. We have also drawn comparisons of different implementations of those schemes to illustrate their evolution from theoretical proposals to practically feasible schemes.

show abstract

Generic and Practical Key Establishment from Lattice

Jin

Zhao

2019

Applied Cryptography and Network Security

View full text Add to dashboard Cite

Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware

Cited by 94 publications

References 41 publications

Efficient implementation of ideal lattice-based cryptography

Efficient implementation of ideal lattice-based cryptography

Ring-LWE: Applications to Cryptography and Their Efficient Realization

Generic and Practical Key Establishment from Lattice

Contact Info

Product

Resources

About