dc.contributor.author | Banks, William David, 1964- | eng |
dc.contributor.author | Lieman, Daniel, 1965- | eng |
dc.contributor.author | Shparlinski, Igor E. | eng |
dc.date.issued | 2000 | eng |
dc.description | This is a preprint of a book chapter published in Lecture Notes in Computer Science,1841, Springer-Verlag, Berlin (2000). The original publication is available at www.springerlink.com. | eng |
dc.description.abstract | We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. | eng |
dc.identifier.uri | http://hdl.handle.net/10355/10613 | eng |
dc.language | English | eng |
dc.relation.ispartof | Mathematics publications (MU) | eng |
dc.relation.ispartofcommunity | University of Missouri-Columbia. College of Arts and Sciences. Department of Mathematics | eng |
dc.rights | OpenAccess. | eng |
dc.rights.license | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 License. | |
dc.subject | public-key identification scheme | eng |
dc.subject | Fast Legendre Identification Protocol | eng |
dc.subject | asymmetric key algorithms | eng |
dc.subject.lcsh | Cryptography | eng |
dc.subject.lcsh | Factorization (Mathematics) | eng |
dc.title | An extremely small and efficient identification scheme | eng |
dc.type | Book chapter | eng |