Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Efficient Algorithms for ECC Using New Coordinates Systems Over GF(P)
The six Genus-1 elliptic curves using projective coordinates
Engleski
115 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Meki uvez
39.29
€
/
Meki uvez
57.92
€
/
Meki uvez
26.22
€
/
Meki uvez
26.02
€
/
Audio DVD
19.13
€
/
Meki uvez
51.95
€
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.
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
68.66
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?