Implementing Pairing-Based Cryptography
How to find and compute pairings
Versandkostenfrei!
Versandfertig in 6-10 Tagen
32,99 €
inkl. MwSt.
PAYBACK Punkte
16 °P sammeln!
Pairing-based cryptography is a relatively youngfield revolving around a family of functions known aspairings, or bilinear maps, whose remarkableproperties allow the creation of novelcryptosystems that are otherwise difficult orimpossible to construct. This book beginsby giving abstract definitions of pairings andrelated hardness problems, and showing how they areused in cryptography. Later chapters discuss methodsfor finding elliptic curves yielding suitablepairings, along with algorithms for computing onthem. The final chapters describe vitaloptimizations. Aside from low-level arithmetic, th...
Pairing-based cryptography is a relatively young
field revolving around a family of functions known as
pairings, or bilinear maps, whose remarkable
properties allow the creation of novel
cryptosystems that are otherwise difficult or
impossible to construct. This book begins
by giving abstract definitions of pairings and
related hardness problems, and showing how they are
used in cryptography. Later chapters discuss methods
for finding elliptic curves yielding suitable
pairings, along with algorithms for computing on
them. The final chapters describe vital
optimizations. Aside from low-level arithmetic, this
text quotes algorithms unlikely to be taught in a
basic course in abstract algebra, enabling a
mathematically inclined programmer to implement
pairings without referring to any other sources.
field revolving around a family of functions known as
pairings, or bilinear maps, whose remarkable
properties allow the creation of novel
cryptosystems that are otherwise difficult or
impossible to construct. This book begins
by giving abstract definitions of pairings and
related hardness problems, and showing how they are
used in cryptography. Later chapters discuss methods
for finding elliptic curves yielding suitable
pairings, along with algorithms for computing on
them. The final chapters describe vital
optimizations. Aside from low-level arithmetic, this
text quotes algorithms unlikely to be taught in a
basic course in abstract algebra, enabling a
mathematically inclined programmer to implement
pairings without referring to any other sources.
Andere Kunden interessierten sich für
