Efficient cryptographic schemes provably as secure as subset sum (Q2563542): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:35, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient cryptographic schemes provably as secure as subset sum |
scientific article |
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
