10.) Consider (Zn; n), the set Zn with mod n
multiplication.
i. Argue that if neither a nor b has any common divisors greater
than 1
with n then neither does ab. [Equivalently gcd(a; n) = 1,
etc.]
ii. Argue that if a does not have any common divisors greater than
1
with n, then [a]n has a multiplicative inverse in Zn.
iii. Argue that (i) and (ii) imply that the set of elements
f[a]n 2 Znjgcd(a; n) = 1g with mod n multiplication is a
group.
10.) Consider (Zn; n), the set Zn with mod n multiplication. i. Argue that if neither...
Problem 68. Define for any 2 n є N, the set U(n)-(x| 1 x n and gcd(z, n-1} For example U(12) 1,5,7,11 Further, define n to be multiplication modulo n. For example 9 10 90 (mod 8) 2. i. Show that o is a binary operation on U/). Hint: Use the lemma from Problem 3 on your take-home exam.) ii. Pick a є N. Prove that a: 1 (mod n) has a solution (some number z є U(n)) if and...
( i need Unique answer, don't copy and paste, please) Let N be an n-bit positive integer, and let a, b, c, and k be positive integers less than N. Assume that the multiplicative inverse (mod N) of a is a^(k-1) Give an O(n^3) algorithm for computing a^(b^c) mod N (i.e., a raised to the power b^c with the result taken mod N). Any solution that requires computing b^c is so inefficient that it will receive no credit.
1 1 point Consider the following algorithm for factoring an integer N provided as input (in binary): For i = 2 to [VN.17 i divides N, then output (i, N/). Which of the following statements is true? This algorithm is correct, but it runs in exponential time. This algorithm is not correct, because it will sometimes fail to find a factorization of Neven if N is composite This algorithm runs in sub-linear time, and always factors N it Nis composite...
Let R be a commutative ring with no nonzero zero divisor and elements r1,r2,.. . ,Tn where n is a positive integer and n 2. In this problem you will sketch a proof that R is a field (a) We first show that R has a multiplicative identity. Sinee the additive identity of R is, there is a nonzero a E R. Consider the elements ari, ar2, ..., arn. These are distinct. To see O. Since R conelude that0, which...
probelms 9.1 9 Modular arithmetic Definition 9.1 Let S be a set. A relation R = R(,y) on S is a statement about pairs (x,y) of elements of S. For r,y ES, I is related to y notation: Ry) if R(x,y) is true. A relation Ris: Reflexive if for any I ES, R. Symmetric if for any ry ES, Ry implies y Rr. Transitive if for any r.y.ES, Ry and yRimply R. An equivalence relation is a reflexive, symmetric and...
1- (2,5+2,5 mark) Consider in GL(2, Q), the subset (a=1 or a=-1),bez Prove that H, with multiplication, is a subgroup of GL(2,Q) a) Is the function b) an homomorphism of groups? Justify your answer 2 (3 marks) Let G be a group and a E G an element of order 12. Find the orders of each of the elements of (a) 3- (1+1,5 marks) Let G be a group such that any non-identity element has order 2. Prove that a)...
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...
Q-1: Write a program in Assembly language using MIPS instruction set that reads 15 integer numbers from user and stores all the numbers in the array intArray. Now, read another integer number N from the user, find the total number of array elements that are greater or equal to the number N, and the total number of array elements that are lower than the number N You must have two procedures: i. ReadIntegerArray: this procedure should read integer array elements...
I need to answer #3 could be done in only one way, we see that if we take the table for G and rename the identity e, the next element listed a, and the last element b, the resulting table for G must be the same as the one we had for G. As explained in Section 3, this renaming gives an isomorphism of the group G' with the group G. Definition 3.7 defined the notion of isomorphism and of...
Answer the following questions for the method intersection () below: public Set intersection (Set s1, Set s2) //Effects: If s1 or s2 is null throw NullPointerException /I else return a (non nul) Set equal to the intersection // of Sets s1 and s2 Characteristic: Validity of s1 -s1 has at least one element Characteristic: Relation between s1 and s2 s1 and s2 represent the same set -$1 is a subset of s2 - s2 is a subset of s1 $1...