A matricial public key cryptosystem with digital signature

We describe a new public key cryptosystem using block upper triangular matrices with elements in Zp, based on a generalization of the discrete logarithm problem over a finite group. The proposed cryptosystem is very efficient, requiring very few operations and also allows an ElGamal based digital signature scheme. The main benefit is that the security level is higher than other algorithms for the same key size.

[1]  V. Varadharajan,et al.  Public Key distribution in matrix rings , 1984 .

[2]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[3]  By J. M. Pollard.  Monte Carlo Methods for Index Computation (mod p) , 2010 .

[4]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[5]  Daniel M. Gordon,et al.  A Survey of Fast Exponentiation Methods , 1998, J. Algorithms.

[6]  D. Shanks.  Class number, a theory of factorization, and genera , 1971 .

[7]  José-Francisco Vicent,et al.  Secure Communication System over a GSM Network , 2005 .

[8]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[9]  William Stallings,et al.  Cryptography and network security , 1998 .

[10]  Kevin S. Mccurley,et al.  The discrete logarithm problem , 1990 .

[11]  Joan-Josep Climent,et al.  A Pseudorandom Bit Generator Based on Block Upper Triangular Matrices , 2003, ICWE.

[12]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

[13]  Justin M. Reyneri,et al.  Fast Computation of Discrete Logarithms in GF(q) , 1982, CRYPTO.

[14]  Joan-Josep Climent,et al.  Un generador matricial de claves frente a Blum Blum Shub , 2004 .

[15]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[16]  J. Pollard,et al.  Monte Carlo methods for index computation () , 1978 .

[17]  Leandro Tortosa,et al.  An integral security kernel , 2004 .

[18]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[19]  José-Francisco Vicent,et al.  A new public key cryptosystem based on matrices , 2007 .

[20]  José Noguera,et al.  A secure remote database backup system , 2006 .

[21]  José Noguera,et al.  A viability analysis of a secure VoIP and instant messaging system on a Pocket PC platform , 2005 .

[22]  William Stallings,et al.  Cryptography and Network Security: Principles and Practice , 1998 .

[23]  Alfred Menezes,et al.  The Discrete Logarithm Problem in GL(n, q) , 1997, Ars Comb..

[24]  Antonio Zamora,et al.  Silence detection in secure P2P VoIP multiconferencing , 2006 .

[25]  Don Coppersmith,et al.  Discrete logarithms inGF(p) , 2005, Algorithmica.

[26]  Leandro Tortosa,et al.  Fast pseudorandom generator based on packed matrices , 2007 .

[27]  Martin E. Hellman,et al.  An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[28]  N. Koblitz.  A Course in Number Theory and Cryptography , 1987 .

[29]  W. Greub.  Linear Algebra , 1981 .

[30]  Leandro Tortosa,et al.  Lightweight peer-to-peer secure multi-party VoIP protocol , 2006 .

[31]  L. Tortosa,et al.  A Public Key Cryptosystem Based on Block Upper Triangular Matrices , 2005 .