Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
24
click to vote
AAECC
2003
Springer
favorite
Email
discuss
report
104
views
Algorithms
»
more
AAECC 2003
»
Interpolation of the Elliptic Curve Diffie-Hellman Mapping
14 years 2 months ago
Download
www.ricam.oeaw.ac.at
Abstract. We prove lower bounds on the degree of polynomials interpolating the Diffie
Tanja Lange, Arne Winterhof
Real-time Traffic
AAECC 2003
|
Algorithms
|
Elliptic Curve
|
Elliptic Curve Diffiehellman
|
Lower Bounds
|
claim paper
Related Content
»
The Decision DiffieHellman Problem
»
Making the DiffieHellman Protocol IdentityBased
more »
Post Info
More Details (n/a)
Added
23 Aug 2010
Updated
23 Aug 2010
Type
Conference
Year
2003
Where
AAECC
Authors
Tanja Lange, Arne Winterhof
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision