Timeline for Introducing Cryptology to Undergraduates
Current License: CC BY-SA 2.5
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2011 at 19:10 | answer | added | none | timeline score: 4 | |
| May 26, 2010 at 4:23 | answer | added | Adrian Barquero-Sanchez | timeline score: 1 | |
| May 26, 2010 at 1:04 | history | edited | B. Bischof | CC BY-SA 2.5 |
added 220 characters in body
|
| May 26, 2010 at 0:00 | comment | added | Victor Miller | I agree with what Felipe says. However, the whole reason for using elliptic curves (as opposed to multiplicative groups) has to do with two things: 1) There are many elliptic curves over a finite field GF(q) whose order can be every number in an interval (there are a few exceptions in the case of non-prime fields). Thus giving lots of chances to avoid the Pohlig-Hellman attack. 2) The direct analogy of a factor base attack by lifting to an elliptic curve over Q (or a number field of reasonable degree) has virtually no chance of working because of height reasons. | |
| May 25, 2010 at 23:51 | answer | added | Victor Protsak | timeline score: 3 | |
| May 25, 2010 at 22:11 | comment | added | Felipe Voloch | One or two lectures may be too few to explain elliptic curves. Better describe Diffie-Hellman for the multiplicative group and perhaps mention that elliptic curves is a different way of constructing groups. | |
| May 25, 2010 at 21:19 | answer | added | Andrey Rekalo | timeline score: 4 | |
| May 25, 2010 at 21:10 | comment | added | Steve Huntsman | This guy would know: mathoverflow.net/users/2784/victor-miller | |
| May 25, 2010 at 20:53 | answer | added | lhf | timeline score: 6 | |
| May 25, 2010 at 20:27 | history | asked | B. Bischof | CC BY-SA 2.5 |