Section 16.3

It is interesting that a number with only small factors is smooth and if all are less than B it is B-smooth. This makes a lot of sense in the context of elliptic curves.

It was hard to follow the exact algorithm to factor a number using elliptic curves.

Section 16.2

I easily understood the explanation of elliptic curves mod p and how to solve them by following the example.

However the example given representing some plaintext was overly complicated and i couldn't not follow the result.

Section 16.1

The discussion on elliptic curves was very interesting. I was particularly intrigued by the use of elliptic curves to find a point on the curve using two other points.

I didn't really follow the examples on how to solve an elliptic curve mod p.

Section 2.12

Enigma is a very interesting system. It seems to be the first crypto system that actually uses a machine. It seems incredible that it could have been broken. Since not even the user knows the exact connection between the plain and cipher texts.

It was hard to follow the attack that broke Enigma. I didn't understand what the different letters represented and how the machine could be used to solve the problem.

Shor and 19.3

It was very interesting to read about the way that the period was describe without math. This helps to visualize the real meaning of the algorithm that we use.

It was difficult to follow the explanation of the actual algorithm in the book. Mostly because i did not understand all the notation.

Section 19.1-19.2

It was interesting to read about the "hypothetical" quantum computer. It is incredible that we can study to a certain extent the quantum mechanical phenomena that take place on the atomic level.

It was difficult to understand how quantum bits are much more efficient than binary bits and how to implement their use.

Section 14.1-14.2

It was easy to understand the reasons for zero knowledge techniques because of the illustration of a real life problem in the beginning. The algorithm makes sense when considering the preceding explanation.

However the fiege-fiat-Shamir algorithm is harder to understand and follow.

Section 12.1-12.2

I learned about the tw threshold scheme which requires a certain number of participants to reconstruct the message but no less. This is an interesting approach that allows for some leeway.

However, It was difficult to follow the approach described for the Shamir threshold scheme.

Midterm Review

RSA, Factoring and discrete logs have been the most common of the things we've discussed since the last midterm.

I expect to see RSA, factoring, discrete logs, different ways of solving weak systems, and birthday attacks on the test.

I need to be able to remember how to do a crypto-system and recognize it's name. I also need to review hash functions.

Section 8.3 and 9.5

It was very difficult to follow the technical explanation of the SHA.

It was interesting to learn about the process for creating a digital signature. It is helpful because it is faster than other methods we have studied.

Section 9.1-9.4

It is interesting to recognize the importance and uses of digital signatures. Hash functions make the use of a digital signature even easier, but with the same security.

I don't really understand how a few extra spaces can make a document fraudulent and how the birthday attack affects this scheme.

Section 8.4, 8.5, 8.7

It was interesting to learn about birthday attacks. With so many options for birthdays i had no idea that the odds were so high to have a birthday match up.

It was difficult to understand the steps that are taken to avoid multi-collisions.