scientific article; zbMATH DE number 7310167
From MaRDI portal
Publication:5150533
zbMath1481.94100MaRDI QIDQ5150533
S. Yu. Erofeev, Vitaliĭ Roman'kov
Publication date: 15 February 2021
Full work available at URL: http://mathnet.ru/eng/pdm374
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Authentication schemes from actions on graphs, groups, or rings
- On complete one-way functions
- Group-based cryptography
- Polynomial-time word problems.
- One way functions and pseudorandom generators
- Generic-case complexity, decision problems in group theory, and random walks.
- Combinatorial group theory and public key cryptography
- The tale of one-way functions
- EQUATIONS IN A FREE GROUP
- Efficient Computation in Groups Via Compression
- Using Decision Problems in Public Key Cryptography
- Universal diophantine equation
- Foundations of Cryptography
- Reduction of an arbitrary diophantine equation to one in 13 unknowns
- Automata, Languages and Programming
This page was built for publication: