{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:20:55Z","timestamp":1725643255443},"publisher-location":"London","reference-count":16,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540196464"},{"type":"electronic","value":"9781447131786"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/978-1-4471-3178-6_7","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T02:53:50Z","timestamp":1323831230000},"page":"97-105","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for Data Encryption"],"prefix":"10.1007","author":[{"given":"Wilhelm","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Comunications of the ACM","author":"Adleman","year":"1978","unstructured":"Adleman, Rivest, Shamir \u201cA method for obtaining digital signatures and public-key cryptosystems.\u201d Comunications of the ACM, 1978"},{"key":"7_CR2","volume-title":"Modern Cryptology","author":"Brassard","year":"1988","unstructured":"Brassard Modern Cryptology. New York, Berlin, 1988."},{"key":"7_CR3","series-title":"IEEE Transactions in Information Theory IT-30","volume-title":"Fast evaluation of logarithms in fields of characteristic two","author":"Coppersmith","year":"1984","unstructured":"Coppersmith \u201cFast evaluation of logarithms in fields of characteristic two.\u201d IEEE Transactions in Information Theory IT-30, 1984."},{"key":"7_CR4","series-title":"IEEE Transactions in Information Theory IT-22","volume-title":"New directions in cryptography","author":"Diffie","year":"1976","unstructured":"Diffie, Hellman \u201cNew directions in cryptography.\u201d IEEE Transactions in Information Theory IT-22, 1976."},{"key":"7_CR5","volume-title":"How To Prove Yourself: Practical Solutions to the Identification and Signature Problems","author":"Fiat","year":"1986","unstructured":"Fiat, Shamir How To Prove Yourself: Practical Solutions to the Identification and Signature Problems. Weizmann Institute of Science, Rehovot, 1986."},{"key":"7_CR6","unstructured":"El Gamal \u201cA public key cryptosystem and a signature scheme based on discrete logarithms.\u201d IEEE Transactions in Information Theory."},{"key":"7_CR7","volume-title":"Eurocrypt","author":"Guillou","year":"1988","unstructured":"Guillou, Quisquater A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In Eurocrypt, 1988."},{"key":"7_CR8","series-title":"IEEE Transactions in Information Theory IT-24","volume-title":"Hiding information and signatures in trapdoor knapsacks","author":"Hellman","year":"1978","unstructured":"Hellman, Merkle \u201cHiding information and signatures in trapdoor knapsacks.\u201d IEEE Transactions in Information Theory IT-24, 1978."},{"key":"7_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0310-7","volume-title":"A Course in Number Theory and Cryptography","author":"Koblitz","year":"1987","unstructured":"Koblitz A Course in Number Theory and Cryptography. New York, Berlin, 1987."},{"key":"7_CR10","unstructured":"Lenstra \u201cFactoring integers with elliptic curves.\u201d Report 86-18, Universiteit van Amstgerdam, 1986."},{"key":"7_CR11","series-title":"Proceedings of the 4th Benelux Symposium on Information Theory","volume-title":"Logarithms in finite cyclic groups\u2014cryptographic issues","author":"Massey","year":"1983","unstructured":"Massey \u201cLogarithms in finite cyclic groups\u2014cryptographic issues.\u201d Proceedings of the 4th Benelux Symposium on Information Theory, 1983."},{"key":"7_CR12","volume-title":"Cryptography: a guide for the design and implementation of cryptographic systems","author":"C Meyer","year":"1982","unstructured":"Meyer, C. Cryptography: a guide for the design and implementation of cryptographic systems. John Wiley & Sons, Inc. 1982"},{"key":"7_CR13","unstructured":"National Bureau of Standards Data Encryption Standard. Washington, DC, 1977."},{"key":"7_CR14","volume-title":"MONADS-PC System Management Instructions","author":"Rosenberg","year":"1987","unstructured":"Rosenberg MONADS-PC System Management Instructions. Newcastle, N.S.W., 1987."},{"key":"7_CR15","series-title":"Proceedings of the 23rd Annual Symposium on the Foundations of Computer Science","volume-title":"A polynomial time algorithm for breaking the basic Merkle\u2014Helman cryptosystem","author":"Shamir","year":"1982","unstructured":"Shamir \u201cA polynomial time algorithm for breaking the basic Merkle\u2014Helman cryptosystem.\u201d Proceedings of the 23rd Annual Symposium on the Foundations of Computer Science, 1982."},{"key":"7_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"Silverman","year":"1986","unstructured":"Silverman The Arithmetic of Elliptic Curves. New York, Berlin, 1986."}],"container-title":["Workshops in Computing","Security and Persistence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3178-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T18:32:58Z","timestamp":1555871578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3178-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540196464","9781447131786"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3178-6_7","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1990]]}}}