{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T17:36:35Z","timestamp":1790703395956,"version":"4.1.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/hst.2013.6581570","type":"proceedings-article","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T21:14:00Z","timestamp":1377724440000},"page":"81-86","source":"Crossref","is-referenced-by-count":75,"title":["Low-cost and area-efficient FPGA implementations of lattice-based cryptography"],"prefix":"10.1109","author":[{"given":"Aydin","family":"Aysu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cameron","family":"Patterson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Schaumont","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"3","author":"gentry","year":"2009","journal-title":"A Fully Homomorphic Encryption Scheme"},{"key":"2","first-page":"319","article-title":"Better key sizes (and attacks) for lwe-based encryption","author":"lindner","year":"2011","journal-title":"Topics in Cryptology-CT-RSA"},{"key":"10","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":"1","first-page":"598","article-title":"Fiat-shamir with aborts: Applications to lattice and factoring-based signatures","author":"lyubashevsky","year":"2009","journal-title":"ASIACRYPT"},{"key":"7","article-title":"High-throughput hardware architecture for the SWIFFT\/SWIFFTX hash functions","volume":"343","author":"gyorfi","year":"2012","journal-title":"Cryptology ePrint Archive"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.2307\/2004932"},{"key":"5","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/11787006_13","article-title":"Generalized compact knapsacks are collision resistant","author":"lyubashevsky","year":"2006","journal-title":"Automata Languages and Programming"},{"key":"4","article-title":"Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems","volume":"533","author":"laarhoven","year":"2012","journal-title":"Cryptology ePrint Archive"},{"key":"9","first-page":"139","article-title":"Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware","author":"poppelmann","year":"2012","journal-title":"LATINCRYPT"},{"key":"8","first-page":"512","article-title":"On the design of hardware building blocks for modern lattice-based encryption schemes","author":"gottert","year":"2012","journal-title":"CHES"},{"key":"11","author":"arndt","year":"2008","journal-title":"Algorithms for Programmers-ideas and Source Code"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"}],"event":{"name":"2013 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST)","location":"Austin, TX, USA","start":{"date-parts":[[2013,6,2]]},"end":{"date-parts":[[2013,6,3]]}},"container-title":["2013 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6573517\/6581554\/06581570.pdf?arnumber=6581570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T13:25:46Z","timestamp":1563801946000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6581570\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/hst.2013.6581570","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}