
you
can also encrypt the text bit by bit and decrypt bit by bit
Question 1 (1.5 marks): Asymmetric Security (The RSA algorithm) Consider the last two pairs of tw...
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...
In a RSA cryptosystem, a participant A uses two prime numbers p = 13 and q = 17 to generate her public and private keys. If the public key of A is 35, then the private key of A is 11. Alice wants to encrypt a message to Bob by using the RSA algorithm and using keys in (A) The plaintext = “HI”. Answer: _______________
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 for public key cryptography, very large prime numbers are used so as to make ult for the attackers to find from their product the prime factors. However, for an illustration of the ideas behind the RSA algorithm, you could chooses two small prime numbers 7 and 11, and a public key e 13...
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.
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...
Suppose that you are computing an RSA key pair. (Marks 6) What are ? and ? and ?(?) for an ? = 51? Find a legal RSA public key pair for this ? and ?. How many possible values for ?? are there? In a RSA cryptosystem, a person Renee uses two prime numbers p = 13 and q = 17 to generate her public and private keys. If the public key of Renee is 35, then the...
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.
Write code for RSA encryption package rsa; import java.util.ArrayList; import java.util.Random; import java.util.Scanner; public class RSA { private BigInteger phi; private BigInteger e; private BigInteger d; private BigInteger num; public static void main(String[] args) { Scanner keyboard = new Scanner(System.in); System.out.println("Enter the message you would like to encode, using any ASCII characters: "); String input = keyboard.nextLine(); int[] ASCIIvalues = new int[input.length()]; for (int i = 0; i < input.length(); i++) { ASCIIvalues[i] = input.charAt(i); } String ASCIInumbers...
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...
1. Create an RSA private key 2. Output the key in a text format so that it shows the following: modulus public exponent (e) private exponent (d) the primes (p and q) Send me a file called key.txt with this information. 3. Using openssl's rsautl option encrypt this message to me: "NAME" using the public key that's embedded with the private key above. Attach a file named encrypted.txt that contains the encrypted message. Hint: Copy the text above and put...