Andere Kunden interessierten sich auch für
![Pairing-Based Cryptography -- Pairing 2013]( "Pairing-Based Cryptography -- Pairing 2013")
Pairing-Based Cryptography -- Pairing 201337,99 €![Implementing a Timetable]( "Implementing a Timetable")
Implementing a Timetable32,99 €![The Benefits and the Challenges of Implementing VoIP]( "The Benefits and the Challenges of Implementing VoIP")
The Benefits and the Challenges of Implementing VoIP32,99 €![Selected Areas in Cryptography -- SAC 2013]( "Selected Areas in Cryptography -- SAC 2013")
Selected Areas in Cryptography -- SAC 201337,99 €![An analysis of the success factors in implementing an ITIL-based IT Change and Release Management Application: Based on the IBM Change and Configuration Management Database (CCMDB)]( "An analysis of the success factors in implementing an ITIL-based IT Change and Release Management Application: Based on the IBM Change and Configuration Management Database (CCMDB)")
An analysis of the success factors in implementing an ITIL-based IT Change and Release Management Application: Based on the IBM Change and Configuration Management Database (CCMDB)44,99 €![Diverse Reasons For Implementing Business Information Systems]( "Diverse Reasons For Implementing Business Information Systems")
Diverse Reasons For Implementing Business Information Systems46,99 €![ERP Misalignment on Implementing-Organisations from Developing Country]( "ERP Misalignment on Implementing-Organisations from Developing Country")
ERP Misalignment on Implementing-Organisations from Developing Country23,99 €
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.