Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Theoretical and Applied Cybersecurity

On the usage of postquantum protocols defined in terms of transformation semi- groups and their homomophisms

Vasyl Ustimenko

Published Aug 6, 2020• 3 citations
Publisher

Abstract

We suggest new applications of protocols of Non-commutative cryptography defined in terms of subsemigroups of Affine Cremona Semigroups over finite commutative rings and their homomorphic images to the constructions of possible instruments of Post Quantum Cryptography. This approach allows to define cryptosystems which are not public keys.

DOI
10.20535/tacs.2664-29132020.1.209435

Related papers

Canonical Non-commutative Cryptography

In this chapter, we discuss various cryptographic primitives that use non-commutative (semi)groups as platforms, but at the same time do not depart from the canonical paradigm of a public-key protocol based on a one-way function. We include here the ground-breaking Anshel-Anshel-Goldfeld protocol [1] as well as protocols that are closer in spirit to classical protocols based on commutative (semi)groups.

Birkhäuser Basel eBooks•Nov 3, 2008•0 citations

Quantum Elgamal Cryptosystem

ADITYA AGRAWAL, Bhaskar Biswas, K.K. Shukla +1 more

Public key cryptography is extensively used for encryption, signing contracts and secure exchanges over the unreliable network.The findings of Shor in 1994, of a powerful algorithm which was based on quantum mechanics for computing discrete logarithms and factoring large integers sabotaged the security presumptions upon which the currently used public key cryptographic protocols are based, like ElGamal, RSA and ECC.However, few cryptosystems, known as post quantum cryptosystems, while not currently in wide use are considered to be resistant to such attacks.In this paper, a quantum version of ElGamal Cryptosystem is proposed whose security relies on the commutative rotation transformations and measurements in computational basis of qubits.An understanding of the new scheme over the quantum channels is provided.The proposed cryptosystem allows the party to send messages in the form of qubits over a quantum channel.Also the proposed protocol provides an opportunity for two parties to exchange keys which is considered as one of the major concerns while developing post quantum cryptosystems.

International Conference on Advances in Computing, Control and Networking (ACCN)•Feb 26, 2017•0 citations

Migrating Applications to Post-Quantum Cryptography: Beyond Algorithm Replacement

Alexandre Augusto Giron

Post-Quantum Cryptography (PQC) defines cryptographic algorithms designed to resist the advent of the quan-tum computer. Most public-key cryptosystems today are vulnerable to quantum attackers, so a global-scaletransition to PQC is expected. As a result, several entities foment efforts in PQC standardization, research,development, creation of Work Groups (WGs), and issuing adoption recommendations. However, there isa long road to broad PQC adoption in practice. This position paper motivates ongoing and future researchon this topic. It describes why migrating to PQC is necessary and gathers evidence that the “hybrid mode”can help the migration process. Finally, it stresses that there are risks yet to be considered by the literature.Quantum-safe protocols are being evaluated, but more attention (and awareness) is needed for the softwareand protocols at the application layer. Lastly, this position paper gives further recommendations for a smotherPQC migration

International Conference on Security and Cryptography•Jan 1, 2023•10 citations

A new non-commutative key exchange protocol on combinatorial semigroup

Jing Zhang, Ya‐Juan Yang, JingJing Bao

Since the launch of the post-quantum cryptography standardization project by NIST, post-quantum cryptography has become a prominent research area. Non-commutative cryptography constructed using NP-complete problems is widely regarded resistant to quantum computing attacks, so it has become an important branch of post-quantum cryptography. Nonetheless, the existing non-commutative cryptographic protocol still exhibits certain shortcomings. In this paper, a non-commutative combinatorial semigroup with matrix power function is constructed from a modified medial semigroup by the method of semidirect product, and then a key exchange protocol is developed on it to provide a kind of novel non-commutative cryptographic protocol. Due to the non-commutativity of cryptographic platform, the proposed protocol could perform well in respect of antiquantum computing attack, which is superior to traditional cryptographic protocol. In addition, the security analysis shows that the protocol has significant advantages in resisting algebraic and brute force attacks, as well as aganist quantum cryptanalysis; the complexity analysis demonstrates that computation and storage complexities are of polynomial order, ensuring efficient operation even for large matrix sizes.

Automatika•Oct 2, 2025•0 citations

Applications of Ring Theory in Post-Quantum Cryptography

Dr. Muhammed Basheer

Post-quantum cryptography (PQC) aims to develop cryptographic protocols resistant to attacks by quantum computers, which threaten classical schemes based on integer factorization and discrete logarithm problems. Among various approaches, lattice-based cryptography has emerged as one of the most promising candidates for PQC. Within this domain, ring theory plays a foundational role by providing the algebraic structures—specifically polynomial rings modulo cyclotomic polynomials—used to define hard problems like Ring Learning With Errors (Ring-LWE). These problems underpin efficient and secure cryptographic primitives such as key exchange, encryption, digital signatures, and homomorphic encryption. This paper explores the theoretical background of ring theory relevant to PQC and discusses how it enables the construction of cryptosystems with strong security assumptions and practical efficiency. We also analyze specific schemes that utilize ring-based lattices, including New Hope, NTRUEncrypt, and Dilithium, highlighting the advantages of ring structures in reducing key sizes and improving computational speed. Furthermore, we review the implementation challenges and potential future directions for integrating ring theory into next-generation cryptographic protocols suitable for a post-quantum world.

