| 000 -LEADER |
|---|
| fixed length control field |
02340nam a22003975i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310151500.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
120322s2012 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9783834819901 |
|
978-3-8348-1990-1 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA71-90 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
518 |
| Edition number |
23 |
|
|---|
| Classification number |
518 |
| Edition number |
23 |
| 264 #1 - |
|---|
| -- |
Wiesbaden : |
| -- |
Vieweg+Teubner Verlag, |
| -- |
2012. |
| 912 ## - |
|---|
| -- |
ZDB-2-SMA |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Jager, Tibor. |
| Relator term |
author. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
Black-Box Models of Computation in Cryptology |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc |
by Tibor Jager. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XII, 86p. |
| Other physical details |
online resource. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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? |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Computer science |
| General subdivision |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Computational Mathematics and Numerical Analysis. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Display text |
Printed edition: |
| International Standard Book Number |
9783834819895 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-3-8348-1990-1 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
