{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:10:58Z","timestamp":1778263858822,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_38","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:53:32Z","timestamp":1319709212000},"page":"799-803","source":"Crossref","is-referenced-by-count":3,"title":["Montgomery Arithmetic"],"prefix":"10.1007","author":[{"given":"\u00c7etin Kaya","family":"Ko\u00e7","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1_38","unstructured":"Duss\u00e9 SR, Kaliski BS Jr (1991) A cryptographic library for the motorola DSP56000. In: Damg\u00e5rd IB (ed) Advances in cryptology\u00a0\u2013 EUROCRYPT \u201990. Lecture notes in computer science, vol 473, Springer, Berlin, pp 230\u2013244. http:\/\/www.springerlink.com\/content\/07h8eyfk4jnafy5c\/"},{"key":"38_CR2_38","unstructured":"Knuth DE (1998) The art of computer programming, 3rd edn. Semi-numerical algorithms, vol 2. Addison-Wesley, Reading. ISBN 0-201-89684-2. http:\/\/www.informit.com\/title\/0201896842"},{"key":"38_CR3_38","unstructured":"Ko\u00e7 \u00c7K, Acar T (1998) Montgomery multiplication in GF(2k). Design Code Cryptogr 14(1):57\u201369. http:\/\/www.springerlink.com\/content\/g25q57w02h21jv71\/"},{"key":"38_CR4_38","unstructured":"Laurichesse D, Blain L (1991) Optimized implementation of RSA cryptosystem. Comput Secur 10(3):263\u2013267. http:\/\/dx.doi.org\/10.1016\/0167-4048(91)90042-C"},{"key":"38_CR5_38","unstructured":"Montgomery PL (1985) Modular multiplication without trial division, Math Comput 44(170):519\u2013521. http:\/\/www.jstor.org\/pss\/2007970"},{"key":"38_CR6_38","unstructured":"Walter CD (1993) Systolic modular multiplication. IEEE Trans Comput 42(3):376\u2013378. http:\/\/ieeexplore.ieee.org\/xpl\/freeabs_all.jsp?arnumber=210181"},{"key":"38_CR7_38","unstructured":"Walter CD (1999) Montgomery exponentiation needs no final subtractions. Electron Lett 35(21):1831\u20131832. http:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=810000"},{"key":"38_CR8_38","unstructured":"Walter CD (2002) Precise bounds for montgomery modular multiplication and some potentially insecure RSA moduli. In: Preneel B (ed) Topics in cryptology\u00a0\u2013 CT-RSA 2002. Lecture notes in computer science, vol 2271. Springer, Berlin, pp 30\u201339. http:\/\/www.springerlink.com\/content\/3p1qw48b1vu84gya\/"},{"key":"38_CR9_38","unstructured":"Walter CD, Thompson S (2001) Distinguishing exponent digits by observing modular subtractions. In: Naccache D (ed) Topics in cryptology\u00a0\u2013 CT-RSA 2001. Lecture notes in computer science, vol 2020. Springer, Berlin, pp 192\u2013207. http:\/\/www.springerlink.com\/content\/8h6fn41pfj8uluuu\/"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T17:44:13Z","timestamp":1778262253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_38","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}