A novel version of the hidden logarithm problem for post-quantum signature algorithms

DOI10.1016/j.tcs.2022.03.040OpenAlexW4225686347MaRDI QIDQ2140568

Minh Hieu Nguyen, Huy Quang Vu, A. A. Moldovyan, Danh Kim Le Tran, Canh Ngoc Hoang, Nikolay A. Moldovyan

Publication date: 23 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.040

zbMATH Keywords

finite algebranon-commutative algebraassociative multiplicationhidden logarithm problempost-quantum signature algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Another look at ``provable security
• Efficient signature generation by smart cards
• Security arguments for digital signatures and blind signatures
• Post-quantum cryptography. 9th international conference, PQCrypto 2018, Fort Lauderdale, FL, USA, April 9--11, 2018. Proceedings
• Post-quantum signature algorithms based on the hidden discrete logarithm problem
• Cryptographic algorithms on groups and algebras
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A Practical Attack on a Braid Group Based Cryptographic Protocol
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A novel version of the hidden logarithm problem for post-quantum signature algorithms