[-] Show simple item record

dc.contributor.authorBanks, William David, 1964-eng
dc.contributor.authorLieman, Daniel, 1965-eng
dc.contributor.authorShparlinski, Igor E.eng
dc.descriptionThis 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.abstractWe 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.relation.ispartofMathematics publications (MU)eng
dc.relation.ispartofcommunityUniversity of Missouri-Columbia. College of Arts and Sciences. Department of Mathematicseng
dc.rights.licenseThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 License.eng
dc.subjectpublic-key identification schemeeng
dc.subjectFast Legendre Identification Protocoleng
dc.subjectasymmetric key algorithmseng
dc.subject.lcshFactorization (Mathematics)eng
dc.titleAn extremely small and efficient identification schemeeng
dc.typeBook chaptereng

Files in this item


This item appears in the following Collection(s)

  • Mathematics publications (MU)
    The items in this collection are the scholarly output of the faculty, staff, and students of the Department of Mathematics.

[-] Show simple item record