Lynn, B: Implementing Pairing-Based Cryptography How to find and compute pairings
-
- Englisch ausgewählt
Fr. 77.90
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
25.10.2013
Verlag
VDMSeitenzahl
84
Maße (L/B/H)
22/15/0.5 cm
Gewicht
128 g
Sprache
Englisch
ISBN
978-3-639-10486-8
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.
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung