Please use this identifier to cite or link to this item:
|Title:||Interpolation of the elliptic curve Diffie-Hellman mapping||Authors:||Lange, T.
|Issue Date:||2003||Citation:||Lange, T., Winterhof, A. (2003). Interpolation of the elliptic curve Diffie-Hellman mapping. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2643 : 51-60. ScholarBank@NUS Repository.||Abstract:||We prove lower bounds on the degree of polynomials interpolating the Diffie-Hellman mapping for elliptic curves over finite fields and some related mappings including the discrete logarithm. Our results support the assumption that the elliptic curve Diffie-Hellman key exchange and related cryptosystems are secure. © Springer-Verlag Berlin Heidelberg 2003.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/132772||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 8, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.