Use RSA cryptography with public key p = 11 q = 13 and e = 23 to encrypt your unique student number. You need to remove all the consecutive zeros in the middle of the student number, then divide your student number into the blocks of two-digits from left to right. Afterwards, you will need to encrypt the resulted list of | numbers by RSA. For example, the student number 13060009867 becomes the list of [13, 6, 98, 67]. Then you need to directly encrypt the numbers 13, 6 , 98 and 67 by RSA.

Use RSA cryptography with public key p = 11 q = 13 and e = 23 to encrypt your unique student number. You need to remove all the consecutive zeros in the middle of the student number, then divide your student number into the blocks of two-digits from left to right. Afterwards, you will need to encrypt the resulted list of | numbers by RSA. For example, the student number 13060009867 becomes the list of [13, 6, 98, 67]. Then you need to directly encrypt the numbers 13, 6 , 98 and 67 by RSA.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Using C programming language: A Transposition Cipher A very simple transposition cipher encrypt(S, N) can be described by the following rules: If the length of S is 1 or 2, then encrypt(S, N) is S. If S is a string of N characters s1 s2 s3... sN and k = N/2, then encrypt(S)= encrypt(sk sk−1... s2 s1 ,K)+ encrypt(sN sN−1... sk+1 ,N - K) where + indicates string concatenation. For example, encrypt("Ok", 2) = "Ok" and encrypt("12345678", 8) = "34127856". Write a program to implement this cipher. The input is a file that is guaranteed to have less then 2048 characters. Code structure might look like this: #define MAX_SIZE 2048char text_buffer[MAX_SIZE];int main(){ // read file into text_buffer encrypt(text_buffer, n); // print out text_buffer return 0;}
Suppose you generate the following RSA key pairs: • p = 37199• q = 49031• N = p · q = 1823904169• (p − 1) · (q − 1) = 1823817940• e = 65537 (for encryption)• d = 1578812933 (for decrption)Assuming a=01, b=02, . . . , z=26, and we group the digits in groups of three. (i) If someone wants to send the following message: “SELLALL” using your public key, what strings of digits should they send you (i.e., encrypt this message)?
Substitution ciphers are encryption/decryption algorithms that replace one letter or number with another. The first attested use of a substitution cipher in military affairs was by Julius Caesar, described by him in Gallic Wars (cf. Kahn pp83-84). In caesar cipher , you replace each letter by 3rd letter on. If it is out of bound (later than Z), then round to the head (letter A) and continue the shift. For example:meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB Please write a program in Java to implement the Caesar Cipher: a. Implement the encryption algorithm. Ask the user to input one all lower case normal sentence (called plaintext) using the nextLine method, and then output the encrypted text (called ciphertext). b. Implement the decryption algorithm. Ask the user to input one encrypted sentence (i.e. ciphertext) using the nextLine method, and then output the decrypted text (i.e. plaintext).
In cryptography, a Caesar cipher is a very simple encryption techniques in which each letter in the plain text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 3, A would be replaced by D, B would become E, and so on. The method is named after Julius Caesar, who used it to communicate with his generals. ROT-13 (“rotate by 13 places”) is a widely used example of a Caesar cipher where the shift is 13. In Python, the key for ROT-13 may be represented by means of the following dictionary: key = {‘a’:’n’, ‘b’:’o’, ‘c’:’p’, ‘d’:’q’, ‘e’:’r’, ‘f’:’s’, ‘g’:’t’, ‘h’:’u’,‘i’:’v’, ‘j’:’w’, ‘k’:’x’, ‘l’:’y’, ‘m’:’z’, ‘n’:’a’, ‘o’:’b’, ‘p’:’c’,‘q’:’d’, ‘r’:’e’, ‘s’:’f’, ‘t’:’g’, ‘u’:’h’, ‘v’:’i’, ‘w’:’j’, ‘x’:’k’,‘y’:’l’, ‘z’:’m’, ‘A’:’N’, ‘B’:’O’, ‘C’:’P’, ‘D’:’Q’, ‘E’:’R’, ‘F’:’S’,‘G’:’T’, ‘H’:’U’, ‘I’:’V’, ‘J’:’W’, ‘K’:’X’, ‘L’:’Y’, ‘M’:’Z’, ‘N’:’A’,‘O’:’B’, ‘P’:’C’, ‘Q’:’D’, ‘R’:’E’, ‘S’:’F’, ‘T’:’G’, ‘U’:’H’, ‘V’:’I’,‘W’:’J’, ‘X’:’K’,…
In cryptography, a Caesar cipher is a very simple encryption techniques in which each letter in the plain text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 3, A would be replaced by D, B would become E, and so on. The method is named after Julius Caesar, who used it to communicate with his generals. ROT-13 (“rotate by 13 places”) is a widely used example of a Caesar cipher where the shift is 13. In Python, the key for ROT-13 may be represented by means of the following dictionary: key = {‘a’:’n’, ‘b’:’o’, ‘c’:’p’, ‘d’:’q’, ‘e’:’r’, ‘f’:’s’, ‘g’:’t’, ‘h’:’u’,‘i’:’v’, ‘j’:’w’, ‘k’:’x’, ‘l’:’y’, ‘m’:’z’, ‘n’:’a’, ‘o’:’b’, ‘p’:’c’,‘q’:’d’, ‘r’:’e’, ‘s’:’f’, ‘t’:’g’, ‘u’:’h’, ‘v’:’i’, ‘w’:’j’, ‘x’:’k’,‘y’:’l’, ‘z’:’m’, ‘A’:’N’, ‘B’:’O’, ‘C’:’P’, ‘D’:’Q’, ‘E’:’R’, ‘F’:’S’,‘G’:’T’, ‘H’:’U’, ‘I’:’V’, ‘J’:’W’, ‘K’:’X’, ‘L’:’Y’, ‘M’:’Z’, ‘N’:’A’,‘O’:’B’, ‘P’:’C’, ‘Q’:’D’, ‘R’:’E’, ‘S’:’F’, ‘T’:’G’, ‘U’:’H’, ‘V’:’I’,‘W’:’J’, ‘X’:’K’,…
Determine the appropriate criteria for a cryptographic hash function h. We can find different data x and y where h(x)=h(y). For a given digest z, it is impossible to reconstruct the data x where h(x) = z. For a given data x where h(x) = z, we can find a data y different from x where h(x)=h(y)= z. For a given data x and a key k, it should be easy to compute h(x) = z using the key k.
Write a program that uses a HashMap to compute a histogram of positivenumbers entered by the user. The HashMap’s key should be the numberthat is entered, and the value should be a counter of the number of timesthe key has been entered so far. Use −1 as a sentinel value to signal theend of user input. For example, if the user inputs:512355321-1then the program should output the following (not necessarily in this order):The number 3 occurs 2 times.The number 5 occurs 3 times.The number 12 occurs 1 times.The number 21 occurs 1 times.
Substitution Cipher is an old technique that substitutes one thing for another. For example, alphabet messages can be ciphered by applying the following substitution. plaintext: abcdefghijklmnopqrstuvwxyz | | V Vciphertext: mnbvcxzasdfghjklpoiuytrewq However, this type of ciphering produces patterns since the same plaintext strings produce the same cipher text. Polyalphabetic Cipher, on the other hand mitigates this problem as plaintext characters are not always replaced with the same cipher text character. The replacement of each character dependson a key as well as on the position of the character in the text; for example, by using a formula such as: for (int i=0; i < length of P; i++) C[i] = P[i] + K + (i mod 3) In essence, if the key, K, is choses as K=10, then 10 is added to characters in position 0, 3, 6, …; and 11 is added for those in…
Suppose you generate the following RSA key pairs:• p = 37199• q = 49031• N = p · q = 1823904169• (p − 1) · (q − 1) = 1823817940• e = 65537 (for encryption)• d = 1578812933 (for decrption)Assuming a=01, b=02, . . . , z=26, and we group the digits in groups of three. (ii) If you receive strings of digits from a sender: 199770170, 1288754980, 324346846, 1370682962, decrypt the message.
Perform a polyalphabetic (Veginere) encryption on the plaintext “MEET ME RIGHT AFTER THIS EXAAM FOR A PARTY” using the keyword “MOSIANO” 2. With the plaintext “THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG EVERY TIME SINCE THE DOG IS SO LAZY AND DOESN’T WANT TO STRETCH OUT”, perform a column matrix encryption using the key K=256413.
Use python language for this task Given an array containing Strings, you need to write a code to store them in a hashtable. Assume that the Strings contain a combination of capital letters and numbers, and the String array will contain no more than 9 values.Use the hash function to be the (total number of consonants*24 + summation of the digits) %9. In case of a collision, use linear probing. For a String “ST1E89B8A32”, it’s hash function will produce the value=(3*24+(1+8+9+8+3+2))%9=4, hence it will be stored in index 4 of the hash table. Note: Hash function calculation, method properly written Linear probing properly implemented
Write a Python program to print a hollow square pattern of stars (*) with a hash (#) symbol at the center of the square. The side length n of the square shall be entered by the user as an odd integer number greater than 4.