A Linear Algebra Attack on the Non-commuting Cryptography Class Based on Matrix Power Function
From MaRDI portal
Publication:2980865
DOI10.1007/978-3-319-54705-3_21zbMath1404.94093OpenAlexW2594051042MaRDI QIDQ2980865
JianWei Jia, Huanguo Zhang, JinHui Liu
Publication date: 5 May 2017
Published in: Information Security and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-54705-3_21
cryptographycryptanalysisasymmetric cipherpost-quantum computational cryptographymatrix power function
Related Items (3)
On the associativity property of MPF over M16 ⋮ Enhanced matrix power function for cryptographic primitive construction ⋮ MPF problem over modified medial semigroup is NP-complete
Cites Work
- Unnamed Item
- Complexity of computation in finite fields
- Extended multivariate public key cryptosystems with secure encryption function
- Long term confidentiality: a survey
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Post-quantum cryptography. 7th international workshop, PQCrypto 2016, Fukuoka, Japan, February 24--26, 2016. Proceedings
- Hardness of k-LWE and Applications in Traitor Tracing
- Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form
- Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
- General Impossibility of Group Homomorphic Encryption in the Quantum World
This page was built for publication: A Linear Algebra Attack on the Non-commuting Cryptography Class Based on Matrix Power Function
