The following pages link to The tale of one-way functions (Q2487080):
Displaying 15 items.
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module (Q376132) (← links)
- Cryptographic transformations of non-Shannon sources of information (Q466350) (← links)
- On complete one-way functions (Q734307) (← links)
- Quantum one-way permutation over the finite field of two elements (Q1679363) (← links)
- Circuit complexity of linear functions: gate elimination and feeble security (Q1946842) (← links)
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) (Q2120065) (← links)
- Optimizing Segment Based Document Protection (Q2891390) (← links)
- Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← links)
- Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization (Q3380367) (← links)
- An Infinitely-Often One-Way Function Based on an Average-Case Assumption (Q3511459) (← links)
- An infinitely-often one-way function based on an average-case assumption (Q3586759) (← links)
- An Average Case NP-complete Graph Colouring Problem (Q4962593) (← links)
- (Q5150466) (← links)
- (Q5150533) (← links)
- Infinitely generated semigroups and polynomial complexity (Q5739486) (← links)
