A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module

DOI10.1007/s10958-013-1397-3zbMath1276.68114OpenAlexW2080117541WikidataQ57100964 ScholiaQ57100964MaRDI QIDQ376132

Sergey I. Nikolenko

Publication date: 4 November 2013

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-013-1397-3

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic theory of languages and automata (68Q70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tilings and submonoids of metabelian groups.
• One way functions and pseudorandom generators
• Average case completeness
• The tale of one-way functions
• A Complete Public-Key Cryptosystem
• Average Case Complete Problems
• Foundations of Cryptography
• Computational Complexity
• On Robust Combiners for Oblivious Transfer and Other Primitives
• The complexity of theorem-proving procedures
• The classical decision problem.

This page was built for publication: A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module