{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T17:15:56Z","timestamp":1790183756485,"version":"4.1.0"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2015,7,1]]},"DOI":"10.1109\/tc.2014.2346177","type":"journal-article","created":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T18:35:33Z","timestamp":1407436533000},"page":"1954-1967","source":"Crossref","is-referenced-by-count":16,"title":["Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware"],"prefix":"10.1109","volume":"64","author":[{"given":"Tim","family":"Guneysu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vadim","family":"Lyubashevsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Poppelmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","year":"0"},{"key":"ref38","article-title":"Multiplication of multidigit numbers on automata","volume":"7","author":"karatsuba","year":"0"},{"key":"ref33","first-page":"122","article-title":"NTRUSIGN: Digital signatures using the NTRU lattice","author":"hoffstein","year":"0"},{"key":"ref32","first-page":"62","article-title":"Ultra high performance ECC over NIST primes on commercial FPGAs","author":"g\u00fcneysu","year":"0","journal-title":"Proc Workshop Cryptograph Hardware Embedded Syst"},{"key":"ref31","first-page":"67","article-title":"Software speed records for lattice-based signatures","author":"g\u00fcneysu","year":"0","journal-title":"Proc Int Conf Post-Quantum Cryptography"},{"key":"ref30","first-page":"530","article-title":"Practical lattice-based cryptography: A signature scheme for embedded systems","author":"g\u00fcneysu","year":"0","journal-title":"Proc Workshop Cryptograph Hardware Embedded Syst"},{"key":"ref37","author":"joux","year":"0"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35999-6_5"},{"key":"ref35","first-page":"211","article-title":"NSS: An NTRU lattice-based signature scheme","author":"hoffstein","year":"0","journal-title":"Proc Int Conf Theory Appl Cryptograph Techn Adv Cryptol"},{"key":"ref34","first-page":"267","article-title":"NTRU: A ring-based public key cryptosystem","author":"hoffstein","year":"0","journal-title":"Proc Algorithmic Number Theory Symp III"},{"key":"ref60","author":"solinas","year":"1999","journal-title":"Generalized Mersenne numbers"},{"key":"ref62","year":"0"},{"key":"ref61","first-page":"617","article-title":"Efficient public key encryption based on ideal lattices","author":"stehl\u00e9","year":"0","journal-title":"Proc 15th Int Conf Theory Appl Cryptol Inf Security Adv Cryptol"},{"key":"ref63","first-page":"272","article-title":"How to maximize the potential of FPGA resources for modular exponentiation","author":"suzuki","year":"0","journal-title":"Proc Workshop Cryptograph Hardware Embedded Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.164"},{"key":"ref64","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7091-6571-3","author":"winkler","year":"1996","journal-title":"Polynomial Algorithms in Computer Algebra (Texts and Monographs in Symbolic Computation)"},{"key":"ref27","first-page":"112","article-title":"Public-key cryptosystems from lattice reduction problems","author":"goldreich","year":"0","journal-title":"Proc 16th Annu Int Cryptol Conf Adv Cryptol"},{"key":"ref29","first-page":"512","article-title":"On the design of hardware building blocks for modern lattice-based encryption schemes","author":"g\u00f6ttert","year":"0","journal-title":"Proc Workshop Cryptograph Hardware Embedded Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22006-7_34"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.133"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00200-014-0218-3","article-title":"Sampling from discrete Gaussians for lattice-based cryptography on a constrained device","volume":"25","author":"dwarakanath","year":"2014","journal-title":"Applicable Algebra in Eng Commun Comput"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43414-7_12"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04138-9_4"},{"key":"ref24","first-page":"245","article-title":"An efficient pseudo-random generator provably as secure as syndrome decoding","author":"fischer","year":"0","journal-title":"Proc 14th Annu Int Conf Theory Appl Cryptogr Technol"},{"key":"ref23","first-page":"159","article-title":"Parallel-CFS: Strengthening the CFS McEliece-based signature scheme","author":"finiasz","year":"0","journal-title":"Proc Sel Areas Cryptography"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"ref50","first-page":"147","article-title":"Lattice-based cryptography","author":"micciancio","year":"0"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00145-008-9031-0","article-title":"Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures","volume":"22","author":"q","year":"2009","journal-title":"J Cryptol"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.115"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref57","first-page":"383","article-title":"High precision discrete Gaussian sampling on FPGAs","author":"roy","year":"0","journal-title":"Proc Sel Areas Cryptography"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43414-7_4"},{"key":"ref55","first-page":"139","article-title":"Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware","author":"p\u00f6ppelmann","year":"0","journal-title":"Proc 2nd Int Conf Cryptol Inf Security Latin Amer"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010003"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23951-9_31"},{"key":"ref52","first-page":"145","article-title":"Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices","author":"peikert","year":"0","journal-title":"Proc Theory Cryptography"},{"key":"ref10","first-page":"45","author":"bogdanov","year":"0"},{"key":"ref11","first-page":"402","article-title":"Discrete ziggurat: A time-memory trade-off for sampling from a Gaussian distribution over the integers","author":"buchmann","year":"0","journal-title":"Proc Sel Areas Cryptography"},{"key":"ref40","first-page":"598","article-title":"Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures","author":"lyubashevsky","year":"0","journal-title":"Proc 15th Int Conf Theory Appl Cryptol Inf Security Adv Cryptol"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_8"},{"key":"ref13","first-page":"171","article-title":"Trivium: A stream cipher construction inspired by block cipher design principles","author":"canni\u00e8re","year":"0","journal-title":"Proc 4th Int Ind Simul Conf"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04138-9_3"},{"key":"ref15","first-page":"1","article-title":"BKZ 2.0: Better lattice security estimates","author":"chen","year":"0","journal-title":"Proc 17th Int Conf Theory Appl Cryptol Inf Security"},{"key":"ref16","first-page":"157","article-title":"How to achieve a McEliece-based digital signature scheme","author":"courtois","year":"0","journal-title":"Proc Int Conf Theory Appl Cryptol Inf Security"},{"key":"ref17","first-page":"45","author":"dichtl","year":"0"},{"key":"ref18","author":"ducas","year":"0"},{"key":"ref19","first-page":"433","article-title":"Learning a zonotope and more: Cryptanalysis of NTRUSign countermeasures","author":"ducas","year":"0","journal-title":"Proc Int Conf Theory Appl Cryptol Inf Security"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HST.2013.6581570"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-012-9125-6"},{"key":"ref6","first-page":"297","article-title":"Improvement and efficient implementation of a lattice-based signature scheme","volume":"2013","author":"bansarkhani","year":"2013","journal-title":"IACR Cryptology ePrint"},{"key":"ref5","first-page":"25","article-title":"Fast multivariate signature generation in hardware: The case of rainbow","author":"balasubramanian","year":"0"},{"key":"ref8","author":"bernstein","year":"0"},{"key":"ref7","article-title":"A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic","author":"barbulescu","year":"0"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"ref9","article-title":"FPGA implementation of a recently published signature scheme","author":"beuchat","year":"0"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0234-9"},{"key":"ref45","first-page":"1","article-title":"On ideal lattices and learning with errors over rings","author":"lyubashevsky","year":"0","journal-title":"Proc 26th Annu Int Conf Theory Appl Cryptograph Techn"},{"key":"ref48","article-title":"Hardness of SIS and LWE with small parameters","author":"micciancio","year":"0"},{"key":"ref47","first-page":"700","article-title":"Trapdoors for lattices: Simpler, tighter, faster, smaller","author":"micciancio","year":"0","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref42","first-page":"144","article-title":"Generalized compact knapsacks are collision resistant","volume":"2","author":"lyubashevsky","year":"0"},{"key":"ref41","year":"0"},{"key":"ref44","first-page":"54","article-title":"SWIFFT: A modest proposal for FFT hashing","author":"lyubashevsky","year":"0","journal-title":"Proc Int'l Symp the Foundations of Software Eng"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_3"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7118804\/06873291.pdf?arnumber=6873291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:42:24Z","timestamp":1642005744000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6873291\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":64,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tc.2014.2346177","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}