HomeworkLib
Question
just need help with part c
key and public key cryptography methods 2. (a) Explain the difference between the symmetric (b) In the famou s RSA algorithm
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

The answers for your question given below. If any doubts let me know.

(e, n ) (13,7 7) C5mod 77 13 (5*. 5 53 mod 77 x 5 mod 77 a 304 x 304x5) mod 77 a304 modt 77 304 mod 77 X 5 mod 77

ciphertext of plaintext 5 is 26

dacryehon MこCa mod n Hee C 5 37 (513X 54s) mod 71 53 med 771 53 mod 77 X53 mod 77 x5mod 77 ) mod 77 sr ) 二47

plaintext of ciphertext 5 is 47

0 0
Add a comment
Know the answer?
Add Answer to:
just need help with part c key and public key cryptography methods 2. (a) Explain the...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 1. (a) Explain the terms “data encryption, authentication, and message integrity,” often used in the networks...

    1. (a) Explain the terms “data encryption, authentication, and message integrity,” often used in the networks security literature. (3 Points) (b) Lorenzo likes to send to his close friend Art a secret market data related to their business using public key cryptography (RSA algorithm). He chooses two prime numbers 7 and 11, and a public key e = 13 to encrypt the data. Art uses d=37 to decrypt the data. Indicate why (e, 77) and (d, 77) are valid public...

  • RSA (Rivest–Shamir–Adleman) is an algorithm used by modern computers to encrypt and decrypt messages. It is an asymmetric cryptographic algorithm. Asymmetric means that there are two different keys. T...

    RSA (Rivest–Shamir–Adleman) is an algorithm used by modern computers to encrypt and decrypt messages. It is an asymmetric cryptographic algorithm. Asymmetric means that there are two different keys. This is also called public key cryptography, because one of the keys can be given to anyone. The other key must be kept private. The algorithm is based on the fact that finding the factors of a large composite number is difficult: when the integers are prime numbers, the problem is called...

  • Question 1 (1.5 marks): Asymmetric Security (The RSA algorithm) Consider the last two pairs of tw...

    Question 1 (1.5 marks): Asymmetric Security (The RSA algorithm) Consider the last two pairs of two digits of your student ID. Select two prime numbers that are http://en.wikipedia.org/wiki/List of prime numbers#The first 500 prime numbers For example: Student ID 9001346 -1346 The closest prime number to 13 is itself 13 and the closest prime number to 46 is 47. a. Assuming that these two prime numbers are the variables P and Q, determine the private and public keys used by...

  • The Diffie-Hellman public-key encryption algorithm is an alternative key exchange algorithm that is used by protocols...

    The Diffie-Hellman public-key encryption algorithm is an alternative key exchange algorithm that is used by protocols such as IPSec for communicating parties to agree on a shared key. The DH algorithm makes use of a large prime number p and another large number, g that is less than p. Both p and g are made public (so that an attacker would know them). In DH, Alice and Bob each independently choose secret keys, ?? and ??, respectively. Alice then computes...

  • Bob is trying to send an encrypted message to Alice using the Asymmetric Key approach. Which...

    Bob is trying to send an encrypted message to Alice using the Asymmetric Key approach. Which key will Bob use to encrypt the message for Alice? Alice's Private Key Bob's Public Key Alice's Public Key Bob's Private Key Alice wants to digitally sign a message so that Bob can be assured that the message came from Alice and has not been changed in transit. Which key must Alice use to encrypt the message digest? Bob's Public Key Bob's Private Key...

  • prime factorization. Assume that zoy wants to send a message to sam. sam generates public and...

    prime factorization. Assume that zoy wants to send a message to sam. sam generates public and private keys using RSA Encryption algorithm and publishes the public key (n=4717, e=19). zoy has a secret message M to send. Nobody knows the value of M. She encrypts the message M using the public key and sends the encrypted message C=1466 to sam. alex is an intruder who knows RSA and prime factorization well. She captures the encrypted message C=1466. She also has...

  • If we choose two prime numbers p=13 and q=17 in RSA (Rivest-Shamir-Adelman) algorithm, and choose Public...

    If we choose two prime numbers p=13 and q=17 in RSA (Rivest-Shamir-Adelman) algorithm, and choose Public Key = (p x q, e) = (221,5), (a) Show the result and procedures to generate Private Key. (b) Show the procedures using the Public Key and the Private Key found in step (a) to encrypt a message M (Assume M=25); and to decrypt for obtaining the message.

  • in c++ The science of writing secret codes is called cryptography. For thousands of years cryptography...

    in c++ The science of writing secret codes is called cryptography. For thousands of years cryptography has made secret messages that only the sender and recipient could read, even if someone captured the messenger and read the coded message. A secret code system is called a cipher. In cryptography, we call the message that we want to be secret the plaintext. The plaintext could look like this:  Hello there! The keys to the house are hidden under the flower pot. Converting...

  • Consider the RSA algorithm. Let the two prime numbers, p=11 and q=41. You need to derive appropriate public key (e,n) and private key (d,n). Can we pick e=5? If yes, what will be the corresponding (d...

    Consider the RSA algorithm. Let the two prime numbers, p=11 and q=41. You need to derive appropriate public key (e,n) and private key (d,n). Can we pick e=5? If yes, what will be the corresponding (d,n)? Can we pick e=17? If yes, what will be the corresponding (d,n)? (Calculation Reference is given in appendix) Use e=17, how to encrypt the number 3? You do not need to provide the encrypted value.

  • // can someone explain the code line by line shortly.thanks import java.security.KeyPair; import ...

    // can someone explain the code line by line shortly.thanks import java.security.KeyPair; import java.security.KeyPairGenerator; import java.security.PrivateKey; import java.security.PublicKey; import java.util.Base64; import java.util.HashMap; import java.util.Map; import javax.crypto.Cipher; // Java 8 example for RSA encryption/decryption. // Uses strong encryption with 2048 key size. public class GlobalMembers { public static void main(String[] args) throws Exception { String plainText = "Hello World!"; // Generate public and private keys using RSA Map<String, Object> keys = getRSAKeys(); PrivateKey privateKey = (PrivateKey) keys.get("private"); PublicKey publicKey = (PublicKey)...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT