6-5 Flashcards
public key method developed in 77 by Rivset, Shamir and Adlman.
rsa
a public key encryption method means that there are not concerns with the ____________
distributing the keys for encryption
RSA is much ______ than symetric ciphers
slower
based on 2 large prime numbers. as in 12024, 2048, 4096 and larger keys.
RSA
No efficient way exists to factor
large prime numbers
if anyone ever invents an efficient way to factor large prime numbers efficiently the RSA would be
dead
probably the most well known asymetric encryption method. allows 2 parties to establish a shared key over an insecure channel. developed in 1976
diffie hellman
based on diffie hellman key exchange algorithms. first described by taher elgamal in 1984. its used in some versions of PGP ( Pretty Good Privacy)
ElGamal
a protocol for key agreement that is based on diffie hellmen. first proposed by Menezes, Qu, and Vanstone in 1995. incorporated in the public key standard IEEE P1363
MQV
US Patent 5,231,668 firled 26 July 1991and attributed to David W Kravitz. adopted by us govt in 1993 with FIPS 186
DSA ( Digital Signature Algorithim)
first decribed by Victor Miller(IBM) and Neil Koblitz ( university of Washington) in 1985. based on the fact that finding the discrete logarithim of a random elliptic curve element with respect to a publically known base point is difficult and impractuical.
Elliptic Curve
the size of the elliptic curve ____________of the finding the algorithim
ECC
this uses asymetric cryptography in reverse order
digital signatures
Avoid Fraud: Vendors that advertise UNBREAKABLE encryption
no code of method is completly secure
Avoid Fraud: Vendors that advertise CERTIFIED products
no recognized certification process for encryption methods exists
