Efficient cryptographic schemes provably as secure as subset sum (Q2563542)
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 958171
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient cryptographic schemes provably as secure as subset sum |
scientific article; zbMATH DE number 958171 |
Statements
Efficient cryptographic schemes provably as secure as subset sum (English)
0 references
26 January 1997
0 references
pseudorandom generator
0 references
hash function
0 references
subset-sum problem
0 references
encryption
0 references
signature schemes
0 references
0.8268412351608276
0 references
0.8173863887786865
0 references
0.7859160900115967
0 references
