A complete one-way function based on a finite rank free Z-module

DOI10.1007/S10958-013-1397-3MaRDI QIDQ376132zbMATH OpenOpenAlexWikidataFDO

Authors Sergey 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

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

Recommendations

• On complete one-way functions
• scientific article; zbMATH DE number 1088248
• One-way functions and the isomorphism conjecture
• Absolute results concerning one-way functions and their applications
• scientific article; zbMATH DE number 1318516
• New combinatorial complete one-way functions
• scientific article; zbMATH DE number 7310111
• On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups
• On Two-to-One Mappings Over Finite Fields
• Simple constructions from (almost) regular one-way functions

Cites work

• A Complete Public-Key Cryptosystem
• Average Case Complete Problems
• Average case completeness
• Computational Complexity
• Foundations of Cryptography
• scientific article; zbMATH DE number 5081744 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 47903 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1008518 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• On Robust Combiners for Oblivious Transfer and Other Primitives
• One way functions and pseudorandom generators
• The classical decision problem.
• The complexity of theorem-proving procedures
• The tale of one-way functions
• Tilings and submonoids of metabelian groups.

Cited in

(1)

• On constructing possibly one-way functions based on the non-decidability of the endomorphism problem in groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q376132)