Abstract
In this chapter we review the concept of public-key cryptography (PKC) and then describe two PKC schemes namely, elliptic-curve cryptography and lattice-based cryptography.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abdalla M, Bellare M, Rogaway P (2001) The oracle Diffie-Hellman assumptions and an analysis of DHIES. In: Topics in cryptology–CT-RSA 2001: the cryptographers’ track at RSA conference 2001, San Francisco, CA, USA, 8–12 April 2001. Proceedings. Springer, Berlin, pp 143–158
Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: Proceedings of the 28th annual ACM symposium on theory of computing, STOC’96. New York, NY, USA, pp 99–108. ACM
Ajtai M (1998) The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract). In: Proceedings of the 30th annual ACM symposium on theory of computing, STOC’98. New York, NY, USA, pp 10–19. ACM
Ajtai M, Kumar R, Sivakumar D (2001) A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33rd annual ACM symposium on theory of computing, STOC’01. New York, NY, USA, pp 601–610. ACM
Bernstein D (2008) Fast multiplication and its applications. Algorithmic Number Theory 44:325–384
Brumley BB, Järvinen KU (2010) Conversion algorithms and implementations for Koblitz curve cryptography. IEEE Trans Comput 59(1):81–92
Buchmann J, Cabarcas D, Göpfert F, Hülsing A, Weiden P (2014) Discrete ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers. In: Selected areas in cryptography—SAC 2013: 20th international conference, Burnaby, BC, Canada, August 14-16, 2013. Revised Selected Papers. Springer, Berlin, pp 402–417
Devroye L (1986) Non-uniform random variate generation. Springer, New York
Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theory IT-22(6):644–654
Dwarakanath N, Galbraith S (2014) Sampling from discrete Gaussians for lattice-based cryptography on a constrained device. Appl Algebra Eng Commun Comput 25(3):159–180
Galbraith SD, Gaudry P (2016) Recent progress on the elliptic curve discrete logarithm problem. Des Codes Cryptogr 78(1):51–72
Göttert N, Feller T, Schneider M, Buchmann J, Huss S (2012) On the design of hardware building blocks for modern lattice-based encryption schemes. In: Cryptographic hardware and embedded systems–CHES 2012. LNCS, vol 7428. Springer, Berlin, pp 512–529
Hankerson D, Menezes AJ, Vanstone S (2003) Guide to elliptic curve cryptography. Springer, New York
Hoffstein J, Pipher J, Silverman J (2008) An introduction to mathematical cryptography, 1st edn. Springer Publishing Company, New York, Incorporated
Itoh T, Tsujii S (1988) A fast algorithm for computing multiplicative inverses in \(GF(2^m)\) using normal bases. Inf Comput 78(3):171–177
Knuth DE, Yao AC (1976) The complexity of non-uniform random number generation. Algorithms and complexity, pp 357–428
Koblitz N (1991) CM-curves with good cryptographic properties. In: Advances in cryptology–CRYPTO’91. Lecture notes in computer science, vol 576. Springer, Berlin, pp 279–287
Koblitz N (1987) Elliptic curve cryptosystems. Math Comput 48:203–209
Lyubashevsky V (2012) Lattice signatures without trapdoors. In: Proceedings of the 31st annual international conference on theory and applications of cryptographic techniques, EUROCRYPT’12. Springer, Berlin, pp 738–755
Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: Advances in cryptology–EUROCRYPT 2010. Lecture notes in computer science, vol 6110. Springer, Berlin, pp 1–23
Micciancio D (2001) The hardness of the closest vector problem with preprocessing. IEEE Trans Inf Theory 47(3):1212–1215
Miller V (1986) Uses of elliptic curves in cryptography. In: Advances in cryptology, Crypto’85, vol 218, pp 417–426
National Institute of Standard and Technology (2000) Federal Information Processing Standards Publication, FIPS 186–2. Digital Signature Standard
National Institute of Standards and Technology (2013) Digital signature standard (DSS). Federal Information Processing Standard, FIPS PUB 186-4
Pollard JM (1975) A Monte Carlo method for factorization. BIT Numer Math 15(3):331–334
Rebeiro C, Mukhopadhyay D (2008) Power attack resistant efficient FPGA architecture for Karatsuba multiplier. In: Proceedings of the 21st international conference on VLSI design, VLSID’08. Washington, DC, USA, pp 706–711. IEEE Computer Society
Regev O (2005) On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th annual ACM symposium on theory of computing, STOC’05. New York, NY, USA, pp 84–93. ACM
Regev O (2009) Lattices in computer science. Lecture notes of a course given in Tel Aviv University. http://www.cims.nyu.edu/~regev/teaching/lattices_fall_2009/
Schnorr CP, Euchner M (1994) Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math Program 66(1):181–199
Solinas JA (2000) Efficient arithmetic on Koblitz curves. Des Codes Cryptogr 19(2–3):195–249
von zur Gathen J , Gerhard J (1999) Modern computer algebra. Cambridge University Press, New York
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Sinha Roy, S., Verbauwhede, I. (2020). Background. In: Lattice-Based Public-Key Cryptography in Hardware. Computer Architecture and Design Methodologies. Springer, Singapore. https://doi.org/10.1007/978-981-32-9994-8_2
Download citation
DOI: https://doi.org/10.1007/978-981-32-9994-8_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-32-9993-1
Online ISBN: 978-981-32-9994-8
eBook Packages: EngineeringEngineering (R0)