NPU Public Key Encryption And WannaCry Ransomware Cryptography Assignment Find an article that discusses attacks on Public Key encryption. Write a 1 to 2 p

NPU Public Key Encryption And WannaCry Ransomware Cryptography Assignment Find an article that discusses attacks on Public Key encryption. Write a 1 to 2 page paper in which you debate the strength or weakness of same. Be sure to cite your sources.***From the attached documents bellow Cryptography and Network Security:
Principles and Practice
Seventh Edition
Chapter 9
Public Key Cryptography and
RSA
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Table 9.1 Terminology Related to
Asymmetric Encryption
Source: Glossary of Key Information Security Terms, NIST IR 7298 [KISS06]
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Misconceptions Concerning Public-Key
Encryption
• Public-key encryption is more secure from cryptanalysis
than symmetric encryption
• Public-key encryption is a general-purpose technique that
has made symmetric encryption obsolete
• There is a feeling that key distribution is trivial when using
public-key encryption, compared to the cumbersome
handshaking involved with key distribution centers for
symmetric encryption
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Principles of Public-Key Cryptosystems
• The concept of public-key cryptography evolved from an attempt to attack two
of the most difficult problems associated with symmetric encryption:
• Key distribution
– How to have secure communications in general without having to trust a
KDC with your key
• Digital signatures
– How to verify that a message comes intact from the claimed sender
• Whitfield Diffie and Martin Hellman from Stanford University achieved a
breakthrough in 1976 by coming up with a method that addressed both
problems and was radically different from all previous approaches to
cryptography
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Public-Key Cryptosystems (1 of 2)
• A public-key encryption scheme has six ingredients:
• Plaintext
– The readable message or data that is fed into the
algorithm as input
• Encryption algorithm
– Performs various transforma-tions on the plaintext
• Public key
– Used for encryption or decryption
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Public-Key Cryptosystems (2 of 2)
• Private key
– Used for encryption or decryption
• Ciphertext
– The scrambled message produced as output
• Decryption algorithm
– Accepts the ciphertext and the matching key and
produces the original plaintext
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Figure 9.1 Public-Key Cryptography
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Table 9.2
Conventional and Public-Key Encryption
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Figure 9.2 Public-Key Cryptosystem:
Secrecy
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Figure 9.3 Public-Key Cryptosystem:
Authentication
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Figure 9.4 Public-Key Cryptosystem:
Authentication and Secrecy
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Applications for Public-Key Cryptosystems
• Public-key cryptosystems can be classified into three categories:
• Encryption/decryption
– The sender encrypts a message with the recipient’s public key
• Digital signature
– The sender “signs” a message with its private key
• Key exchange
– Two sides cooperate to exchange a session key
• Some algorithms are suitable for all three applications, whereas others
can be used only for one or two
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Table 9.3Applications for Public-Key
Cryptosystems
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Public-Key Requirements (1 of 2)
• Conditions that these algorithms must fulfill:
– It is computationally easy for a party B to generate a pair (publickey PUb, private key PRb)
– It is computationally easy for a sender A, knowing the public key
and the message to be encrypted, to generate the corresponding
ciphertext
– It is computationally easy for the receiver B to decrypt the resulting
ciphertext using the private key to recover the original message
– It is computationally infeasible for an adversary, knowing the
public key, to determine the private key
– It is computationally infeasible for an adversary, knowing the
public key and a ciphertext, to recover the original message
– The two keys can be applied
either
order
Copyrightin
© 2017
Pearson
Education, Inc. All Rights Reserved
Public-Key Requirements (2 of 2)
• Need a trap-door one-way function
– A one-way function is one that maps a domain into a range such that
every function value has a unique inverse, with the condition that the
calculation of the function is easy, whereas the calculation of the inverse
is infeasible
? Y = f(X) easy
? X = f–1(Y) infeasible
• A trap-door one-way function is a family of invertible functions fk, such that
– Y = fk(X) easy, if k and X are known
– X = fk–1(Y) easy, if k and Y are known
– X = fk–1(Y) infeasible, if Y known but k not known
• A practical public-key scheme depends on a suitable trap-door one-way
function
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Public-Key Cryptanalysis
• A public-key encryption scheme is vulnerable to a brute-force attack
– Countermeasure: use large keys
– Key size must be small enough for practical encryption and decryption
– Key sizes that have been proposed result in encryption/decryption speeds
that are too slow for general-purpose use
– Public-key encryption is currently confined to key management and
signature applications
– Another form of attack is to find some way to compute the private key
given the public key
– To date it has not been mathematically proven that this form of attack is
infeasible for a particular public-key algorithm
– Finally, there is a probable-message attack
– This attack can be thwarted
by appending
some
random
bits
Copyright
© 2017 Pearson
Education,
Inc. All Rights Reserved
Rivest-Shamir-Adleman (RSA) Algorithm
• Developed in 1977 at MIT by Ron Rivest, Adi Shamir &
Len Adleman
• Most widely used general-purpose approach to public-key
encryption
• Is a cipher in which the plaintext and ciphertext are
integers between 0 and n – 1 for some n
– A typical size for n is 1024 bits, or 309 decimal digits
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
RSA Algorithm
• RSA makes use of an expression with exponentials
• Plaintext is encrypted in blocks with each block having a binary value less than
some number n
• Encryption and decryption are of the following form, for some plaintext block M
and ciphertext block C
•
C = Me mod n
•
M = Cd mod n = (Me)d mod n = Med mod n
• Both sender and receiver must know the value of n
• The sender knows the value of e, and only the receiver knows the value of d
• This is a public-key encryption algorithm with a public key of PU={e,n} and a
private key of PR={d,n}
Copyright © 2017 Pearson Education, Inc. All Rights Reserved
Algorithm Requirements
• For this algorithm to be satisfactory for public-key
encryption, the following requirements must be met:
1. It is possible to find values of e, d, n
such that Med mod n = M for all M