• Keine Ergebnisse gefunden

Martin Finn-Sell

N/A
N/A
Protected

Academic year: 2022

Aktie "Martin Finn-Sell"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Topics in Algebra: Cryptography - Blatt 5

11.30-12:15, Seminarraum 9, Oskar-Morgenstern-Platz 1, 2.Stock

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

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. 1. What if in the argument showing that the Existential forgery is always pos- sible we first choose an arbitraryxand then compute the corresponding signaturey?

2. Assume that the hash function is not collision-resistant. Is an Existential forgery using a known message attack possible?

Question 2. Why is the ElGamal signature scheme not just the use of the ElGamal cryp- tosysytem in the DSS? Compare with the RSA signature scheme.

Question 3. Does the ElGamal Signature scheme provide the authentication? Compare to the ECDSA.

2 Exercises

Question 4. Is a collision-resistant hash function always a one way function?

Question 5. Letrbe a random number used in the ElGamal Signature scheme.

1. Could we forge the signature ifris made public?

2. Could we forge the signature if we use samerto sign two different messages?

3. In the case of a positive answer, make precise the type of forgery.

Question 6. Under the ECDSA, show that a signature will be accepted by the verifier (i.e. that the verification step is correct).

1

Referenzen

ÄHNLICHE DOKUMENTE

What is the length (=number of intermediate hash values) of a verification path in the Merkle tree having n transations.. What is it for a k-ary tree with

Show that the matrix obtained from the linear equations of the Linear Feedback Shift register is invertible mod 2.

The operator ∆ encodes what happens to neighbours - if we feed into this the charac- teristic functions of subsets of vertices with size less than | V (X)/2 |, we can connect

What is the length (=number of intermediate hash values) of a verification path in the Merkle tree having n transations? What is it for a k-ary tree with n leaves?. Question 18. Why

Representation Theory of Groups - Blatt 6. 11:30-12:15, Seminarraum 9, Oskar-Morgenstern-Platz

This exists, and has the property that it is left invariant and unique up to a scalar function (we will not prove existence or uniqueness, but you can use them).

It is known that weak containment of the trivial representation in π is related to the spectrum of π(µ). We will consider an example that shows negative behaviour in

Show that every module over kG is projective if and only if char(k) does not divide the order of the group