{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T00:16:21Z","timestamp":1720224981303},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T00:00:00Z","timestamp":1191542400000},"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-0019-z","type":"journal-article","created":{"date-parts":[[2007,10,4]],"date-time":"2007-10-04T00:40:07Z","timestamp":1191458407000},"page":"281-291","source":"Crossref","is-referenced-by-count":8,"title":["New and Improved Architectures for Montgomery Modular Multiplication"],"prefix":"10.1007","volume":"12","author":[{"given":"M.","family":"Sudhakar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. V.","family":"Kamala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. B.","family":"Srinivas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,5]]},"reference":[{"key":"19_CR1","volume-title":"Network and internetwork security principles and practise","author":"W Stallings","year":"1995","unstructured":"Stallings W (1995) Network and internetwork security principles and practise. Prentice Hall, New York, USA"},{"key":"19_CR2","volume-title":"Handbook of applied cryptography","author":"A Menezes","year":"1997","unstructured":"Menezes A, van Oorschot P, Vanstone S (1997) Handbook of applied cryptography. CRC Press, Florida, USA"},{"issue":"2","key":"19_CR3","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. Comm ACM 21(2):120\u2013126","journal-title":"Comm ACM"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theory 22:644\u2013654","journal-title":"IEEE Trans Inf Theory"},{"key":"19_CR5","unstructured":"National Institute for Standards and Technology (2000) Digital Signature Standard (DSS). FIPS PUB 186\u20132, January"},{"key":"19_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3198-2","volume-title":"Elliptic curve public key cryptosystems","author":"AJ Menezes","year":"1993","unstructured":"Menezes AJ (1993) Elliptic curve public key cryptosystems. Kluwer Academic Publishers, Boston, MA"},{"issue":"177","key":"19_CR7","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(177):203\u2013209, January","journal-title":"Math Comput"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in cryptology\u2014CRYPTO \u201985, vol. 218 of Lecture Notes in Computer Science","author":"VS Miller","year":"1986","unstructured":"Miller VS (1986) Uses of elliptic curves in cryptography. In: Williams HC (ed) Advances in cryptology\u2014CRYPTO \u201985, vol. 218 of Lecture Notes in Computer Science. Springer, Berlin, Germany, pp 417\u2013426"},{"key":"19_CR9","first-page":"446","volume-title":"Public Key Cryptography\u2014PKC 2000, vol. 1751 of Lecture Notes in Computer Science","author":"AK Lenstra","year":"2000","unstructured":"Lenstra AK, Verheul ER (2000) Selecting cryptographic key sizes. In: Imai H, Zheng Y (eds), Public Key Cryptography\u2014PKC 2000, vol. 1751 of Lecture Notes in Computer Science. Springer , Berlin, Germany, pp 446\u2013465"},{"key":"19_CR10","unstructured":"US National Institute of Standards and Technology (NIST) (2002) Cryptographic toolkit Jun. 2002, pp 83\u201384 [online]. Available: http:\/\/csrc.nist.gov\/CryptoToolkit\/kms\/guideline-1.pdf"},{"issue":"70","key":"19_CR11","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery PL (1985) Modular multiplication without trail division. Math Comput 44(70):519\u2013521","journal-title":"Math Comput"},{"key":"19_CR12","unstructured":"Kim YS, Kang WS, Choi JR. Implementation of 1024-bit modular processor for RSA cryptosystem\u2019. http:\/\/www.ap-asic.org\/2000\/proceedings\/10-4.pdf"},{"key":"19_CR13","unstructured":"Bunimov V, Schimmler M, Tolg B (2002) A complexity-effective version of Montgomery\u2019s algorithm. Presented at the Workshop on Complexity Effective Designs (WECD02), May 2002"},{"issue":"6","key":"19_CR14","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1049\/ip-cdt:20040791","volume":"151","author":"C McIvor","year":"2004","unstructured":"McIvor C, McLoone M, McCanny JV (2004) Modified Montgomery modular multiplication and RSA exponentiation techniques. IEE Proc Comput Digit Tech 151(6):402\u2013408","journal-title":"IEE Proc Comput Digit Tech"},{"key":"19_CR15","unstructured":"Sudhakar M, Kamala RV, Srinivas MB (2007) An efficient, reconfigurable and unified Montgomery multiplier architecture. Proceedings. IEEE\/ACM VLSI Design 2007, Bangalore, India, January 6\u201310, pp 750\u2013755"},{"key":"19_CR16","unstructured":"Savas E, Tenca AF, Koc CK (2000) A scalable and unified multiplier architecture for finite fields GF(p) and GF(2 m ). Proceedings of CHES, pp 281\u2013296"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Gro\u00dfsch\u00e4dl J (2001) A bit-serial unified multiplier architecture for finite fields GF(p) and GF(2 m ). Proc. CHES 2001, August, pp 202\u2013218","DOI":"10.1007\/3-540-44709-1_18"},{"issue":"2","key":"19_CR18","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1049\/ip-cdt:20040047","volume":"151","author":"E Savas","year":"2004","unstructured":"Savas E, Tenca AF, Ciftcibasi ME, Koc CK (2004) Multiplier architectures for GF(p) and GF(2 n ). IEE Proc Comput Digit Tech 151(2):147\u2013160, March","journal-title":"IEE Proc Comput Digit Tech"},{"issue":"9","key":"19_CR19","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1109\/TC.2003.1228516","volume":"52","author":"AF Tenca","year":"2003","unstructured":"Tenca AF, Koc CK (2003) A scalable architecture for modular multiplication based on Montgomery\u2019s algorithm. IEEE Trans Comput 52(9):1215\u20131221, Sept","journal-title":"IEEE Trans Comput"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Harris D, Krishnamurthy R, Anders M, Mathew S, Hsu S (2005) An improved unified scalable radix-2 Montgomery multiplier. IEEE (ARITH-17), pp 172\u2013178","DOI":"10.1109\/ARITH.2005.9"},{"key":"19_CR21","unstructured":"Certicom Research, Recommended Elliptic Curve Domain Parameters, http:\/\/www.secg.org\/download\/aid-386\/sec2_final.pdf"},{"key":"19_CR22","unstructured":"NIST DSS Standard, Basicrypt\u2014Elliptic Curve Cryptography (ECC) Benchmark Suite benchmark, http:\/\/csrc.nist.gov\/publications\/fips\/fips186-2\/fips186-2-change1.pdf"},{"key":"19_CR23","unstructured":"Virtex\u2122-E 1.8 V Field Programmable Gate Arrays, http:\/\/www.xilinx.com\/bvdocs\/publications\/ds022.pdf"},{"key":"19_CR24","unstructured":"Virtex-II Pro and Virtex-II Pro X Platform FPGAs: Complete Data Sheet http:\/\/www.xilinx.xom\/bvdocs\/publications\/ds083.pdf"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-007-0019-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-007-0019-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-007-0019-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:16:00Z","timestamp":1559358960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-007-0019-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,5]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,10,13]]}},"alternative-id":["19"],"URL":"https:\/\/doi.org\/10.1007\/s11036-007-0019-z","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,5]]}}}