Patents by Inventor Alan Kaminsky

Alan Kaminsky has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9438416
    Abstract: Systems (100) and methods (600) for generating encrypted data. The methods involve: combining a cryptographic key with state initialization bits to generate first combination bits; producing a first keystream by performing a permutation function ƒ using the first combination bits as inputs thereto; and using the first keystream to encrypt first data (e.g., authentication data or message body data) so as to produce first encrypted data. The permutation function ƒ comprises a round function ƒround that is iterated R times. The round function ƒround consists of (1) a substitution layer in which the first combination bits are substituted with substitute bits, (2) a permutation layer in which the substitute bits are re-arranged, (3) a mixing layer in which multiple of the permutation layer are combined together, and (4) an addition layer in which a constant is added to the output of the mixing layer.
    Type: Grant
    Filed: July 18, 2014
    Date of Patent: September 6, 2016
    Assignee: Harris Corporation
    Inventors: Michael T. Kurdziel, Matthew Kelly, Alan Kaminsky, Marcin Lukowiak, Stanislaw Radziszowski
  • Publication number: 20160020901
    Abstract: Systems (100) and methods (600) for generating encrypted data. The methods involve: combining a cryptographic key with state initialization bits to generate first combination bits; producing a first keystream by performing a permutation function ƒ using the first combination bits as inputs thereto; and using the first keystream to encrypt first data (e.g., authentication data or message body data) so as to produce first encrypted data. The permutation function ƒ comprises a round function ƒround that is iterated R times. The round function ƒround consists of (1) a substitution layer in which the first combination bits are substituted with substitute bits, (2) a permutation layer in which the substitute bits are re-arranged, (3) a mixing layer in which multiple of the permutation layer are combined together, and (4) an addition layer in which a constant is added to the output of the mixing layer.
    Type: Application
    Filed: July 18, 2014
    Publication date: January 21, 2016
    Inventors: Michael T. Kurdziel, Matthew Kelly, Alan Kaminsky, Marcin Lukowiak, Stanislaw Radziszowski
  • Patent number: 8873759
    Abstract: Method for distributing a group session cryptographic key includes initiating at least one pairwise key distribution session including a root node (100) and at least one communication node (101-107). The method further includes performing at a communication node which has received the group session cryptographic key a propagated pairwise key distribution session with at least one of the communication nodes which has not previously received said group session cryptographic key. The propagated pairwise key distribution sessions are performed at each of the communication nodes which subsequently receives the group session cryptographic key until the group session cryptographic key has been securely provided to all authorized communication nodes.
    Type: Grant
    Filed: February 8, 2013
    Date of Patent: October 28, 2014
    Assignee: Harris Corporation
    Inventors: Michael Thomas Kurdziel, Peter Bajorski, Alan Kaminsky, Marcin Lukowiak, Stainslaw Radziszowski, Christopher Wood