Advertisement
Published in:
2012 | OriginalPaper | Chapter
Black-Box Models of Computation
Author : Tibor Jager
Published in: Black-Box Models of Computation in Cryptology
Publisher: Vieweg+Teubner Verlag
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.