Loading...
conference paper
An authentication scheme based on roots of sparse polynomials
2003
Proceedings of the IEEE Information Theory Workshop, 2003
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.
Type
conference paper
Authors
Publication date
2003
Published in
Proceedings of the IEEE Information Theory Workshop, 2003
Start page
159
End page
162
Subjects
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
January 16, 2007
Use this identifier to reference this record