WORLD'S LARGEST MARKET RESEARCH RESOURCE — 1,519,265 REPORTS

 
 
• SEARCH FOR A REPORT

Viewing report

Search
Enter keywords, a title or a report id number below.
Advanced

• ORDER BY FAX

Order By Fax

• SELECT SITE CURRENCY

Select a currency for use throughout the site



This product is currently not available for purchase.
Live Chat Live Help Software for Website

Customers who bought this item also bought

Implementing Pairing-Based Cryptography. Edition No. 1

VDM Publishing House, January 2009, Pages: 84

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.

Benjamin, Lynn.
Benjamin Lynn received a B.S. from the University of Sydney, and
his Ph.D. in Computer Science from Stanford University.