{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:20:22Z","timestamp":1776842422181,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540601760","type":"print"},{"value":"9783540447177","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0053453","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T00:05:50Z","timestamp":1149638750000},"page":"389-399","source":"Crossref","is-referenced-by-count":52,"title":["Efficient exponentiation using precomputation and vector addition chains"],"prefix":"10.1007","author":[{"given":"Peter","family":"de Rooij","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"J. Bos and M. Coster, \u201cAddition chain heuristics\u201d, Advances in Cryptology \u2014 Proceedings of Crypto'89 (G. Brassard, ed.), Lecture Notes in Computer Science, vol. 435, Springer-Verlag, 1990, pp. 400\u2013407.","DOI":"10.1007\/0-387-34805-0_37"},{"key":"35_CR2","unstructured":"J. N. E. Bos, Practical Privacy, Ph.D. thesis, Technical University of Eindhoven, March 1992."},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson, \u201cFast exponentiation with precomputation (extended abstract)\u201d, Advances in Cryptology \u2014 Proceedings of Eurocrypt'92 (R. A. Rueppel, ed.), Lecture Notes in Computer Science, vol. 658, Springer-Verlag, 1993, pp. 200\u2013207.","DOI":"10.1007\/3-540-47555-9_18"},{"issue":"no.1","key":"35_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF00191319","volume":"5","author":"E. F. Brickell","year":"1992","unstructured":"E. F. Brickell and K. S. McCurley, \u201cAn interactive identification scheme based on discrete logarithms and factoring\u201d, Journal of Cryptology 5 (1992), no. 1, pp. 29\u201339.","journal-title":"Journal of Cryptology"},{"key":"35_CR5","volume-title":"Tech. Report CS-R9024","author":"M. Coster","year":"1990","unstructured":"M. Coster, Some Algorithms on Addition Chains and their Complexity, Tech. Report CS-R9024, Centrum voor Wiskunde en Informatica, Amsterdam, 1990."},{"issue":"no.4","key":"35_CR6","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal, \u201cA public key cryptosystem and a signature scheme based on discrete logarithms\u201d, IEEE Transactions on Information Theory IT-31 (1985), no. 4, pp. 469\u2013472.","journal-title":"IEEE Transactions on Information Theory"},{"key":"35_CR7","volume-title":"The Art of Computer Programming, vol. 2","author":"D. E. Knuth","year":"1981","unstructured":"D. E. Knuth, Seminumerical Algorithms, second ed., The Art of Computer Programming, vol. 2, Addison-Wesley, Reading, Massachusetts, 1981.","edition":"second ed."},{"key":"35_CR8","unstructured":"National Institute of Technology and Standards, Specifications for the Digital Signature Standard (DSS), Federal Information Processing Standards Publication XX, US. Department of Commerce, February 1 1993."},{"issue":"no.2","key":"35_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"R. L. Rivest, A. Shamir, and L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems\u201d, Communications of the ACM 21 (1978), no. 2, pp. 120\u2013126.","journal-title":"Communications of the ACM"},{"issue":"no.3","key":"35_CR10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr, \u201cEfficient signature generation by smart cards\u201d, Journal of Cryptology 4 (1991), no. 3, pp. 161\u2013174.","journal-title":"Journal of Cryptology"},{"issue":"no.1","key":"35_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0205008","volume":"5","author":"A. Yao","year":"1976","unstructured":"A. Yao, \u201cOn the evaluation of powers\u201d, SIAM Journal on Computing 5 (1976), no. 1, pp. 100\u2013103.","journal-title":"SIAM Journal on Computing"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"S.-M. Yen and C.-S. Laih, \u201cThe fast cascade exponentiation algorithm and its application to cryptography\u201d, Abstracts of Auscrypt 92, 1992, pp. 10-20\u201310-25.","DOI":"10.1007\/3-540-57220-1_82"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"S.-M. Yen, C.-S. Laih, and A. K. Lenstra, \u201cA note on multi-exponentiation\u201d, IEE Proceedings, Computers and Digital Techniques 141 (1994), no. 5, to appear.","DOI":"10.1049\/ip-cdt:19941271"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT'94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:21:57Z","timestamp":1555640517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601760","9783540447177"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0053453","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}