{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T05:32:38Z","timestamp":1738819958447,"version":"3.37.0"},"publisher-location":"Boston, MA","reference-count":25,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387718163"},{"type":"electronic","value":"9780387718170"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-71817-0_7","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T16:55:17Z","timestamp":1228928117000},"page":"125-169","source":"Crossref","is-referenced-by-count":1,"title":["Spectral Modular Arithmetic for Cryptography"],"prefix":"10.1007","author":[{"given":"G\u00f7kay","family":"Saldamli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c7etin Kaya","family":"Ko\u00e7","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"A. Sch\u00f6nhage and V. Strassen. Schnelle multiplikation grosser zahlen. Computing, 7: 281\u2013292, 1971.","journal-title":"Computing"},{"issue":"15","key":"7_CR2","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1049\/el:19760289","volume":"12","author":"J. M. Pollard","year":"1976","unstructured":"J. M. Pollard. Implementation of number theoretic transform. Electronics Letters, 12(15): 378\u2013379, July 1976.","journal-title":"Electronics Letters"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"R. E. Blahut. Fast Algorithms for Digital Signal Processing, Addison-Wesley publishing Company, 1985.","DOI":"10.1007\/978-94-009-5113-6_8"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"H. J. Nussbaumer. Fast Fourier Transform and Convolution Algorithms, Springer, Berlin, Germany, 1982.","DOI":"10.1007\/978-3-642-81897-4"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2): 120\u2013126, February 1978.","journal-title":"Communications of the ACM"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1049\/ip-cdt:20020235","volume":"149","author":"T. Yanik","year":"2002","unstructured":"T. Yanik, E. Sava\u015f, and \u00c7. K. Ko\u00e7. Incomplete reduction in modular arithmetic. IEE Proceedings \u2013 Computers and Digital Techniques, 149(2): 46\u201352, March 2002.","journal-title":"IEE Proceedings \u2013 ComputersDigital Techniques"},{"issue":"170","key":"7_CR7","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P. L. Montgomery","year":"1985","unstructured":"P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170): 519\u2013521, April 1985.","journal-title":"Mathematics of Computation"},{"key":"7_CR8","unstructured":"\u00c7. K. Ko\u00e7. High-Speed RSA Implementation. Tech. Rep. TR 201, RSA Laboratories, 73 pp. November 1994."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"N. Koblitz. A Course in Number Theory and Cryptography, Springer, Berlin, Germany, Second edition, 1994.","DOI":"10.1007\/978-1-4419-8592-7"},{"key":"7_CR10","unstructured":"G. Saldamli. Spectral Modular Arithmetic, Ph.D. thesis, Department of Electrical and Computer Engineering, Oregon State University, May 2005."},{"key":"7_CR11","unstructured":"G. Saldamli and \u00c7. K. Ko\u00e7. Spectral modular arithmetic for binary extension fields. preprint, 2006."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"S. A. Vanstone, R. C. Mullin, I. M. Onyszchuk and R. M. Wilson. Optimal normal bases in GF $(p^k)$ . Discrete Applied Mathematics, 22: 149\u2013161, 1989.","DOI":"10.1016\/0166-218X(88)90090-X"},{"key":"7_CR13","unstructured":"ANSI X9.62-2001. Public-key cryptography for the financial services industry: Key Agreement and Key Transport Using Elliptic Curve Cryptography. 2001, Draft Version."},{"key":"7_CR14","unstructured":"IEEE. P1363: Standard specifications for public-key cryptography. November 12, 1999, Draft Version 13."},{"key":"7_CR15","unstructured":"R. Lidl and H. Niederreiter. Finite Fields, Encyclopedia of Mathematics and its Applications, Volume 20. Addison-Wesley publishing Company, 1983."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"G. Saldamli and \u00c7. K. Ko\u00e7. Spectral modular arithmetic. In Proceedings of the 18th IEEE Symposium on Computer Arithmetic 2007 (ARITH\u201907), 2007, pp. 123\u2013132.","DOI":"10.1109\/ARITH.2007.34"},{"key":"7_CR17","unstructured":"J.-L. Beuchat. A family of modulo $(2^n+1)$ multipliers, Tech. Rep. 5316, Institut National de Recherche en Informatique et en Automatique (INRA), September 2004."},{"issue":"3","key":"7_CR18","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF00929618","volume":"14","author":"Z. Wang","year":"1996","unstructured":"Z. Wang, G. A. Jullien, and W. C. Miller. An efficient tree architecture for modulo $2^n+1$ multiplication. J. VLSI Signal Processing Systems, 14(3): 241\u2013248, December 1996.","journal-title":"J. VLSI Signal Processing Systems"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"R. Zimmermann. \u201cEfficient VLSI implementation of modulo $(2^n \\pm 1)$ addition and multiplication,\u201d in Proceedings of the 14th IEEE Symposium on Computer Architecture, 1999, pp. 158\u2013167.","DOI":"10.1109\/ARITH.1999.762841"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1109\/TASSP.1976.1162834","volume":"24","author":"L. M. Leibowitz","year":"1976","unstructured":"L. M. Leibowitz. A simplified binary arithmetic for the Fermat number transform. IEEE Transactions on Acoustics, Speech, and Signal Processing, 24: 356\u2013359, 1976.","journal-title":"IEEE Transactions on Acoustics, Speech, and Signal Processing"},{"key":"7_CR21","unstructured":"G. Saldaml\u0131 and \u00c7. K. Ko\u00e7. Spectral modular arithmetic for polynomial rings. preprint, 2006."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"S. Baktir and B. Sunar. Finite field polynomial multiplication in the frequency domain with application to Elliptic Curve Cryptography. In Proceedings of Computer and Information Sciences ISCIS 2006), pp. 991\u20131001, 2006.","DOI":"10.1007\/11902140_103"},{"issue":"4","key":"7_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11036-007-0022-4","volume":"12","author":"S. Baktir","year":"2007","unstructured":"S. Baktir, S. Kumar, C. Paar, and B. Sunar. A state-of-the-art elliptic curve cryptographic processor operating in the frequency domain. Mobile Networks and Applications (MONET), 12(4): 259\u2013270, September 2007.","journal-title":"Mobile Networks and Applications (MONET)"},{"issue":"21","key":"7_CR24","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"J.-J. Quisquater","year":"1982","unstructured":"J.-J. Quisquater and C. Couvreur. Fast decipherment algorithm for RSA public-key cryptosystem. Electronics Letters, 18(21): 905\u2013907, Oct. 1982.","journal-title":"Electronics Letters"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1090\/S0025-5718-1971-0301966-0","volume":"25","author":"J. M. Pollard","year":"1971","unstructured":"J. M. Pollard. The fast Fourier transform in a finite field. Mathematics of Computation, 25: 365\u2013374, 1971.","journal-title":"Mathematics of Computation"}],"container-title":["Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-71817-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T03:43:58Z","timestamp":1738813438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-71817-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387718163","9780387718170"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-71817-0_7","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}