z-logo
open-access-imgOpen Access
Elliptic Curve Public-Key Cryptosystems — An Introduction
Author(s) -
Erik De Win,
Bart Preneel
Publication year - 1998
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-65474-7
DOI - 10.1007/3-540-49248-8_5
Subject(s) - computer science , discrete logarithm , standardization , elliptic curve cryptography , elliptic curve , elliptic curve point multiplication , key (lock) , public key cryptography , cryptosystem , focus (optics) , construct (python library) , hessian form of an elliptic curve , tripling oriented doche–icart–kohel curve , public key cryptosystem , theoretical computer science , cryptography , algorithm , mathematics , pure mathematics , computer security , encryption , programming language , physics , optics , operating system
We give a brief introduction to elliptic curve public-key cryptosystems. We explain how the discrete logarithm in an elliptic curve group can be used to construct cryptosystems. We also focus on practical aspects such as implementation, standardization and intellectual property.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom