Name: rsa Title: RSA Public Key Algorithm Author: ->Ralf S. Engelschall::mailto:rse@engelschall.com<- Reply-To: rse@engelschall.com Created: 11-May-2002 Modified: 11-May-2002 Serial: 1 Password: CheatMe! ?? What does **RSA** stand for? !! presentation, ->slide 2::rsa/slide-002-n.html<- -- Ronald's Security Algorithm -- Ronald Shane Adleman ++ Rivest Shamir Adleman -- Remainder Secret Algorithm -- Remaining Security Advocation -- Rivest Shamir Algorithm ?? RSA is a... !! presentation, ->slide 2::rsa/slide-002-n.html<-, ->slide 4::rsa/slide-004-n.html<- ++ asymmetric cryptography algorithm -- symmetric cryptography algorithm -- elliptic curve cryptography algorithm -- private key cryptography algorithm ?? The RSA algorithm provides... !! presentation, ->slide 2::rsa/slide-002-n.html<- ++ Encryption ++ Digital Signatures ++ Secure Key Exchange -- Steganography -- Data Mining -- Zero Knowledge -- Message Digesting -- Electronic Cash ?? RSA is one of the cryptrography algorithm underlying... !! presentation, ->slide 3::rsa/slide-003-n.html<- ++ SSL/TLS ++ SSH ++ IPsec ++ DNSSEC ++ PGP -- DNS ++ SMIME -- MIME -- HTTP ++ HTTPS -- FTP ++ SFTP -- IMAP ++ IMAPS -- POP3 ?? RSA is **mainly** based on mathematical foundations from... !! presentation, ->slide 3::rsa/slide-003-n.html<- -- function theory -- coding theory ++ algebra ++ number theory -- analysis -- geometry ?? The major drawback in symmetric cryptography is that the... !! presentation, ->slide 4::rsa/slide-004-n.html<- ++ key has to be securely interchanged before communication -- key cannot be made as secure as needed -- algorithms are not as secure as the asymmetric ones -- algorithms can be implemented in hardware too easily ?? Ciphers provide... !! presentation, ->slide 4::rsa/slide-004-n.html<- ++ privacy -- integrity -- authentication -- invisibility ?? Message digests provide... !! presentation, ->slide 5::rsa/slide-005-n.html<- -- privacy ++ integrity -- authentication -- invisibility ?? Certificates provide... !! presentation, ->slide 6::rsa/slide-006-n.html<- -- privacy -- integrity ++ authentication -- invisibility ?? Which of the following are **symmetric** cryptography algorithms? !! presentation, ->slide 4::rsa/slide-004-n.html<- ++ DES ++ AES ++ Blowfish ++ RC4 ++ IDEA -- DH -- ElGammal -- RSA -- MD5 -- SHA1 -- RMD160 -- CRC ?? Which of the following are **asymmetric** cryptography algorithms? !! presentation, ->slide 4::rsa/slide-004-n.html<- -- DES -- AES -- Blowfish -- RC4 -- IDEA ++ DH ++ ElGammal ++ RSA -- MD5 -- SHA1 -- RMD160 -- CRC ?? Which of the following are **cryptographically-strong** message digest algorithms? !! presentation, ->slide 5::rsa/slide-005-n.html<- -- DES -- AES -- Blowfish -- RC4 -- IDEA -- DH -- ElGammal -- RSA ++ MD5 ++ SHA1 ++ RMD160 -- CRC ?? Message digests generate for long variable-length messages... !! presentation, ->slide 5::rsa/slide-005-n.html<- -- long fixed-length representations -- long variable-length representations ++ short fixed-length representations -- short variable-length representations ?? Message digests for two different messages... !! presentation, ->slide 5::rsa/slide-005-n.html<- -- are equal -- should be equal -- are different ++ should be different ?? Digital certificates associate... !! presentation, ->slide 6::rsa/slide-006-n.html<- ++ a public key with an identity -- a private key with an identity -- a public key with a private key ?? "x mod n = y" (x, y, n, k: all integers greater than 0), is equivalent with !! presentation, ->slide 8::rsa/slide-008-n.html<- ++ x = k*n + y -- x = k/n + x -- n = x/y -- n = x*y ?? Primes are numbers which... !! presentation, ->slide 8::rsa/slide-008-n.html<- -- if multiplied with theirself result in 1 ++ are without remainder only divisible by theirself and 1 ++ have 1 as the greatest common divisor with all lower numbers -- can be divided by theirself with a remainder of 1 ?? The primary mathematical foundation for the possibility that \ the encryption of RSA can be decrypted is the theorem of... !! presentation, ->slide 9::rsa/slide-009-n.html<- -- Gauß ++ Euler/Fermat -- Cauchy -- Riemann -- Rivest -- Shamir -- Adleman -- Rivest/Shamir/Adleman ?? Encrypting message M with RSA public key {e,n} (n modulus) into cipher text \ C basically means calculating !! presentation, ->slide 10::rsa/slide-010-n.html<- ++ C = M^e mod n -- M = C^e mod n -- C = M^n mod e -- M = C^n mod e -- e = M*C^2 -- C = M mod n^e ?? Decrypting cipher text C with RSA private key {d,n} (n modulus) into message \ M basically means calculating !! presentation, ->slide 10::rsa/slide-010-n.html<- -- C = M^d mod n ++ M = C^d mod n -- C = M^n mod e -- M = C^n mod e -- d = M*C^2 -- M = C mod n^d ?? In RSA the two involved keys are named the... !! presentation, ->slide 11::rsa/slide-011-n.html<- ++ public key ++ private key -- secret key -- unsecure key -- secure key -- protected key ?? The RSA private key is... !! presentation, ->slide 11::rsa/slide-011-n.html<- ++ technically fully interchangeable with the public key ++ private by definition only, not by mathematical constraints -- private by mathematical constraints, not by definition ?? **Very large** random prime numbers are efficiently determined by... !! vocal explanations while presentation -- deterministic calculation ++ repeated guessing and testing -- looking up in a table ?? For applying RSA to encrypt arbitrary texts, one has to... !! presentation, ->slide 13::rsa/slide-013-n.html<- ++ treat character blocks as a large integer numbers -- encrypt every single text character individually ?? The security of RSA lies in the fact that... !! presentation, ->slide 13::rsa/slide-013-n.html<- ++ no efficient algorithm is known for factorization of numbers -- no efficient algorithm is known for calculating discrete logarithm -- the remaining algorithm details are kept secret by RSA, Inc. -- the algorithm is proofed to be unbreakable -- the algorithm is definetely secure by design ?? RSA, compared to the speed of DES/AES, is... !! presentation, ->slide 13::rsa/slide-013-n.html<- -- dramatically faster -- slightly faster -- approximately equal -- slightly slower ++ dramatically slower -- not comparable ?? When implementing RSA, the **main** problems are that you need... !! presentation, ->slide 13::rsa/slide-013-n.html<- ++ arbitrary precision arithmetic ++ good pseudo-random number generator ++ efficient primaly test -- fast hardware -- secure memory -- assembly language ?? There patent on RSA... !! presentation, ->slide 2::rsa/slide-002-n.html<- -- expired in 1978 ++ started in 1978 ++ expired in 2000 -- started in 2000 -- expires in 2038 -- starts in 2038 == The analysis of your answers indicates that -- 000-009 you have still not understood RSA at all. Sorry. -- 010-029 you have understood only a few points about RSA. Hmmm.. -- 030-049 you have understood a fair amount about RSA. Go ahead. -- 050-079 you have understood a lot about RSA, but failed a few points. Ok. -- 080-089 you have understood mostly all about RSA. Great! -- 090-100 you have fully understood RSA. Congratulations! Wohooo! == We have to conclude that you are -- 000-009 sleeping while presentations are held. **:-(** -- 010-029 still not familiar enough with cryptography. **:-|** -- 030-049 a cryptography newbie with at least increasing potential. **:-)** -- 050-079 a cryptography fan with an already large potential. **:-)** -- 080-089 a cryptography enthusiast. Just a few steps missing to a guru. **;-)** -- 090-100 a cryptography guru already shaking hands with Ron, Adi and Len. **;-)**