NIT Sikkim

9 Followers

y2 ≡ x3 + a.x + b mod p mobile 4.a3+27.b2 ≠ 0 mod p elliptic curves (160-256 bit) than for rsa(1024-30 discrete logarithmic problem rsa ecc decryption encryption security diffie hellman exchange elgamal one way function elliptic curve cryptosystem key size elliptic curve cryptography point doubling point addition dlp

Aktivität
Info

Discrete Logarithmic Problem- Basis of Elliptic Curve Cryptosystems

Vor 7 Jahren • 2367 Aufrufe

y2 ≡ x3 + a.x + b mod p mobile 4.a3+27.b2 ≠ 0 mod p elliptic curves (160-256 bit) than for rsa(1024-30 discrete logarithmic problem rsa ecc decryption encryption security diffie hellman exchange elgamal one way function elliptic curve cryptosystem key size elliptic curve cryptography point doubling point addition dlp

NIT Sikkim

Präsentationen

Discrete Logarithmic Problem- Basis of Elliptic Curve Cryptosystems