Black-Box Models of Computation in Cryptology

Black-Box Models of Computation in Cryptology

Generic group algorithms solve computational problems defined over algebraic groups without exploiting properties of a particular representation of group elements. This is modeled by treating the group as a black-box. The fact that a computational problem cannot be solved by a reasonably restricted...

Full description

Bibliographic Details
Main Author: Jager, Tibor (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Wiesbaden : Vieweg+Teubner Verlag, 2012.
Subjects:
Mathematics.
Computer mathematics.
Computational Mathematics and Numerical Analysis.
Online Access:Full Text via HEAL-Link

Internet

Full Text via HEAL-Link

ΒΚΠ - Πατρα: ALFd

Holdings details from ΒΚΠ - Πατρα: ALFd
Call Number: 330.01 BAU
Copy 1 Available

ΒΚΠ - Πατρα: BSC

Holdings details from ΒΚΠ - Πατρα: BSC
Call Number: 330.01 BAU
Copy 2 Available
Copy 3 Available

Similar Items