Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Black-Box Models of Computation
verfasst von : Tibor Jager
Erschienen in: Black-Box Models of Computation in Cryptology
Verlag: Vieweg+Teubner Verlag
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Several abstract models of computation have been proposed in the literature to capture the notion of “generic groups” or their extensions [BS84, Nec94, Sho97, Mau05]. The black-box model we are going to describe in the sequel is a generalization of the model introduced by Maurer in [Mau05], which in turn can be seen as a generalization of the model of [Sho97]. While Maurer's model captures only the case where a generic algorithm operates on elements of a
single
algebraic structure, like a group or a ring, we extend this model in order to be able to describe settings where more than one algebraic structure is considered, as in pairing-based cryptography [DBS04], for instance.