Contact
How to shop
Delivery
Shopping guide
Efficient Algorithms for ECC Using New Coordinates Systems Over GF(P)
The six Genus-1 elliptic curves using projective coordinates
English
121 b
Up to 30 days for returns
Customers also purchased
/
Paperback
39.14
€
/
Paperback
57.71
€
/
Paperback
25.22
€
/
Paperback
25.92
€
/
Audio DVD
20.17
€
/
Paperback
51.76
€
The use of projective coordinates to define the Elliptic Curves (EC) instead of affine coordinates replaced the inversion operations by several multiplication operations. Many types of projective coordinates have been proposed for the elliptic curve E: y2= x3+ ax+ b which is defined over a field GF(p) to do EC arithmetic operations such as: Standard projective coordinates, Jacobean projective coordinates, Chudnovsky coordinates. In this thesis, we studied new projective coordinates systems to perform Elliptic Curves Cryptography (ECC) operations with exploiting maximum parallelism to achieve higher performance. The elected coordinates were tested by using parallel multipliers to obtain maximum gain. The result showed that three new attractive projective coordinates systems that can be used as an alternatives for the standard projective coordinates that already in use. These new coordinates are : Doubling Oriented, Tripling Oriented and Montgomery Curves. Montgomery curves gave the best results for area and time when applied for AT measure. However, the difference between these curves is very small which makes those curves to be three choices for efficient ECC Cryptprocessor design.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
72.24
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?