Public key cryptography using matrices

Cryptography – Particular algorithmic function encoding – Public key

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C380S044000, C380S255000, C713S170000, C713S182000, C713S189000

Reexamination Certificate

active

07346162

ABSTRACT:
The invention provides techniques for secure messages transmission using a public key system to exchange secret keys. A first entity creates public and private keys by generating a product n of two large, randomly chosen prime numbers, and then generating random matrices {A, C}, in the group GL(r,Zn) with a chosen matrix rank r such that AC is not equal to CA, and then generating a matrix B=CAC, and finding a matrix G that commutes with C. Matrices A, B, G and the integers n and r are then published as the public key and matrix C is then kept as the private key. A second entity then obtains the public key and calculates a secret matrix D that commutes with G, and further calculates the matrices K=DBD and E=DAD. The message to be sent is then encrypted using matrix K as the secret key and then sent to the first entity with matrix E. First entity then retrieves secret matrix K using K=CEC and then decrypts the received encrypted message using the retrieved secret matrix K.

REFERENCES:
patent: 3657476 (1972-04-01), Aiken
patent: 4218582 (1980-08-01), Hellman et al.
patent: 4405829 (1983-09-01), Rivest et al.
patent: 4658094 (1987-04-01), Clark
patent: 4891781 (1990-01-01), Omura
patent: 4972474 (1990-11-01), Sabin
patent: 5210710 (1993-05-01), Omura
patent: 5289397 (1994-02-01), Clark et al.
patent: 5577209 (1996-11-01), Boyle et al.
patent: 5692124 (1997-11-01), Holden et al.
patent: 5802178 (1998-09-01), Holden et al.
patent: 5828832 (1998-10-01), Holden et al.
patent: 5832228 (1998-11-01), Holden et al.
patent: 5940591 (1999-08-01), Boyle et al.
patent: 5956407 (1999-09-01), Slavin
patent: 5974151 (1999-10-01), Slavin
patent: 6067620 (2000-05-01), Holden et al.
patent: 6081597 (2000-06-01), Hoffstein et al.
patent: 6272538 (2001-08-01), Holden et al.
patent: 6272639 (2001-08-01), Holden et al.
patent: 6298137 (2001-10-01), Hoffstein et al.
patent: 6442600 (2002-08-01), Anderson
patent: 6459791 (2002-10-01), M'Raihi et al.
patent: 6493449 (2002-12-01), Anshel et al.
patent: 6643698 (2003-11-01), Holden et al.
patent: 6956947 (2005-10-01), Benaloh
patent: 6986045 (2006-01-01), Campagna
patent: 7136484 (2006-11-01), Koh
Flannery et al, “In Code: A mathematical Journey—Appendix A”, Workman Publishing, 2001, pp. 271-296.
Hughes, James, “A linear Algebraic Attack on the AAFGI Braid Group Cryptosystem”, Springer, 2002, pp. 176-189.
Rocha et al, “Cryptanalysis of Krouk's Public- Key Cipher”, Electronics Letters, Jul. 1996, pp. 1279-1280.
Flannery, et al., “In Code: A Mathematical Journey—Appendix A”,In code: A Mathematical Journey, Workman Publishing,(2001), 271-296.
Maze, G., et al., “Public Key Cryptography based on Simple Modules over Simple Rings”, (Jun. 26, 2002),1-8.
Ourivski, A. V., et al., “New Technique for Decoding Codes In the Rank Metric and Its Cryptography Applications”,Problem of Information Transmission, 38(3), (2002),237-246.
Sun, H.-M., “Cryptanalysis of a Public-Key Cryptosystem Based on Generalized Inverses of Matrices”,IEEE Communications Letters, 5(2), (Feb. 2001), 61-63.
WU, C. K., “Generalised Inverses in Public Key Cryptosystem Design”,IEE Proceedings, 145(5), (Sep. 1998), 321-326.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Public key cryptography using matrices does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Public key cryptography using matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Public key cryptography using matrices will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3967880

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.