{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:17:52Z","timestamp":1725488272974},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540576006"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48285-7_38","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T02:16:46Z","timestamp":1185934606000},"page":"440-442","source":"Crossref","is-referenced-by-count":0,"title":["Cryptanalysis of the Chang-Wu-Chen key distribution system"],"prefix":"10.1007","author":[{"given":"Mike","family":"Burmester","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","first-page":"175","volume":"18","author":"L. Adleman","year":"1977","unstructured":"L. Adleman, K.M. Manders, and G.M. Miller. On taking roots in finite fields. Annual Symposium on Foundations of Computer Science, Vol. 18, 1977, pp. 175\u2013178.","journal-title":"Annual Symposium on Foundations of Computer Science"},{"key":"38_CR2","unstructured":"S. Ben-David, B. Chor, O. Goldreich, M. Luby. On the theory of Average case Complexity. Proceedings of the twenty first annual ACM Symp. Theory of Computing, STOC, 1977, pp. 175\u2013178."},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Chin-Chen Chang, Tzong-Chen Wu, and C.P. Chen. The Design of a Conference Key Distribution System. Presented at Auscrypt 92, Gold Coast, Australia, December 13\u201316, 1992. To appear in: Advances in Cryptology, Lecture Notes in Computer Science, Springer-Verlag.","DOI":"10.1007\/3-540-57220-1_83"},{"key":"38_CR4","unstructured":"M. Burmester, Y. Desmedt. An Efficient and Secure Conference Key Distribution System. Manuscript, April 1993."},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, M. Burmester. Towards practical \u2018proven secure\u2019 authenticated key distribution. To appear in, Proceedings of the 1st ACM Conference on Communications and Computing Security, Fairfax, Virginia, November 3\u20135, 1993.","DOI":"10.1145\/168588.168616"},{"issue":"6","key":"38_CR6","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, IT-22(6), 1976, pp. 644\u2013654.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"38_CR7","unstructured":"D. Shanks. Five number theoretic algorithms. Proc. Second Manitoba Conf. Numerical Mathematics, 1972, pp. 51\u201370."},{"key":"38_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-38424-3_19","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 90, Proceedings","author":"Y. Yacobi","year":"1991","unstructured":"Y. Yacobi. A Key Distribution Paradox. In Advances in Cryptology \u2014 Crypto\u2019 90, Proceedings (Lecture Notes in Computer Science #537), 1991, A.J. Menezes and S.A. Vanstone, Eds, Springer-Verlag, pp. 268\u2013273."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201993"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48285-7_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:32Z","timestamp":1619571032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48285-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540576006"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-48285-7_38","relation":{},"subject":[]}}