We use matrices over bit strings as platforms for Diffie-Hellman-like public key exchange protocols. When multiplying matrices like that, we use Boolean OR operation on bit strings in place of addition and Boolean AND operation in place of multiplication. As a result, (1) computations with these matrices are very efficient; (2) standard methods of attacking Diffie-Hellman-like protocols are not applicable
A generalization of the original Diffie-Hellman key exchange in (Z/pZ)∗ found a new depth when Mille...
We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm p...
We cryptanalyse a matrix-based key transport protocol due to Baumslag, Camps, Fine, Rosenberger and ...
All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman...
We offer a public key exchange protocol in the spirit of Diffie-Hellman, but we use (small) matrices...
Title: Diffie and Hellman are exchanging matrices over group rings Author: Romana Linkeová Departmen...
Abstract. We offer a public key exchange protocol in the spirit of Diffie-Hellman, but we use (small...
In a recent textbook (1) on the theory of numbers Professor B. M. Stewart suggests the usefulness of...
Abstract:- The aim of this paper is to give the new generation of the sets of matrices, which are is...
Abstract. We extend symbolic protocol analysis to apply to protocols using Diffie-Hellman operations...
A failed hypothesis is reported here. The hope was that large matrices over small non-standard arith...
ISBN : 978-0-8218-4037-5International audienceThe purpose of the paper is to give new key agreement ...
It was recently demonstrated that the Matrix Action Key Exchange (MAKE) algorithm, a new type of key...
We propose a polynomial time quantum algorithm for solving the discrete logarithm problem in matrice...
ElGamal cryptosystem has emerged as one of the most important construction in Public Key Cryptograph...
A generalization of the original Diffie-Hellman key exchange in (Z/pZ)∗ found a new depth when Mille...
We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm p...
We cryptanalyse a matrix-based key transport protocol due to Baumslag, Camps, Fine, Rosenberger and ...
All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman...
We offer a public key exchange protocol in the spirit of Diffie-Hellman, but we use (small) matrices...
Title: Diffie and Hellman are exchanging matrices over group rings Author: Romana Linkeová Departmen...
Abstract. We offer a public key exchange protocol in the spirit of Diffie-Hellman, but we use (small...
In a recent textbook (1) on the theory of numbers Professor B. M. Stewart suggests the usefulness of...
Abstract:- The aim of this paper is to give the new generation of the sets of matrices, which are is...
Abstract. We extend symbolic protocol analysis to apply to protocols using Diffie-Hellman operations...
A failed hypothesis is reported here. The hope was that large matrices over small non-standard arith...
ISBN : 978-0-8218-4037-5International audienceThe purpose of the paper is to give new key agreement ...
It was recently demonstrated that the Matrix Action Key Exchange (MAKE) algorithm, a new type of key...
We propose a polynomial time quantum algorithm for solving the discrete logarithm problem in matrice...
ElGamal cryptosystem has emerged as one of the most important construction in Public Key Cryptograph...
A generalization of the original Diffie-Hellman key exchange in (Z/pZ)∗ found a new depth when Mille...
We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm p...
We cryptanalyse a matrix-based key transport protocol due to Baumslag, Camps, Fine, Rosenberger and ...