cnspp-ch09-Public Key Cryptography and RSA_图文.pptVIP

RSA Security three approaches to attacking RSA: brute force key search (infeasible given size of numbers) mathematical attacks (based on difficulty of computing ?(N), by factoring modulus N) timing attacks (on running of decryption) Factoring Problem mathematical approach takes 3 forms: factor N=p.q, hence find ?(N) and then d determine ?(N) directly and find d find d directly currently believe all equivalent to factoring have seen slow improvements over the years as of Aug-99 best is 130 decimal digits (512) bit with GNFS biggest improvement comes from improved algorithm cf “Quadratic Sieve” to “Generalized Number Field Sieve” barring dramatic breakthrough 1024+ bit RSA secure ensure p, q of similar size and matching other constraints Timing Attacks developed in mid-1990’s exploit timing variations in operations eg. multiplying by small vs large number or IFs varying which instructions executed infer operand size based on time taken RSA exploits time taken in exponentiation countermeasures use constant exponentiation time add random delays blind values used in calculations Summary have considered: principles of public-key cryptography RSA algorithm, implementation, security * * So far all the cryptosystems discussed have been private/secret/single key (symmetric) systems. All classical, and modern block and stream ciphers are of this form. * Will now discuss the radically different public key systems, in which two keys are used. Anyone knowing the public key can encrypt messages or verify signatures, but cannot decrypt messages or create signatures, counter-intuitive though this may seem. It works by the clever use of number theory problems that are easy one way but hard the other. Note that public key schemes are neither more secure than private key (security depends on the key size for both), nor do they replace private key schemes (they are too slow to do so), rather they complement them. * The idea of public key schemes, and the first practical scheme,