Solving the Cryptology Problem
Employer
[no-member:pro]Кристина[/no-member:pro]
Project parameters
Type of cooperationOne-time project
SectionEducation and consulting
Prepaymentprepayment is possible
Payment methodsBank transfer, Electronic money
Acceptance of requestsfrom 2019-07-13 until 2019-07-14
Project description
We need a detailed solution. You can either one block or one block:
(1) If in rsa n = pq, for any message m we have: m^ed ⁇ m mod n, then ed ⁇ 1 mod NOC(p−1; q−1)
(2) How, knowing two residues b; c modulus n, such that, b Uneven ±c mod n
And b^2 = c^2 mod n can find the decomposition of n into multipliers.
(3) Find factorization n, which in the Rabin-Miller test was composite, although for a specific a, we determined a^(2^(k)*r) HE ⁇ ±1, a^(2^(k+1)*r) ⁇ 1 mod n.
(1) If in rsa n = pq, for any message m we have: m^ed ⁇ m mod n, then ed ⁇ 1 mod NOC(p−1; q−1)
(2) How, knowing two residues b; c modulus n, such that, b Uneven ±c mod n
And b^2 = c^2 mod n can find the decomposition of n into multipliers.
(3) Find factorization n, which in the Rabin-Miller test was composite, although for a specific a, we determined a^(2^(k)*r) HE ⁇ ±1, a^(2^(k+1)*r) ⁇ 1 mod n.
