{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:10:14Z","timestamp":1778263814279,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":6,"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_27","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:50:46Z","timestamp":1319709046000},"page":"427-430","source":"Crossref","is-referenced-by-count":1,"title":["Euclidean Algorithm"],"prefix":"10.1007","author":[{"given":"Berk","family":"Sunar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1_27","volume-title":"Thirteen books of Euclid\u2019s elements","author":"Euclid","year":"1956","unstructured":"Euclid (1956) Thirteen books of Euclid\u2019s elements, 2nd edn. Dover, New York","edition":"2"},{"key":"27_CR2_27","volume-title":"The art of computer programming, vol 2: seminumerical algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth DE (1997) The art of computer programming, vol 2: seminumerical algorithms, 3rd edn. Addison-Wesley, Reading","edition":"3"},{"key":"27_CR3_27","volume-title":"Prime numbers: a computational perspective","author":"R Crandall","year":"2001","unstructured":"Crandall R, Pomerance C (2001) Prime numbers: a computational perspective. Springer, New York"},{"key":"27_CR4_27","doi-asserted-by":"publisher","first-page":"227","DOI":"10.2307\/2302607","volume":"45","author":"DH Lehmer","year":"1938","unstructured":"Lehmer DH (1938) Euclid\u2019s algorithm for large numbers. Am Math Mon 45:227\u2013233","journal-title":"Am Math Mon"},{"key":"27_CR5_27","volume-title":"A course in computational algebraic number theory","author":"H Cohen","year":"1993","unstructured":"Cohen H (1993) A course in computational algebraic number theory. Springer, Berlin"},{"key":"27_CR6_27","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1145\/220346.220378","volume-title":"Proceedings of the 1995 international symposium on Symbolic and algebraic computation","author":"J Sorenson","year":"1995","unstructured":"Sorenson J (1995) An analysis of Lehmer\u2019s euclidean GCD algorithm. In: Proceedings of the 1995 international symposium on Symbolic and algebraic computation. ACM Press, New York, pp 254\u2013258"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T17:25:18Z","timestamp":1778261118000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_27","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}