network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 2 months |
| seen | Apr 26 '12 at 19:31 | |
| stats | profile views | 0 |
Math Ph.D. student at the University of Pennsylvania.
|
Apr 26 |
awarded | Scholar |
|
Apr 26 |
accepted | Useful pairings for cryptography |
|
Apr 26 |
comment |
Useful pairings for cryptography Thanks. My question might have been a bit vague, but I was sort of thinking about whether there's some sort of fuzzy classification of such groups where this is assumed to be hard. In other words, what properties the groups should NOT have for the various Diffie-Hellman problems to be assumed difficult. Knowing how little one knows about complexities of hard problems in general, I assume that this is unknown. |
|
Apr 14 |
awarded | Student |
|
Apr 13 |
asked | Useful pairings for cryptography |
