Abstract
This paper surveys some recent work on applications of polynomials (over finite fields) to the design of various cryptographic protocols. It is based on a talk given at the 3rd Conference on Security in Communication Networks, 2002. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Kushilevitz, E. (2003). Some applications of polynomials for the design of cryptographic protocols. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2576, 1–13. https://doi.org/10.1007/3-540-36413-7_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free