Public key distribution in matrix rings

Public key distribution in matrix rings

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

An extension of the Diffie-Hellman public key distribution system to matrix rings is described. Using rings of non-singular matrices over Z/pZ and upper triangular matrices with invertible elements along the diagonal over Z/pZ, it is shown that the number of possible secret keys is much greater for a given prime p compared to the original system. An outline of a method to construct the base matrix used in the system is given.


    1. 1)
      • W. Diffie , M.E. Hellman . New directions in cryptography. IEEE Trans. , 644 - 654
    2. 2)
      • `Data Encryption Standard', , January 1977, National Bureau of Standards.
    3. 3)
      • S.G. Pohlig , M.E. Hellman . An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. , 106 - 110

Related content

This is a required field
Please enter a valid email address