MPF problem over modified medial semigroup is NP-complete
From MaRDI portal
Publication:2333870
DOI10.3390/sym10110571zbMath1423.94099OpenAlexW2899082768MaRDI QIDQ2333870
Aleksejus Mihalkovich, Eligijus Sakalauskas
Publication date: 13 November 2019
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym10110571
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structure identification in relational data
- Improved asymmetric cipher based on matrix power function with provable security
- Enhanced matrix power function for cryptographic primitive construction
- On medial semigroups
- A Linear Algebra Attack on the Non-commuting Cryptography Class Based on Matrix Power Function
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- New Asymmetric Cipher of Non-Commuting Cryptography Class Based on Matrix Power Function
- The complexity of satisfiability problems
This page was built for publication: MPF problem over modified medial semigroup is NP-complete