Advances in Elliptic Curve CryptographyIan F. Blake, Gadiel Seroussi, Nigel P. Smart Cambridge University Press, 25 apr 2005 Since the appearance of the authors' first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. In some topics, particularly point counting, the progress has been spectacular. Other topics such as the Weil and Tate pairings have been applied in new and important ways to cryptographic protocols that hold great promise. Notions such as provable security, side channel analysis and the Weil descent technique have also grown in importance. This second volume addresses these advances and brings the reader up to date. Prominent contributors to the research literature in these areas have provided articles that reflect the current state of these important topics. They are divided into the areas of protocols, implementation techniques, mathematical foundations and pairing based cryptography. Each of the topics is presented in an accessible, coherent and consistent manner for a wide audience that will include mathematicians, computer scientists and engineers. |
Sommario
IV | 3 |
V | 4 |
VI | 8 |
VII | 12 |
VIII | 18 |
IX | 21 |
X | 23 |
XI | 32 |
XLII | 144 |
XLIII | 146 |
XLIV | 149 |
XLV | 151 |
XLVI | 153 |
XLVII | 166 |
XLVIII | 173 |
XLIX | 175 |
XII | 33 |
XIII | 36 |
XIV | 41 |
XV | 42 |
XVI | 50 |
XVII | 58 |
XVIII | 61 |
XIX | 69 |
XX | 70 |
XXI | 71 |
XXII | 72 |
XXIII | 77 |
XXIV | 84 |
XXV | 87 |
XXVI | 88 |
XXVII | 92 |
XXVIII | 97 |
XXIX | 98 |
XXX | 100 |
XXXI | 103 |
XXXII | 104 |
XXXIII | 105 |
XXXIV | 115 |
XXXV | 121 |
XXXVI | 128 |
XXXVII | 132 |
XXXVIII | 133 |
XXXIX | 136 |
XL | 140 |
XLI | 142 |
Altre edizioni - Visualizza tutto
Advances in Elliptic Curve Cryptography Ian F. Blake,Gadiel Seroussi,Nigel P. Smart Anteprima limitata - 2005 |
Parole e frasi comuni
algebraic apply Artin-Schreier BDH problem bilinear bits challenge ciphertext Chapter characteristic compute construction cryptography Cryptology cryptosystems decryption oracle denote Diffie-Hellman problem discrete logarithm problem E(Fq ECDH ECDSA ECIES efficient element elliptic curve points embedding degree encryption scheme endomorphism entity equation example finite field follows forger Frobenius function field G₁ genus GHS attack given hash function Hence hyperelliptic curves IBE scheme identity implementation IND-CCA2 index-calculus input integer isogeny isomorphism j-invariant Jacobian key agreement key derivation function Lemma LNCS mod pm mod q modulo OUTPUT P₁ P₂ parameters point addition point multiplication polynomial private key protocol provable security public key public-key cryptography public-key encryption queries reduced divisor result secret Section security proof semi-logarithm side-channel analysis signature scheme smart cards solve Springer-Verlag subgroup supersingular symmetric key Tate pairing Theorem Weil pairing zero