{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:24:23Z","timestamp":1725488663367},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47555-9_15","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T23:23:49Z","timestamp":1186615429000},"page":"174-182","source":"Crossref","is-referenced-by-count":7,"title":["Resource Requirements for the Application of Addition Chains in Modulo Exponentiation"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Sauerbrey","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Dietel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"15_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1109\/12.83626","volume":"40","author":"G. Alia","year":"1991","unstructured":"Alia, Giuseppe; Martinelli, Enrico: \u201cA VLSI Modulo m Multiplier\u201d, IEEE Transactions on Computers, Vol. 40, No. 7, p. 873\u2013878, July 1991","journal-title":"IEEE Transactions on Computers"},{"key":"15_CR2","series-title":"Lect Notes Comput Sci","first-page":"400","volume-title":"\u201cAdvances in Cryptology \u2014 Crypto\u2019 89\u201d, Proceedings","author":"J. Bos","year":"1989","unstructured":"Bos, Jurjen; Coster, Matthijs: \u201cAddition Chain Heuristics\u201d, in Brassard, G. (Ed.): \u201cAdvances in Cryptology \u2014 Crypto\u2019 89\u201d, Proceedings (Lecture Notes in Computer Science 435), p. 400\u2013407, Springer, 1989"},{"issue":"7","key":"15_CR3","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1109\/4.92018","volume":"26","author":"A.V. Curiger","year":"1991","unstructured":"Curiger, A.V.; Bonnenberg, H.; Kaeslin, H.: \u201cRegular VLSI Architectures for Multiplication Modulo (2 exp n + 1)\u201d, IEEE Journal on Solid State Circuits, Vol. 26, No. 7, p. 990\u2013994, July 1991","journal-title":"IEEE Journal on Solid State Circuits"},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1137\/0210047","volume":"3","author":"P. Downey","year":"1981","unstructured":"Downey, P.; Leong, B.; Sethi, R.: \u201cComputing Sequences with Addition Chains\u201d, SIAM Journal on Computing, Vol. 3, No. 3, p. 638\u2013646, August 1981","journal-title":"SIAM Journal on Computing"},{"key":"15_CR5","series-title":"Lect Notes Comput Sci","first-page":"619","volume-title":"Advances in Cryptology \u2014 Crypto\u201990 Proceedings","author":"S. Even","year":"1990","unstructured":"Even, Shimon: \u201cSystolic Modular Multiplication\u201d, in Menezes, A.J.; Vanstone, S.A. (Eds.): \u201cAdvances in Cryptology \u2014 Crypto\u201990 Proceedings (Lecture Notes in Computer Science 537), p. 619\u2013624, Springer, 1990"},{"key":"15_CR6","volume-title":"Computer Arithmetic: Principles, Architecture, and Design","author":"K. Hwang","year":"1979","unstructured":"Hwang, Kai: \u201cComputer Arithmetic: Principles, Architecture, and Design\u201d, John Wiley & Sons, New York, 1979"},{"key":"15_CR7","volume-title":"The Art of Computer Programming, Vol. 2: Seminumerical Algorithms","author":"D. E. Knuth","year":"1969","unstructured":"Knuth, Donald E.: \u201cThe Art of Computer Programming, Vol. 2: Seminumerical Algorithms\u201d, Addison-Wesley, Reading, Massachusetts, 1969"},{"issue":"6","key":"15_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1049\/el:19900235","volume":"26","author":"C. K. Koc","year":"1990","unstructured":"Koc, C. K.; Hung, C. Y.: \u201cMulti-Operand Modulo Addition Using Carry Save Adders\u201d, Electronics Letters, Vol. 26, No. 6, p. 361\u2013363, IEE, March 1990","journal-title":"Electronics Letters"},{"key":"15_CR9","unstructured":"Lippitsch, P.; Posch, K.C.; Posch, R.: \u201cMultiplication As Parallel As Possible\u201d, Institute for Information Processing Graz, Report 290, October 1990"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/4.280","volume":"23","author":"E.H. Lu","year":"1988","unstructured":"Lu, E.H.; Harn, L.; Lee, J.Y.; Hwang, W.Y.: \u201cA Programmable VLSI Architecture for Computing Multiplication and Polynomial Evaluation Modulo a Positive Integer\u201d, IEEE Journal on Solid State Circuits, Vol. 23, No. 1, p. 204\u2013207, February 1988","journal-title":"IEEE Journal on Solid State Circuits"},{"issue":"174","key":"15_CR11","first-page":"603\/608","volume":"46","author":"D.P. McCarthy","year":"1987","unstructured":"McCarthy, D.P.: \u201cEffect of Improved Multiplications Efficiency on Exponentiation Algorithms Derived from Addition Chains\u201d, Mathematics of Computations, Vol. 46, No. 174, p. 603\/608, American Mathematical Society, April 1987","journal-title":"Mathematics of Computations"},{"issue":"170","key":"15_CR12","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P. L. Montgomery","year":"1985","unstructured":"Montgomery, P. L.: \u201cModular Multiplication without Trial Division\u201d, Mathematics of Computation, Vol. 44, No. 170, p. 519\u2013521, April 1985","journal-title":"Mathematics of Computation"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Moraga, Claudio: \u201cDesign of a Modulo p Multiplier\u201d, International Journal on Electronics, Vol. 67, No. 5, p. 819\u2013827, Taylor & Francis, 1989","DOI":"10.1080\/00207218908921132"},{"key":"15_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/BFb0030379","volume-title":"Proceedings of AUSCRYPT\u2019 90","author":"H. Morita","year":"1990","unstructured":"Morita, Hikaru: \u201cA Fast Modular-multiplication Module for Smart Cards\u201d, Proceedings of AUSCRYPT\u2019 90 (Lecture Notes in Computer Science 453), p. 406\u2013409, Springer, January 1990"},{"key":"15_CR15","series-title":"Lect Notes Comput Sci","first-page":"222","volume-title":"\u201cAdvances in Cryptology \u2014 EUROCRYPT\u2019 90\u201d, Proceedings","author":"Y. Yacobi","year":"1990","unstructured":"Yacobi, Y.: \u201cExponentiation Faster with Addition Chains\u201d, in Damgard, I.B. (Ed.): \u201cAdvances in Cryptology \u2014 EUROCRYPT\u2019 90\u201d, Proceedings (Lecture Notes in Computer Science 473), p. 222\u2013229, Springer, 1990"},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0205008","volume":"5","author":"A. Yao","year":"1976","unstructured":"Yao, Andrew: \u201cOn the Evaluation of Powers\u201d, SIAM Journal on Computing, Vol. 5, No. 1, pp. 100\u2013103, March 1976","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"15_CR17","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"IT-24","author":"J. Ziv","year":"1978","unstructured":"Ziv, Jacob; Lempel, Abraham: \u201cCompression of Individuel Sequences via Variable-Rate Coding\u201d, IEEE Transactions on Information Theory, Vol. IT-24, No. 5, pp. 530\u2013536, September 1978","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47555-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:53Z","timestamp":1605647633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47555-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540564133"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-47555-9_15","relation":{},"subject":[]}}