On complete one-way functions
From MaRDI portal
Publication:734307
DOI10.1134/S0032946009020082zbMATH Open1181.68144OpenAlexW1974639435WikidataQ57101119 ScholiaQ57101119MaRDI QIDQ734307FDOQ734307
Authors: A. A. Kozhevnikov, Sergey Nikolenko 
Publication date: 20 October 2009
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946009020082
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Grammars and rewriting systems (68Q42)
Cites Work
- Title not available (Why is that?)
- An aperiodic set of 13 Wang tiles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational Complexity
- New directions in cryptography
- Foundations of Cryptography
- A variant of a recursively unsolvable problem
- Algorithms for Sat and upper bounds on their complexity
- Average-Case Complexity
- One way functions and pseudorandom generators
- Title not available (Why is that?)
- Title not available (Why is that?)
- The undecidability of the domino problem
- Recursive unsolvability of a problem of Thue
- Average case completeness
- The tale of one-way functions
- A Complete Public-Key Cryptosystem
- Average Case Complete Problems
- Title not available (Why is that?)
- New combinatorial complete one-way functions
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On some variants of Post's correspondence problem
- A small aperiodic set of Wang tiles
- Title not available (Why is that?)
- On the NP-isomorphism problem with respect to random instances
- Matrix Transformation Is Complete for the Average Case
- Distributional Word Problem for Groups
- Title not available (Why is that?)
Cited In (13)
- Generic Case Complexity and One-Way Functions
- Universal construction of a full quantum one-way function
- Title not available (Why is that?)
- On the one-way function candidate proposed by Goldreich
- New combinatorial complete one-way functions
- On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
- Title not available (Why is that?)
- The tale of one-way functions
- Cryptography from one-way communication: on completeness of finite channels
- Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory
- Absolute results concerning one-way functions and their applications
- Title not available (Why is that?)
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module
This page was built for publication: On complete one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734307)