International Journal for Research in Applied Science and Engineering Technology•Jun 5, 2025•0 citations

Recent Developments in Post-Quantum Cryptography

Tsuyoshi Takagi

The security of current public-key cryptosystems relies on the hardness of factoring large integers or solving discrete logarithm problems. However, these mathematical problems can be solved in polynomial time using a quantum computer. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. In this expository article, we give an overview of recent research on post-quantum cryptography. In particular, we describe the construction and security of multivariate polynomial cryptosystems and lattice-based cryptosystems, which are the main candidates of post-quantum cryptography.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Dec 31, 2017•5 citations
We suggest new applications of protocols of Non-commutative cryptography defined in terms of subsemigroups of Affine Cremona Semigroups over finite commutative rings and their homomorphic images to the constructions of possible instruments of Post Quantum Cryptography. This approach allows to define cryptosystems which are not public keys.
Public key cryptography is extensively used for encryption, signing contracts and secure exchanges over the unreliable network.The findings of Shor in 1994, of a powerful algorithm which was based on quantum mechanics for computing discrete logarithms and factoring large integers sabotaged the security presumptions upon which the currently used public key cryptographic protocols are based, like ElGamal, RSA and ECC.However, few cryptosystems, known as post quantum cryptosystems, while not currently in wide use are considered to be resistant to such attacks.In this paper, a quantum version of ElGamal Cryptosystem is proposed whose security relies on the commutative rotation transformations and measurements in computational basis of qubits.An understanding of the new scheme over the quantum channels is provided.The proposed cryptosystem allows the party to send messages in the form of qubits over a quantum channel.Also the proposed protocol provides an opportunity for two parties to exchange keys which is considered as one of the major concerns while developing post quantum cryptosystems.
Post-Quantum Cryptography (PQC) defines cryptographic algorithms designed to resist the advent of the quan-tum computer. Most public-key cryptosystems today are vulnerable to quantum attackers, so a global-scaletransition to PQC is expected. As a result, several entities foment efforts in PQC standardization, research,development, creation of Work Groups (WGs), and issuing adoption recommendations. However, there isa long road to broad PQC adoption in practice. This position paper motivates ongoing and future researchon this topic. It describes why migrating to PQC is necessary and gathers evidence that the “hybrid mode”can help the migration process. Finally, it stresses that there are risks yet to be considered by the literature.Quantum-safe protocols are being evaluated, but more attention (and awareness) is needed for the softwareand protocols at the application layer. Lastly, this position paper gives further recommendations for a smotherPQC migration
Since the launch of the post-quantum cryptography standardization project by NIST, post-quantum cryptography has become a prominent research area. Non-commutative cryptography constructed using NP-complete problems is widely regarded resistant to quantum computing attacks, so it has become an important branch of post-quantum cryptography. Nonetheless, the existing non-commutative cryptographic protocol still exhibits certain shortcomings. In this paper, a non-commutative combinatorial semigroup with matrix power function is constructed from a modified medial semigroup by the method of semidirect product, and then a key exchange protocol is developed on it to provide a kind of novel non-commutative cryptographic protocol. Due to the non-commutativity of cryptographic platform, the proposed protocol could perform well in respect of antiquantum computing attack, which is superior to traditional cryptographic protocol. In addition, the security analysis shows that the protocol has significant advantages in resisting algebraic and brute force attacks, as well as aganist quantum cryptanalysis; the complexity analysis demonstrates that computation and storage complexities are of polynomial order, ensuring efficient operation even for large matrix sizes.
Post-quantum cryptography (PQC) aims to develop cryptographic protocols resistant to attacks by quantum computers, which threaten classical schemes based on integer factorization and discrete logarithm problems. Among various approaches, lattice-based cryptography has emerged as one of the most promising candidates for PQC. Within this domain, ring theory plays a foundational role by providing the algebraic structures—specifically polynomial rings modulo cyclotomic polynomials—used to define hard problems like Ring Learning With Errors (Ring-LWE). These problems underpin efficient and secure cryptographic primitives such as key exchange, encryption, digital signatures, and homomorphic encryption. This paper explores the theoretical background of ring theory relevant to PQC and discusses how it enables the construction of cryptosystems with strong security assumptions and practical efficiency. We also analyze specific schemes that utilize ring-based lattices, including New Hope, NTRUEncrypt, and Dilithium, highlighting the advantages of ring structures in reducing key sizes and improving computational speed. Furthermore, we review the implementation challenges and potential future directions for integrating ring theory into next-generation cryptographic protocols suitable for a post-quantum world.
The security of current public-key cryptosystems relies on the hardness of factoring large integers or solving discrete logarithm problems. However, these mathematical problems can be solved in polynomial time using a quantum computer. This vulnerability has prompted research into post-quantum cryptography using alternative mathematical problems that are secure in the era of quantum computers. In this regard, the National Institute of Standards and Technology (NIST) began to standardize post-quantum cryptography in 2016. In this expository article, we give an overview of recent research on post-quantum cryptography. In particular, we describe the construction and security of multivariate polynomial cryptosystems and lattice-based cryptosystems, which are the main candidates of post-quantum cryptography.