{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T09:11:44Z","timestamp":1719306704567},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,9,30]],"date-time":"2007-09-30T00:00:00Z","timestamp":1191110400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2007,10,13]]},"DOI":"10.1007\/s11036-007-0022-4","type":"journal-article","created":{"date-parts":[[2007,9,28]],"date-time":"2007-09-28T18:01:37Z","timestamp":1191002497000},"page":"259-270","source":"Crossref","is-referenced-by-count":14,"title":["A State-of-the-art Elliptic Curve Cryptographic Processor Operating in the Frequency Domain"],"prefix":"10.1007","volume":"12","author":[{"given":"Sel\u00e7uk","family":"Bakt\u0131r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"Paar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Berk","family":"Sunar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,30]]},"reference":[{"key":"22_CR1","first-page":"472","volume-title":"Advances in cryptology\u2014CRYPTO \u201998, vol LNCS 1462","author":"DV Bailey","year":"1998","unstructured":"Bailey DV, Paar C (1998) Optimal extension fields for fast arithmetic in public-key algorithms. In: Krawczyk H (ed) Advances in cryptology\u2014CRYPTO \u201998, vol LNCS 1462. Springer, Berlin Heidelberg New York, pp 472\u2013485"},{"issue":"3","key":"22_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"DV Bailey","year":"2001","unstructured":"Bailey DV, Paar C (2001) Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. J Cryptol 14(3):153\u2013176","journal-title":"J Cryptol"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Bakt\u0131r S, Sunar B (2005) Finite field polynomial multiplication in the frequency domain with application to elliptic curve cryptography. Technical report. Worcester Polytechnic Institute, Worcester","DOI":"10.1007\/11902140_103"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Bakt\u0131r S, Sunar B (2006) Finite field polynomial multiplication in the frequency domain with application to elliptic curve cryptography. In: Proceedings of the 21st international symposium on computer and information sciences (ISCIS 2006). Lecture notes in computer science (LNCS), vol 4263. Springer, Berlin Heidelberg New York, pp 991\u20131001","DOI":"10.1007\/11902140_103"},{"issue":"6","key":"22_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-9260(02)00053-6","volume":"34","author":"L Batina","year":"2003","unstructured":"Batina L, \u00d6rs SB, Preneel B, Vandewalle J (2003) Hardware architectures for public key cryptography. Integr VLSI J 34(6):1\u201364","journal-title":"Integr VLSI J"},{"key":"22_CR6","series-title":"Mathematical Society Lecture Notes Series 265","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107360211","volume-title":"Elliptic curves in cryptography","author":"IF Blake","year":"1999","unstructured":"Blake IF, Seroussi G, Smart N (1999) Elliptic curves in cryptography. Mathematical Society Lecture Notes Series 265. Cambridge University Press, London"},{"key":"22_CR7","volume-title":"DFT\/FFT and convolution algorithms","author":"CS Burrus","year":"1985","unstructured":"Burrus CS, Parks TW (1985) DFT\/FFT and convolution algorithms. Wiley, New York"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Kalach K, David JP (2005) Hardware implementation of large number multiplication by FFT with modular arithmetic. In: Proceedings of the 3rd international IEEE-NEWCAS conference. IEEE, Piscataway, pp 267\u2013270","DOI":"10.1109\/NEWCAS.2005.1496674"},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz N (1987) Elliptic curve cryptosystems. Math Comput 48:203\u2013209","journal-title":"Math Comput"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Kumar S, Girimondo M, Weimerskirch A, Paar C, Patel A, Wander AS (2003) Embedded end-to-end wireless security with ECDH key exchange. In: 46th IEEE midwest symposium on circuits and systems, Cairo, pp 27\u201330 December 2003","DOI":"10.1109\/MWSCAS.2003.1562404"},{"key":"22_CR11","unstructured":"Lee M-K, Kim KT, Kim H, Kim DK (2006) Efficient hardware implementation of elliptic curve cryptography over GF(p m ). In: Proceedings of the 6th international workshop on information security applications (WISA 2005). Lecture notes in computer science (LNCS), vol 3786. Springer, Berlin Heidelberg New York, pp 207\u2013217"},{"key":"22_CR12","volume-title":"Handbook of applied cryptography","author":"AJ Menezes","year":"1997","unstructured":"Menezes AJ, van Oorschot PC, Vanstone SA (1997) Handbook of applied cryptography. CRC, Boca Raton"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in cryptology, CRYPTO \u201985, vol LNCS 218","author":"V Miller","year":"1986","unstructured":"Miller V (1986) Uses of elliptic curves in cryptography. In: Williams HC (ed) Advances in cryptology, CRYPTO \u201985, vol LNCS 218. Springer, Berlin Heidelberg New York, pp 417\u2013426"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"\u00d6zt\u00fcrk E, Sunar B, Savas E (2004) Low-power elliptic curve cryptography using scaled modular arithmetic. In: Proceedings of the workshop on cryptographic hardware and embedded systems (CHES 2004). Lecture notes in computer science (LNCS), vol 3156. Springer, Berlin Heidelberg New York, pp 92\u2013106","DOI":"10.1007\/978-3-540-28632-5_7"},{"key":"22_CR15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1090\/S0025-5718-1971-0301966-0","volume":"25","author":"JM Pollard","year":"1971","unstructured":"Pollard JM (1971) The fast fourier transform in a finite field. Math Comput 25:365\u2013374","journal-title":"Math Comput"},{"issue":"12","key":"22_CR16","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1109\/T-C.1972.223497","volume":"21","author":"CM Rader","year":"1972","unstructured":"Rader CM (1972) Discrete convolutions via mersenne transforms. IEEE Trans Comput C-21(12):1269\u20131273","journal-title":"IEEE Trans Comput C-21"},{"issue":"2","key":"22_CR17","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"issue":"4","key":"22_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.2003.1190586","volume":"52","author":"A Satoh","year":"2003","unstructured":"Satoh A, Takano K (2003) A scalable dual-field elliptic curve cryptographic processor. IEEE Trans Comput 52(4):1\u201364","journal-title":"IEEE Trans Comput"},{"key":"22_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3854-4","volume-title":"Algorithms for discrete fourier transform and convolution","author":"R Tolimieri","year":"1989","unstructured":"Tolimieri R, An M, Lu C (1989) Algorithms for discrete fourier transform and convolution. Springer, Berlin Heidelberg New York"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Woodbury A, Bailey DV, Paar C (2000) Elliptic curve cryptography on smart cards without coprocessors. In: IFIP CARDIS 2000, fourth smart card research and advanced application conference. Kluwer, Bristol, pp 20\u201322","DOI":"10.21236\/ADA385851"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-007-0022-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-007-0022-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-007-0022-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:16:00Z","timestamp":1559344560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-007-0022-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,30]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,10,13]]}},"alternative-id":["22"],"URL":"https:\/\/doi.org\/10.1007\/s11036-007-0022-4","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,30]]}}}