Open key Cryptography .

Uploaded on:
Public-key Cryptography. Montclair State University CMPT 109 J.W. Benham Spring, 1998. What Is Cryptography?. Cryptography -- from the Greek for “secret writing” -- is the mathematical “scrambling” of data so that only someone with the necessary key can “unscramble” it.
Slide 1

Open key Cryptography Montclair State University CMPT 109 J.W. Benham Spring, 1998

Slide 2

What Is Cryptography? Cryptography - from the Greek for "mystery composing" - is the numerical "scrambling" of information so that lone somebody with the vital key can "unscramble" it. Cryptography permits secure transmission of private data over uncertain channels (for instance parcel exchanged systems). Cryptography additionally permits secure capacity of delicate information on any PC.

Slide 3

Classical Cryptography: Secret-Key or Symmetric Cryptography Alice and Bob concur on an encryption strategy and a common key . Alice utilizes the key and the encryption strategy to encode (or encipher ) a message and sends it to Bob. Sway utilizes similar key and the related unscrambling technique to decode (or unravel ) the message.

Slide 4

Advantages of Classical Cryptography There are some quick traditional encryption (and unscrambling) calculations Since the speed of a technique fluctuates with the length of the key, quicker calculations permit one to utilize longer key qualities. Bigger key qualities make it harder to figure the key esteem - and break the code - by animal constrain.

Slide 5

Disadvantages of Classical Cryptography Requires secure transmission of key esteem Requires a different key for every gathering of individuals that desires to trade encoded messages (meaningful by any gathering part) For instance, to have a different key for every match of individuals, 100 individuals would require 4950 diverse keys.

Slide 6

Public-Key Cryptography: Asymmetric Cryptography Alice produces a key esteem (as a rule a number or match of related numbers) which she makes open. Alice utilizes her open key (and some extra data) to decide a second key (her private key ). Alice keeps her private key (and the extra data she used to build it) mystery.

Slide 7

Public-Key Cryptography (proceeded with) Bob (or Carol, or any other individual) can utilize Alice\'s open key to scramble a message for Alice. Alice can utilize her private key to decode this message. Nobody without access to Alice\'s private key (or the data used to develop it) can undoubtedly decode the message.

Slide 8

An Example: Internet Commerce Bob needs to utilize his Mastercard to get a few brownies from Alice over the Internet. Alice sends her open key to Bob. Sway utilizes this key to scramble his Visa number and sends the encoded number to Alice. Alice utilizes her private key to unscramble this message (and get Bob\'s Visa number).

Slide 9

Hybrid Encryption Systems All known open key encryption calculations are much slower than the speediest mystery key calculations. In a half and half framework, Alice uses Bob\'s open key to send him a mystery shared session key . Alice and Bob utilize the session key to trade data.

Slide 10

Internet Commerce (proceeded with) Bob needs to request brownies from Alice and keep the whole exchange private. Weave sends Alice his open key. Alice produces a session key, encodes it utilizing Bob\'s open key, and sends it to Bob. Bounce utilizes the session key (and a settled upon symmetric encryption calculation) to encode his request, and sends it to Alice.

Slide 11

Digital Signatures: Signing a Document Alice applies an (openly known) hash capacity to a report that she wishes to "sign." This capacity delivers a process of the record (generally a number). Alice then uses her private key to "encode" the process. She can then send, or even communicate, the record with the encoded process.

Slide 12

Digital Signature Verification Bob uses Alice\'s open key to "unscramble" the process that Alice "scrambled" with her private key. Weave applies the hash capacity to the archive to get the process specifically. Bounce thinks about these two qualities for the process. On the off chance that they coordinate, it demonstrates that Alice marked the record and that nobody else has adjusted it.

Slide 13

Secure Transmission of Digitally Signed Documents Alice utilizes her private key to digitally sign a record. She then uses Bob\'s open key to encode this digitally marked record. Weave utilizes his private key to unscramble the archive. The outcome is Alice\'s digitally marked record. Bounce uses Alice\'s open key to check Alice\'s advanced mark.

Slide 14

Historical Background 1976: W. Diffie and M.E. Hellman proposed the main open key encryption calculations - really a calculation for open trade of a mystery key. 1978: L.M Adleman, R.L. Rivest and A. Shamir propose the RSA encryption technique Currently the most generally utilized Basis for the spreadsheet utilized as a part of the lab

Slide 15

The RSA Encryption Algorithm Use an irregular procedure to choose two huge prime numbers P and Q . Register the item M = P*Q . This number is known as the modulus , and is made freely accessible. RSA right now prescribes a modulus that is no less than 768 bits in length. Additionally process the Euler totient T = (P-1)*(Q-1) . Keep this number (and P and Q ) mystery.

Slide 16

RSA (proceeded with) Randomly pick an open key E that has no components just the same as T = (P-1)*(Q-1) . Register a private key D so that E*D leaves a rest of 1 when separated by T . We say E*D is compatible to 1 modulo T Note that D is anything but difficult to figure just on the off chance that one knows the estimation of T. This is basically the same as knowing the estimations of P and Q.

Slide 17

RSA (proceeded) If N is any number that is not distinct by M , then isolating N E*D by M and taking the rest of the first esteem N . This is a generally profound scientific hypothesis, which we can compose as N E*D mod M = N .) If N is a numeric encoding of a piece of plaintext, the cyphertext is C = N E mod M. At that point C D mod M = ( N E ) D mod M = N E*D mod M = N . Subsequently, we can recuperate the plaintext N with the private key D .

Slide 18

Why RSA Works Multiplying P by Q is simple : the quantity of operations relies on upon the quantity of bits (number of digits) in P and Q. For instance, duplicating two 384-piece numbers takes roughly 384 2 = 147,456 piece operations

Slide 19

Why RSA Works (2) If one knows just M, discovering P and Q is hard : fundamentally, the quantity of operations relies on upon the estimation of M. The most straightforward strategy for considering a 768-piece number takes around 2 384  3.94 10 115 trial divisions. A more advanced techniques takes around 2 85  3.87  10 25 trial divisions. A still more complex strategy takes around 2 41  219,000,000,000 trial divisions

Slide 20

Why RSA Works (3) No-one has found a truly snappy calculation for figuring an extensive number M . Nobody has demonstrated that such a speedy calculation doesn\'t exist (or even that one is probably not going to exist). Dwindle Shor has formulated a quick figuring calculation for a quantum PC , in the event that anybody figures out how to construct one.

View more...