In this paper, we present an original algorithm to generate session keys and a subsequent generalized ElGamal-type cryptosystem. The scheme presented here has been designed to prevent both linear and brute force attacks using rectangular matrices and to achieve high complexity. Our algorithm includes a new generalized Diffie-Hellmann scheme based on rectangular matrices and polynomial field operations. Two variants are presented, the first with a double exchange between the parties and the second with a single exchange, thus speeding up the generation of session keys
Akiyama et al. (Int. J. Math. Indust., 2019) proposed a post-quantum key exchange protocol that is b...
A “Post-Quantum Key Exchange ” is needed since the availability of quantum computers that allegedly ...
Post-quantum cryptography (PQC) is a trend that has a deserved NIST status, and which aims to be res...
In 2016, NIST announced an open competition with the goal of finding and standardizing a suitable qu...
Public-key solutions based on number theory, including RSA, ECC, and Diffie-Hellman, are subject to ...
The Diffie–Hellman protocol, ingenious in its simplicity, is still the major solution in protocols f...
The Diffie–Hellman protocol, ingenious in its simplicity, is still the major solution in protocols f...
The Modulo 1 Factoring Problem (M1FP) is an elegant mathematical problem which could be exploited to...
We propose a polynomial time quantum algorithm for solving the discrete logarithm problem in matrice...
The most challenging application of post-quantum cryptography (PQC) is the distribution of provably ...
Progress in quantum technologies forces the development of new cryptographic primitives that are res...
ElGamal cryptosystem has emerged as one of the most important construction in Public Key Cryptograph...
Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols resistant to attacks by mea...
The security of public-key cryptography depends on the computational intractability of some hard pro...
Expanding graphs are known due to their remarkable applications to Computer Science. We are looking ...
Akiyama et al. (Int. J. Math. Indust., 2019) proposed a post-quantum key exchange protocol that is b...
A “Post-Quantum Key Exchange ” is needed since the availability of quantum computers that allegedly ...
Post-quantum cryptography (PQC) is a trend that has a deserved NIST status, and which aims to be res...
In 2016, NIST announced an open competition with the goal of finding and standardizing a suitable qu...
Public-key solutions based on number theory, including RSA, ECC, and Diffie-Hellman, are subject to ...
The Diffie–Hellman protocol, ingenious in its simplicity, is still the major solution in protocols f...
The Diffie–Hellman protocol, ingenious in its simplicity, is still the major solution in protocols f...
The Modulo 1 Factoring Problem (M1FP) is an elegant mathematical problem which could be exploited to...
We propose a polynomial time quantum algorithm for solving the discrete logarithm problem in matrice...
The most challenging application of post-quantum cryptography (PQC) is the distribution of provably ...
Progress in quantum technologies forces the development of new cryptographic primitives that are res...
ElGamal cryptosystem has emerged as one of the most important construction in Public Key Cryptograph...
Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols resistant to attacks by mea...
The security of public-key cryptography depends on the computational intractability of some hard pro...
Expanding graphs are known due to their remarkable applications to Computer Science. We are looking ...
Akiyama et al. (Int. J. Math. Indust., 2019) proposed a post-quantum key exchange protocol that is b...
A “Post-Quantum Key Exchange ” is needed since the availability of quantum computers that allegedly ...
Post-quantum cryptography (PQC) is a trend that has a deserved NIST status, and which aims to be res...