Black-box models of computation in cryptology. (Q2897218)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6053909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Black-box models of computation in cryptology. |
scientific article; zbMATH DE number 6053909 |
Statements
Black-Box Models of Computation in Cryptology (English)
0 references
10 July 2012
0 references
sequrity problems
0 references
croptosystems based on algebraic structures
0 references
computational hardness
0 references
cryptography
0 references
Diffie-Hellman problem
0 references
discrete logarithm
0 references
factorization
0 references
generic bilinear group
0 references
generic model
0 references
generic reduction
0 references
semi-generic model
0 references
RSA
0 references
Turing machine
0 references
0.845768928527832
0 references
0.8370270729064941
0 references
0.808605968952179
0 references
0.7852619290351868
0 references
