• Keine Ergebnisse gefunden

Martin Finn-Sell

N/A
N/A
Protected

Academic year: 2022

Aktie "Martin Finn-Sell"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Topics in Algebra: Cryptography - Blatt 2

http://www.mat.univie.ac.at/~gagt/crypto2019

Goulnara Arzhantseva

goulnara.arzhantseva@univie.ac.at

Martin Finn-Sell

martin.finn-sell@univie.ac.at

1 Test questions from the lecture to refresh:

Question 1. What is the complexity of the RSA parameter generation?

Question 2. Letfbe a one-way function. Isf◦fnecessarily a one-way function?

Question 3. What is the worst case / average case complexities of trial division?

Question 4. Design an algorithm for computing the square root of an integer. What about its complexity? What about its modular variant and its complexity?

Question 5. Which of the following statements are true?

1. If the RSA cryptosystem is breakable, then large numbers can be factored;

2. Breaking the ECC cryptosystem is equivalent to solving the discrete logarithm problem;

3. There is no message expansion in the ECC cryptosystem.

Question 6. Why in practice public-key cryptosystems have longer key lengths than symmet- ric cryptosystems?

2 Exercises

Question 7. Solve the discrete logarithm problem in (Z/nZ,+), where n ∈ N. What is the complexity?

Question 8. A plaintextxis said to befixedifeK(x) =x. Show that, forK=RSA, the number of possible fixedx∈Z×n is equal to:

gcd(b−1, p−1)gcd(b−1, q−1).

1

(2)

Question 9. Find and describe the steps of Shanks algorithm, then computelog520inZ×47. Question 10. Interpret the function h : Z → Zn, whereh(x) = xmodnas a function on binary strings. Is this function a reasonable one way or hash function?

Question 11. Show that the functiony2=x3+2x−2is an elliptic curve for some field.

3 Optional computer exercises

An exercise here is not mathematically harder than the above, but the numbers are too large and they are and best solved by computer:

Question 12. Find, describe and implement the steps of Shanks algorithm, and use it to com- putelog10612357inZ×24691.

Question 13. LetEbe the elliptic curvey2 =x3+x+28defined overZ71. a) Determine the number of points inE;

b) Show thatEis not a cyclic group;

c) What is the maximal order of an element inE? Exhibit an element with that order inE.

2

Referenzen

ÄHNLICHE DOKUMENTE

At local nodes, the maintenance operations are implemented within control loops and the control loops decisions (e.g. forwarding of control information) depend on the control

Question 4. Design an algorithm for computing the square root of an integer. What about its complexity? What about its modular variant and its complexity?. Question 5. Which of

He deserves to be praised by a grateful present and posterity as the man who first liberated mankind from immaturity (as far as government is concerned), and who left all men free

• 1/6/2011 – The institution in country A makes an award and advises the pensioner of its decision (it also advises the other institutions involved).. • 1/8/2011 –

The S2 form allows a person insured in an EU country ( 1 ) to prove their entitlement to planned (or “scheduled”) health treatment in another EU country.. If you go to another

In order to register for treatment in the country of the last activity as a cross-border worker (or his/her family member), you should obtain the form S3 from the competent

For Spain, Sweden and Portugal, the form must be handed over to the head provincial offices of social security National Institute (Spain), the social insurance institution

Notably, when defining communicative complexity, most empirical tests of the SCHCC focus on a single modality (e.g., acoustic, visual, olfactory) whereas several good