Reputation
Top tag
Next privilege 50 Rep.
Comment everywhere
Badges
3
Impact
~377 people reached

  • 0 posts edited
  • 0 helpful flags
  • 0 votes cast
Sep
24
awarded  Autobiographer
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