{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:29:27Z","timestamp":1781886567900,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":61,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642334801","type":"print"},{"value":"9783642334818","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33481-8_8","type":"book-chapter","created":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T09:00:27Z","timestamp":1345626027000},"page":"139-158","source":"Crossref","is-referenced-by-count":118,"title":["Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware"],"prefix":"10.1007","author":[{"given":"Thomas","family":"P\u00f6ppelmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim","family":"G\u00fcneysu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/TASSP.1974.1162555","volume":"22","author":"R. Agarwal","year":"1974","unstructured":"Agarwal, R., Burrus, C.: Fast convolution using fermat number transforms with applications to digital filtering. IEEE Transactions on Acoustics, Speech and Signal Processing\u00a022(2), 87\u201397 (1974)","journal-title":"IEEE Transactions on Acoustics, Speech and Signal Processing"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99\u2013108. ACM (1996)","DOI":"10.1145\/237814.237838"},{"key":"8_CR3","unstructured":"Arbitman, Y., Dogon, G., Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFTX: A proposal for the SHA-3 standard. Submission to NIST (2008)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Atici, A.C., Batina, L., Fan, J., Verbauwhede, I., Yalcin, S.B.O.: Low-cost implementations of NTRU for pervasive security. In: International Conference on Application-Specific Systems, Architectures and Processors, ASAP 2008, pp. 79\u201384. IEEE (2008)","DOI":"10.1109\/ASAP.2008.4580158"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44709-1_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"D.V. Bailey","year":"2001","unstructured":"Bailey, D.V., Coffin, D., Elbirt, A., Silverman, J.H., Woodbury, A.D.: NTRU in Constrained Devices. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 262\u2013272. Springer, Heidelberg (2001)"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11036-007-0022-4","volume":"12","author":"S. Baktir","year":"2007","unstructured":"Baktir, S., Kumar, S., Paar, C., Sunar, B.: A state-of-the-art elliptic curve cryptographic processor operating in the frequency domain. Mob. Netw. Appl.\u00a012(4), 259\u2013270 (2007)","journal-title":"Mob. Netw. Appl."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/1185448.1185568","volume-title":"Proceedings of the 44th Annual Southeast Regional Conference, ACM-SE 44","author":"S. Baktir","year":"2006","unstructured":"Baktir, S., Sunar, B.: Achieving efficient polynomial multiplication in fermat fields using the fast fourier transform. In: Proceedings of the 44th Annual Southeast Regional Conference, ACM-SE 44, pp. 549\u2013554. ACM, New York (2006)"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1109\/TAU.1969.1162041","volume":"17","author":"G. Bergland","year":"1969","unstructured":"Bergland, G.: Fast fourier transform hardware implementations\u2013an overview. IEEE Transactions on Audio and Electroacoustics\u00a017(2), 104\u2013108 (1969)","journal-title":"IEEE Transactions on Audio and Electroacoustics"},{"key":"8_CR9","first-page":"325","volume":"44","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein, D.J.: Fast multiplication and its applications. Algorithmic Number Theory\u00a044, 325\u2013384 (2008)","journal-title":"Algorithmic Number Theory"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Blahut, R.E.: Fast Algorithms for Signal Processing. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511760921"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. In: Electronic Colloquium on Computational Complexity (ECCC), vol.\u00a018, p. 111 (2011)","DOI":"10.1145\/2090236.2090262"},{"issue":"9","key":"8_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1151030.1151055","volume":"49","author":"J. Buchmann","year":"2006","unstructured":"Buchmann, J., May, A., Vollmer, U.: Perspectives for cryptographic long-term security. Communications of the ACM\u00a049(9), 50\u201355 (2006)","journal-title":"Communications of the ACM"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-10628-6_1","volume-title":"Progress in Cryptology - INDOCRYPT 2009","author":"J. Buchmann","year":"2009","unstructured":"Buchmann, J., Lindner, R.: Secure Parameters for SWIFFT. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol.\u00a05922, pp. 1\u201317. Springer, Heidelberg (2009)"},{"key":"8_CR14","unstructured":"Cheng, L.S., Miri, A., Yeap, T.H.: Efficient FPGA implementation of FFT based multipliers. In: Canadian Conference on Electrical and Computer Engineering, pp. 1300\u20131303. IEEE (2005)"},{"issue":"90","key":"8_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J.W. Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex fourier series. Math. Comput\u00a019(90), 297\u2013301 (1965)","journal-title":"Math. Comput"},{"key":"8_CR16","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (July 2009)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Corona, C.C., Moreno, E.F., Henriquez, F.R., et al.: Hardware design of a 256-bit prime field multiplier suitable for computing bilinear pairings. In: 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig), pp. 229\u2013234. IEEE (2011)","DOI":"10.1109\/ReConFig.2011.46"},{"issue":"1","key":"8_CR18","first-page":"93","volume":"37","author":"J.P. Deschamps","year":"2007","unstructured":"Deschamps, J.P., Sutter, G.: Comparison of FPGA implementation of the mod M reduction. Latin American Applied Research\u00a037(1), 93\u201397 (2007)","journal-title":"Latin American Applied Research"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Dreschmann, M., Meyer, J., Huebner, M., Schmogrow, R., Hillerkuss, D., Becker, J., Leuthold, J., Freude, W.: Implementation of an Ultra-High Speed 256-Point FFT for Xilinx Virtex-6 Devices. In: 2011 9th IEEE International Conference on Industrial Informatics (INDIN), pp. 829\u2013834 (July 2011)","DOI":"10.1109\/INDIN.2011.6035000"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-03644-6_11","volume-title":"Advanced Parallel Processing Technologies","author":"P. Emeliyanenko","year":"2009","unstructured":"Emeliyanenko, P.: Efficient Multiplication of Polynomials on Graphics Hardware. In: Dou, Y., Gruber, R., Joller, J.M. (eds.) APPT 2009. LNCS, vol.\u00a05737, pp. 134\u2013149. Springer, Heidelberg (2009)"},{"key":"8_CR21","unstructured":"Frederiksen, T.K.: A practical implementation of Regev\u2019s LWE-based cryptosystem (2010), http:\/\/daimi.au.dk\/~jot2re\/lwe\/resources\/A%20Practical%20Implementation%20of%20Regevs%20LWE-based%20Cryptosystem.pdf"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Proceedings of the Theory and Applications of Cryptographic Techniques 27th Annual International Conference on Advances in Cryptology, pp. 31\u201351. Springer (2008)","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Gautam, V., Ray, K.C., Haddow, P.: Hardware efficient design of variable length FFT processor. In: 2011 IEEE 14th International Symposium on Design and Diagnostics of Electronic Circuits Systems (DDECS), pp. 309\u2013312 (April 2011)","DOI":"10.1109\/DDECS.2011.5783102"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. IACR Cryptology ePrint Archive, 2012:99 (2012)","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"G\u00f6ttert, N., Feller, T., Schneider, M., Huss, S.A., Buchmann, J.: On the design of hardware building blocks for modern lattice-based encryption schemes. In: Cryptographic Hardware and Embedded Systems\u2013CHES 2012 (2012)","DOI":"10.1007\/978-3-642-33027-8_30"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"G\u00fcneysu, T., Lyubashevsky, V., P\u00f6ppelmann, T.: Practical lattice-based cryptography: A signature scheme for embedded systems. In: Cryptographic Hardware and Embedded Systems\u2013CHES 2012 (2012)","DOI":"10.1007\/978-3-642-33027-8_31"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-85053-3_5","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"T. G\u00fcneysu","year":"2008","unstructured":"G\u00fcneysu, T., Paar, C.: Ultra High Performance ECC over NIST Primes on Commercial FPGAs. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol.\u00a05154, pp. 62\u201378. Springer, Heidelberg (2008)"},{"key":"8_CR29","unstructured":"Gy\u00f6rfi, T., Cret, O., Hanrot, G., Brisebarre, N.: High-throughput hardware architecture for the SWIFFT \/ SWIFFTX hash functions. In: IACR Cryptology ePrint Archive, 2012:343 (2012)"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.: NTRU: A ring-based public key cryptosystem. Algorithmic Number Theory, 267\u2013288 (1998)","DOI":"10.1007\/BFb0054868"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Kamal, A.A., Youssef, A.M.: An FPGA implementation of the NTRUEncrypt cryptosystem. In: 2009 International Conference on Microelectronics (ICM), pp. 209\u2013212. IEEE (2009)","DOI":"10.1109\/ICM.2009.5418649"},{"key":"8_CR32","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Physics Doklady\u00a07, 595 (1963)","journal-title":"Soviet Physics Doklady"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R. Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better Key Sizes (and Attacks) for LWE-Based Encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol.\u00a06558, pp. 319\u2013339. Springer, Heidelberg (2011)"},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-78440-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"V. Lyubashevsky","year":"2008","unstructured":"Lyubashevsky, V.: Lattice-Based Identification Schemes Secure Under Active Attacks. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 162\u2013179. Springer, Heidelberg (2008)"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","volume-title":"Automata, Languages and Programming","author":"V. Lyubashevsky","year":"2006","unstructured":"Lyubashevsky, V., Micciancio, D.: Generalized Compact Knapsacks Are Collision Resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol.\u00a04052, pp. 144\u2013155. Springer, Heidelberg (2006)"},{"key":"8_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V. Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On Ideal Lattices and Learning with Errors over Rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (2010)"},{"key":"8_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-10366-7_35","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"V. Lyubashevsky","year":"2009","unstructured":"Lyubashevsky, V.: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 598\u2013616. Springer, Heidelberg (2009)"},{"key":"8_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"V. Lyubashevsky","year":"2012","unstructured":"Lyubashevsky, V.: Lattice Signatures without Trapdoors. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 738\u2013755. Springer, Heidelberg (2012)"},{"key":"8_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-71039-4_4","volume-title":"Fast Software Encryption","author":"V. Lyubashevsky","year":"2008","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFT: A Modest Proposal for FFT Hashing. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol.\u00a05086, pp. 54\u201372. Springer, Heidelberg (2008)"},{"key":"8_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V. Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On Ideal Lattices and Learning with Errors over Rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (2010)"},{"issue":"4","key":"8_CR41","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D. Micciancio","year":"2007","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Computational Complexity\u00a016(4), 365\u2013411 (2007)","journal-title":"Computational Complexity"},{"key":"8_CR42","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Post-Quantum Cryptography, pp. 147\u2013191 (2009)","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"8_CR43","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/2046660.2046682","volume-title":"Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, CCSW 2011","author":"M. Naehrig","year":"2011","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, CCSW 2011, pp. 113\u2013124. ACM, New York (2011)"},{"issue":"2","key":"8_CR44","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1145\/321450.321457","volume":"15","author":"M.C. Pease","year":"1968","unstructured":"Pease, M.C.: An adaptation of the fast fourier transform for parallel processing. J. ACM\u00a015(2), 252\u2013264 (1968)","journal-title":"J. ACM"},{"issue":"241","key":"8_CR45","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1090\/S0025-5718-02-01419-9","volume":"72","author":"C. Percival","year":"2003","unstructured":"Percival, C.: Rapid multiplication modulo the sum and difference of highly composite numbers. Mathematics of Computation\u00a072(241), 387\u2013396 (2003)","journal-title":"Mathematics of Computation"},{"issue":"114","key":"8_CR46","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1090\/S0025-5718-1971-0301966-0","volume":"25","author":"J.M. Pollard","year":"1971","unstructured":"Pollard, J.M.: The fast fourier transform in a finite field. Mathematics of Computation\u00a025(114), 365\u2013374 (1971)","journal-title":"Mathematics of Computation"},{"issue":"12","key":"8_CR47","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1109\/T-C.1972.223497","volume":"100","author":"C.M. Rader","year":"1972","unstructured":"Rader, C.M.: Discrete convolutions via mersenne transforms. IEEE Transactions on Computers\u00a0100(12), 1269\u20131273 (1972)","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR48","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, USA, May 22-24, p. 84. ACM Press (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"8_CR49","doi-asserted-by":"crossref","unstructured":"Regev, O.: The learning with errors problem. Invited Survey in CCC (2010)","DOI":"10.1109\/CCC.2010.26"},{"key":"8_CR50","unstructured":"R\u00fcckert, M., Schneider, M.: Estimating the security of lattice-based cryptosystems. Cryptology ePrint Archive, Report 2010\/137 (2010), http:\/\/eprint.iacr.org\/"},{"issue":"3","key":"8_CR51","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation Grosser Zahlen. Computing\u00a07(3), 281\u2013292 (1971)","journal-title":"Computing"},{"key":"8_CR52","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"1994 Proceedings of 35th Annual Symposium on Foundations of Computer Science","author":"P.W. Shor","year":"1994","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 1994 Proceedings of 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"8_CR53","unstructured":"Shoup, V.: NTL: A library for doing number theory (2001)"},{"key":"8_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D. Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as Secure as Worst-Case Problems Over Ideal Lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 27\u201347. Springer, Heidelberg (2011)"},{"key":"8_CR55","doi-asserted-by":"crossref","unstructured":"Suleiman, A., Saleh, H., Hussein, A., Akopian, D.: A family of scalable FFT architectures and an implementation of 1024-point radix-2 FFT for real-time communications. In: IEEE International Conference on Computer Design, ICCD 2008, pp. 321\u2013327 (October 2008)","DOI":"10.1109\/ICCD.2008.4751880"},{"key":"8_CR56","doi-asserted-by":"crossref","unstructured":"von zur Gathen, J., Shokrollahi, J.: Efficient FPGA-based Karatsuba multipliers for polynomials over $\\mathbb{F}_2$ . In: Selected Areas in Cryptography, pp. 359\u2013369. Springer (2006)","DOI":"10.1007\/11693383_25"},{"key":"8_CR57","unstructured":"Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba algorithm for polynomial multiplication (2003)"},{"key":"8_CR58","doi-asserted-by":"crossref","unstructured":"Wey, C.-L., Lin, S.-Y., Tang, W.-C.: Efficient memory-based FFT processors for OFDM applications. In: 2007 IEEE International Conference on Electro\/Information Technology, pp. 345\u2013350 (May 2007)","DOI":"10.1109\/ICECS.2007.4511108"},{"key":"8_CR59","doi-asserted-by":"crossref","unstructured":"Winkler, F.: Polynomial Algorithms in Computer Algebra (Texts and Monographs in Symbolic Computation), 1st edn. Springer (August 1996)","DOI":"10.1007\/978-3-7091-6571-3_1"},{"key":"8_CR60","unstructured":"Xilinx. Smartxplorer for ISE project navigator users, Version 12.1 (2010), http:\/\/www.xilinx.com\/support\/documentation\/sw_manuals\/xilinx13_1\/ug689.pdf"},{"key":"8_CR61","doi-asserted-by":"crossref","unstructured":"Yao, Y., Huang, J., Khanna, S., Shelat, A., Calhoun, B.H., Lach, J., Evans, D.: A sub-0.5V lattice-based public-key encryption scheme for RFID platforms in 130nm CMOS. In: Workshop on RFID Security (RFIDsec 2011 Asia), Cryptology and Information Security, pp. 96\u2013113. IOS Press (April 2011)","DOI":"10.3233\/978-1-60750-722-2-96"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33481-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T02:26:20Z","timestamp":1743992780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33481-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334801","9783642334818"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33481-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}