On complete one-way functions

DOI10.1134/S0032946009020082zbMath1181.68144OpenAlexW1974639435WikidataQ57101119 ScholiaQ57101119MaRDI QIDQ734307

A. A. Kozhevnikov, Sergey I. 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

zbMATH Keywords

Post correspondence problemsemi-Thue string rewriting systems

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Grammars and rewriting systems (68Q42)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some variants of Post's correspondence problem
• One way functions and pseudorandom generators
• An aperiodic set of 13 Wang tiles
• A small aperiodic set of Wang tiles
• Average case completeness
• On the NP-isomorphism problem with respect to random instances
• The tale of one-way functions
• Algorithms for Sat and upper bounds on their complexity
• Average-Case Complexity
• A Complete Public-Key Cryptosystem
• Average Case Complete Problems
• New directions in cryptography
• Distributional Word Problem for Groups
• Matrix Transformation Is Complete for the Average Case
• Foundations of Cryptography
• Recursive Unsolvability of a problem of Thue
• Computational Complexity
• On Robust Combiners for Oblivious Transfer and Other Primitives
• The undecidability of the domino problem
• A variant of a recursively unsolvable problem

This page was built for publication: On complete one-way functions