{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:43:27Z","timestamp":1725497007410},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772712"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77272-9_21","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:56:55Z","timestamp":1196942215000},"page":"346-363","source":"Crossref","is-referenced-by-count":0,"title":["Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic"],"prefix":"10.1007","author":[{"given":"Kamel","family":"Bentahar","sequence":"first","affiliation":[]},{"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00145-004-0218-8","volume":"18","author":"H. Cohen","year":"2005","unstructured":"Cohen, H.: Analysis of the Sliding Window Powering Algorithm. Journal of Cryptology\u00a018(1), 63\u201376 (2005)","journal-title":"Journal of Cryptology"},{"key":"21_CR2","unstructured":"Coronado, L.C.: Garc\u00eda. Can Sch\u00f6nhage multiplication speed up the RSA decryption or encryption? MoraviaCrypt (2007), \n                      \n                        http:\/\/www.cdc.informatik.tu-darmstadt.de\/mitarbeiter\/coronado.html\n                      \n                      \n                     (preprint available)"},{"key":"21_CR3","volume-title":"Practical Cryptography","author":"N. Ferguson","year":"2003","unstructured":"Ferguson, N., Schneier, B.: Practical Cryptography, New York, NY, USA. John Wiley & Sons, Chichester (2003)"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D.M. Gordon","year":"1998","unstructured":"Gordon, D.M.: A Survey of Fast Exponentiation Methods. Journal of Algorithms\u00a027(1), 129\u2013146 (1998)","journal-title":"Journal of Algorithms"},{"key":"21_CR5","unstructured":"Granlund, T.: GNU multiple precision arithmetic library 4.1.2., \n                      \n                        http:\/\/swox.com\/gmp"},{"key":"21_CR6","unstructured":"Granlund, T.: Instruction latencies and through put for AMD and Intel x86 processors (September 2, 2007), \n                      \n                        http:\/\/swox.com\/doc\/x86-timing.pdf"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11545262_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"J. Gro\u00dfsch\u00e4dl","year":"2005","unstructured":"Gro\u00dfsch\u00e4dl, J., Avanzi, R.M., Sava\u015f, E., Tillich, S.: Energy-efficient software implementation of long integer modular arithmetic. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 75\u201390. Springer, Heidelberg (2005)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11545262_16","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"L. Hars","year":"2005","unstructured":"Hars, L.: Fast truncated multiplication for cryptographic applications. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 211\u2013225. Springer, Heidelberg (2005)"},{"key":"21_CR9","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: Seminumerical Algorithms. In: The Art of Computer Programming, 3rd edn., Addison-Wesley Longman, Reading (1998)","edition":"3"},{"key":"21_CR10","unstructured":"Lei, C.-L., Liu, C.-B., Huang, C.-H.: Design and implementation of long-digit karatsuba\u2019s multiplication algorithm using tensor product formulation. In: The Ninth Workshop on Compiler Techniques for High-Performance Computing, pp. 23\u201330 (2003)"},{"key":"21_CR11","volume-title":"Handbook Of Applied Cryptography","author":"A.J. Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook Of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"key":"21_CR12","unstructured":"Mulders, T.: On computing short products. Technical Report 276, Dept of CS, ETH Zurich (November 1997), \n                      \n                        ftp:\/\/ftp.inf.ethz.ch\/pub\/publications\/tech-reports\/2xx\/276.pdf"},{"key":"21_CR13","unstructured":"National Institute of Standards and Technology (NIST). Recommendation for key management - part 1: General. Technical Report NIST Special Publication 800-57, National Institute of Standards and Technology (2006), \n                      \n                        http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-57\/SP800-57-Part1.pdf"},{"key":"21_CR14","first-page":"595","volume":"7","author":"Y. Ofman","year":"1963","unstructured":"Ofman, Y., Karatsuba, A.: Multiplication of multidigit numbers on automata. Soviet Physics - Doklady\u00a07, 595\u2013596 (1963)","journal-title":"Soviet Physics - Doklady"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Phatak, D.S., Goff, T.: Fast modular reduction for large wordlengths via one linear and one cyclic convolution. In: Computer Arithmetic, 2005. ARITH-17 2005. 17th IEEE Symposium, pp. 179\u2013186 (2005)","DOI":"10.1109\/ARITH.2005.21"},{"key":"21_CR16","unstructured":"Phatak, D.S., Goff, T.: Low complexity algorithms for fast modular reduction: New results and a unified framework. Technical report, Computer Science and Electrical Engineering Department. University of Maryland, Baltimore County, Baltimore, MD 21250 (2006)"},{"key":"21_CR17","unstructured":"Scott, M.P.: Comparison of methods for modular exponentiation on 32-bit intel 80x86 processors, \n                      \n                        ftp:\/\/ftp.computing.dcu.ie\/pub\/crypto\/timings.ps"},{"issue":"8","key":"21_CR18","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1109\/12.295852","volume":"43","author":"D. Zuras","year":"1994","unstructured":"Zuras, D.: More on squaring and multiplying large integers. IEEE Transactions on Computers\u00a043(8), 899\u2013908 (1994)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77272-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:06:57Z","timestamp":1619521617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77272-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772712"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77272-9_21","relation":{},"subject":[]}}