Jump to content

Generic group model

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Markulf (talk | contribs) at 18:10, 29 June 2009. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The generic group model [1] [2] is an idealised cryptographic model, where the adversary is only given access to a randomly chosen encoding of a group, instead of the the finite field or elliptic curve groups used in practice.


References

  1. ^ Victor Shoup (1997). "Lower bounds for discrete logarithms and related problems" (pdf). Lecture Notes in Computer Science. Advances in Cryptology – Eurocrypt ’97. Vol. 1233. Springer-Verlag. pp. 256–266. Retrieved 2007-11-01. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
  2. ^ Ueli Maurer (2005). "Abstract models of computation in cryptography" (pdf). Lecture Notes in Computer Science. 10th IMA Conference On Cryptography and Coding. Vol. 2796. Springer-Verlag. pp. 1–12. Retrieved 2007-11-01. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

See also

Stub icon

This cryptography-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Generic_group_model&oldid=299353773"