Asymmetric Cryptography 1 Flashcards
based off discrete math operations in the finite field, suitable for small amounts of data, provides confidentiality, authentication, and Non-repudiation.
Asymmetric Cryptography
Sender always keeps private key, and sender distributes public key, recipients have access to public key, both keys can encrypt and decrypt. Whatever private key encrypts only public key can decrypt. If encrypt with public key, private key can decrypt.
Key Info …
Send a student a message prove to them I sent them the message and encrypt the message I send them my public key and encrypt it with my private key, and sign it with private key, the student gets the message, they can decrypt it with the public key I give them access to.
Key Info #2 …
two very large prime numbers
encrypt plaintext with public key, turns that into ciphertext, sender decrypts it with private key.
Zero Proof Knowledge : your private key encryption can be proofed with your public key.
info …
Open Message Security Format : message secured with users private key, ensures confidentiality that only a server or person can read the message.
Secured Message Format : message secured with recipients public key.
Advantages : key management, public key can be freely distributed, digital signatures, integrity checks, key exchange, non-repudiation.
info …
asymmetric algorithm, encryption, digital signatures, key exchange, based on difficulty of factoring large prime numbers; 512-bit block, 1024-2048 to 8000 bit-key length, used in PGP.
RSA (asymmetric algorithm)
asymmetric algorithm, encryption, digital signatures, key exchange, based on using points on a curve to define public/private key, requires less computing power, implemented on mobile devices.
ECC (asymmetric algorithm)
asymmetric algorithm, provides key exchange, based on difficulty of computing discrete logarithms, key length -> 512-bit to 1024-2048 considered secure, used in PGP. ex : Bob generates both his own private/public key and Alice generates both her own private/public key, then Bob sends Alice his public key, and Alice sends Bob her public key, now then Bob takes Alices public key and combines it with his private key creating a one-time session key, Alice takes Bobs public key and combines it with her private key and creates her one-time session key, now both have a temporary session and do key exchange encrypt and decrypt, but neither have to exchange private keys. Vulnerable to MITM.
DH (asymmetric algorithm)
asymmetric algorithm, encryption, digital signatures, key exchange, based on DH, slower than
other comparable algorithms.
ElGamal (asymmetric algorithm)
asymmetric algorithm, used to digitally sign documents, performs SHA-1 integrity check.
DSA (asymmetric algorithm)
