{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T20:44:23Z","timestamp":1749847463242},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_100","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:00:45Z","timestamp":1330189245000},"page":"582-595","source":"Crossref","is-referenced-by-count":31,"title":["On the power of commutativity in cryptography"],"prefix":"10.1007","author":[{"given":"Adi","family":"Shamir","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"B. Blakley and G. Blakely [1978], \"Security of Number Theoretic Public-Key Cryptosystems Against Random Attack,\" Cryptologia, October 1978.","DOI":"10.1080\/0161-117891853162"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"W. Diffie and M. Hellman [1976], \"New Directions in Cryptography\", IEEE Trans. Info. Theory, November 1976.","DOI":"10.1109\/TIT.1976.1055638"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"S. Even and Y. Yacobi [1980], \"Cryptocomplexity and NP-Completeness\", Seventh ICALP, July 1980.","DOI":"10.1007\/3-540-10003-2_71"},{"key":"47_CR4","unstructured":"D. Knuth [1969], The Art of Computer Programming, Vol 2, Addison-Wesley, 1969."},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"S. Pohlig and M. Hellman [1978], \"An Improved Algorithm for Computing Logarithms Over GF(P) and Its Cryptographic Significance\", IEEE Trans. Info. Theory, January 1978.","DOI":"10.1109\/TIT.1978.1055817"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"R. Rivest, A. Shamir and L. Adleman [1978], \"A Method for Obtaining Digital Signatures and Public-Key Cryptosystems\", CACM, February 1978.","DOI":"10.21236\/ADA606588"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"A. Shamir [1979], \"On the Cryptocomplexity of Knapsack Systems\", Proc. Eleventh ACM Symposium on the Theory of Computing, May 1979.","DOI":"10.1145\/800135.804405"},{"key":"47_CR8","unstructured":"A. Shamir [1980], \"A Pseudo-Random Sequence Generator Whose Cryptocomplexity is Provably Equivalent to that of the RSA\", in preparation."},{"key":"47_CR9","unstructured":"A. Shamir, R. Rivest and L. Adleman [1979], \"Mental Poker\", MIT\/LCS\/TM-125, February 1979."},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"C. Shannon [1948], \"The Mathematical Theory of Communication\", Bell System Technical Journal, July and October 1948.","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:13Z","timestamp":1605643333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}