{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:53:18Z","timestamp":1764996798114},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677420"},{"type":"electronic","value":"9783540450306"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10718964_31","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T16:04:09Z","timestamp":1167408249000},"page":"378-384","source":"Crossref","is-referenced-by-count":2,"title":["An Extremely Small and Efficient Identification Scheme"],"prefix":"10.1007","author":[{"given":"William D.","family":"Banks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Lieman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor E.","family":"Shparlinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1975)"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1215\/S0012-7094-97-08815-3","volume":"88","author":"M. Anshel","year":"1997","unstructured":"Anshel, M., Goldfeld, D.: Zeta functions, one-way functions, and pseudoran- dom number generators. Duke Math. J.\u00a088, 371\u2013390 (1997)","journal-title":"Duke Math. J."},{"key":"31_CR3","volume-title":"Algorithmic number theory","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic number theory. MIT Press, Cambridge (1996)"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0020-0190(99)00047-2","volume":"70","author":"E. Biham","year":"1999","unstructured":"Biham, E., Boneh, D., Reingold, O.: Breaking generalized Diffie-Hellman modulo a composite is not weaker than factoring. Inform. Proc. Letters\u00a070, 83\u201387 (1999)","journal-title":"Inform. Proc. Letters"},{"key":"31_CR5","volume-title":"A course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1997","unstructured":"Cohen, H.: A course in Computational Algebraic Number Theory. Springer, Berlin (1997)"},{"key":"31_CR6","volume-title":"Modern Computer Algebra","author":"J. zur Gathen von","year":"1999","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)"},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1090\/conm\/143\/01006","volume":"143","author":"D. Goldfeld","year":"1993","unstructured":"Goldfeld, D., Hoffstein, J.: On the number of Fourier coefficients that determine a modular form. Contemp. Math.\u00a0143, 385\u2013393 (1993)","journal-title":"Contemp. Math."},{"key":"31_CR8","unstructured":"Hoffstein, J., Lieman, D., Silverman, J.: Polynomial rings and efficient public key authentication. In: Blum, M., Lee, C.H. (eds.) Proc. the Intern. Workshop on Cryptographic Techniques and E-Commerce (CrypTEC 1999). City University of Hong Kong Press (1999) (to appear)"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02351718","volume":"1","author":"K.S. McCurley","year":"1988","unstructured":"McCurley, K.S.: A key distribution system equivalent to factoring. J. Cryptology\u00a01, 95\u2013105 (1988)","journal-title":"J. Cryptology"},{"key":"31_CR10","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1996","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10718964_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T22:23:17Z","timestamp":1552861397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10718964_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677420","9783540450306"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/10718964_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}