Proving the security of all bits of \(ax+b \mod p\) using list decoding (Q2859730)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Proving the security of all bits of \(ax+b \mod p\) using list decoding |
scientific article; zbMATH DE number 6230177
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proving the security of all bits of \(ax+b \mod p\) using list decoding |
scientific article; zbMATH DE number 6230177 |
Statements
19 November 2013
0 references
hard-core predicate
0 references
list decoding
0 references
one-way function
0 references
bit security
0 references
0.9192884
0 references
0 references
0.84176224
0 references
0.8389074
0 references
0.83349454
0 references
Proving the security of all bits of \(ax+b \mod p\) using list decoding (English)
0 references
