Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/118700
26 Visitors
28 Hits
0 Downloads
- Title
- An Authentication scheme based on roots of sparse polynomials
- Related
- Information Theory Workshop (31 March - 4 April 2003 : Paris)
- Related
- 2003 IEEE Information Theory Workshop : proceedings : La Sorbonne, Paris, France, 31 March-4 April, 2003, p.159-161
- DOI
- 10.1109/ITW.2003.1216719
- Publisher
- Piscataway, N.J : IEEE
- Date
- 2003
- FoR/RFCD Code(s)
-
080200 Computation Theory and Mathematics
- Author/Creator
- von zur Gathen, Joachim
- Author/Creator
- Shokrollahi, Amin
- Author/Creator
- Shparlinski, Igor
- Description
- We describe an authentication scheme whose security is based on the hardness of finding roots of systems of sparse polynomial equations in many variables and of high degree. One of the new ideas is the use of many keys. In one authentication session, a small amount of information about only one of them, chosen randomly, is released; this may be useful in other situations as well. Although the practicality of this scheme has still to be investigated, we believe that the new ideas described here may be of independent interest.
- Description
- 3 page(s)
- Subject Keyword
- 080200 Computation Theory and Mathematics
- Resource Type
- conference paper
- Organisation
- Macquarie University. Dept. of Computing
- Identifier
- http://hdl.handle.net/1959.14/118700
- Identifier
- ISBN:0780377990
- Identifier
- mq-rm-2003018721
- Language
- eng
- Rights
- Copyright 2003 IEEE. Reprinted from 2003 IEEE Information Theory Workshop : proceedings. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Macquarie University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Full Text

- Reviewed

-
-