The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jun. 30, 2015

Filed:

Jan. 30, 2014
Applicant:

Securerf Corporation, Westport, CT (US);

Inventors:

Iris Anshel, Tenafly, NJ (US);

Michael Anshel, New York, NY (US);

Dorian Goldfeld, Tenafly, NJ (US);

Assignee:

SecureRF Corporation, Shelton, CT (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
H04L 9/00 (2006.01); H04L 9/08 (2006.01); H04L 9/30 (2006.01);
U.S. Cl.
CPC ...
H04L 9/0861 (2013.01); H04L 9/0841 (2013.01); H04L 9/3013 (2013.01); H04L 2209/12 (2013.01); H04L 9/30 (2013.01);
Abstract

A system and method for generating a secret key to facilitate secure communications between users. A first and second and a function between the two monoids are selected, the function being a monoid homomorphism. A group and a group action of the group on the first monoid is selected. Each user is assigned a submonoid of the first monoid so that these submonoids satisfy a special symmetry property determined by the function, a structure of the first and second monoids, and the action of the group. A multiplication of an element in the second monoid and an element in the first monoid is obtained by combining the group action and the monoid homomorphism. First and second users choose private keys which are sequences of elements in their respective submonoids. A first result is obtained by multiplying an identity element by the first element of the sequence in a respective submonoid. Starting with the first result, each element of the user's private key may be iteratively multiplied by the previous result to produce a public key. Public keys are exchanged between first and second users. Each user's private key may be iteratively multiplied by the other user's public key to produce a secret key. Secure communication may then occur between the first and second user using the secret key.


Find Patent Forward Citations

Loading…