{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:14Z","timestamp":1725664034809},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572206"},{"type":"electronic","value":"9783540479765"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57220-1_82","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:21:59Z","timestamp":1330240919000},"page":"447-456","source":"Crossref","is-referenced-by-count":7,"title":["The fast cascade exponentiation algorithm and its applications on cryptography"],"prefix":"10.1007","author":[{"given":"Sung-Ming","family":"Yen","sequence":"first","affiliation":[]},{"given":"Chi-Sung","family":"Laih","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"No.4","key":"36_CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal, \u201dA public key cryptosystem and signature scheme based on discrete logarithms,\u201d IEEE Trans. on Inform. Theory, Vol. IT-31, No. 4, pp.469\u2013472, July 1985.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"36_CR2","doi-asserted-by":"crossref","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, \u201dA method for obtaining digital signatures and public-key cryptosystem,\u201d Commun. ACM, Vol. 21, pp.120\u2013126, Feb. 1978.","journal-title":"Commun. ACM"},{"key":"36_CR3","volume-title":"The art of computer programming, Vol. II: Seminumerical algorithms","author":"D.E. Knuth","year":"1969","unstructured":"D.E. Knuth, The art of computer programming, Vol. II: Seminumerical algorithms. Reading, Addison Wesley, 1969."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Andrew Yao, \u201dOn the evaluation of powers,\u201d Siam. J. Comput. 5, (1976).","DOI":"10.1137\/0205008"},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0210047","volume":"3","author":"P. Downey","year":"1981","unstructured":"P. Downey B. Leony and R. Sethi, \u201dComputing sequences with addition chains,\u201d Siam Journ. Comput. 3 (1981) pp.638\u2013696.","journal-title":"Siam Journ. Comput."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"J. Bos, M. Coster, \u201dAddition Chain Heuristics,\u201d Proceedings CRYPTO'89, Springer-Verlag Lecture Notes in Computer Science, pp.400\u2013407.","DOI":"10.1007\/0-387-34805-0_37"},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M.E, Hellman, \u201dNew directions in cryptography,\u201d IEEE Trans. on Inform. Theory, vol.IT-22, pp.644\u2013654, 1976.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science, Vol.435","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology-Proceedings of Crypto'89","author":"C.P. Schnorr","year":"1990","unstructured":"C.P. Schnorr, \u201dEfficient identification and signatures for smart cards,\u201d Advances in Cryptology-Proceedings of Crypto'89, Lecture Notes in Computer Science, Vol.435, Springer Verlag, New York, 1990, pp.239\u2013252."},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"E.F. Brickell and K.S. McCurley, \u201dInteractive identification and digital signatures,\u201d AT and T Technical Journal, November\/December 1991, pp.73\u201386.","DOI":"10.1002\/j.1538-7305.1991.tb00139.x"},{"key":"36_CR10","unstructured":"\u201dA Proposed Federal Information Processing Standard for Digital Signature Standard (DSS),\u201d Federal Register, Vol.56, No.169, August 31, 1991, pp.42980\u201342982."},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Y. Yacobi, \u201dExponentiating faster with addition chains,\u201d Advances in Cryptology-Proceedings of Eurocrypt'90, pp.205\u2013212, 1990.","DOI":"10.1007\/3-540-46877-3_20"},{"key":"36_CR12","unstructured":"C.S. Laih and S.M. Yen, \u201dThe Study of Fast Exponentiation Algorithm,\u201d Technical Report of NSC 81-0408-E-006-02 (1992)."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 AUSCRYPT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57220-1_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:09:39Z","timestamp":1605629379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57220-1_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572206","9783540479765"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57220-1_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}