|
Login to ask the library to add a book.
|
|
Active Filter Settings
No Active Filters
|
|
|
|
|
first record
| previous record
| next record
| last record
|
full | marc
|
Record 1 of 1
|
|
| |
Total Requests 0 Unsatisfied Requests 0
|
|
You searched IISERK - Author: Motos Izeta, Lorenzo.
|
| Request |
|
|
Call Number
|
518
|
|
Call Number
|
518
|
|
Author
|
Jager, Tibor. author.
|
|
Title
|
Black-Box Models of Computation in Cryptology [electronic resource] / by Tibor Jager.
|
|
Material Info.
|
XII, 86p. online resource.
|
|
Summary Note
|
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 class of algorithms may be seen as support towards the conjecture that the problem is also hard in the classical Turing machine model. Moreover, a lower complexity bound for certain algorithms is a helpful insight for the search for cryptanalytic algorithms. Tibor Jager addresses several fundamental questions concerning algebraic black-box models of computation: Are the generic group model and its variants a reasonable abstraction? What are the limitations of these models? Can we relax these models to bring them closer to the reality?
|
|
Notes
|
Black-Box Models of Computation -- On Black-Box Ring Extraction and Integer Factorization -- On the Analysis of Cryptographic Assumptions in the Generic Ring Model -- The Generic Composite Residuosity Problem -- Semi-Generic Groups and Their Applications.
|
|
ISBN
|
9783834819901
|
|
Subject
|
Mathematics.
|
|
Subject
|
Computer science Mathematics.
|
|
Subject
|
Mathematics.
|
|
Subject
|
Computational Mathematics and Numerical Analysis.
|
|
Added Entry
|
SpringerLink (Online service)
|
|
Date
|
Year, Month, Day:01405141
|
|
Link
|
Online book
|
|
|
|
|
