Ncipher Corporation Limited

International Business Machines Corporation

Nciper Corporation Limited

Cipher Corporation Limited

Kyle Stein

Scott Thomas Haban

Oscar R Mitchell

Rajat Datta

Greg North

George Robert Blakley

Scott Kelly Herrington

Randall Findley

Richard Goble

George Robert Blakely

A method, system, and apparatus for performing computations. In a method, arguments X and K are loaded into session memory, and X mod P and X mod Q are computed to give, respectively, Xand X. Xand Xare exponentiated to compute, respectively, Cand C. Cand Care merged to compute C, which is then retrieved from the session memory. A system includes a computing device and at least one computational apparatus, wherein the computing device is configured to use the computational apparatus to perform accelerated computations. An apparatus includes a chaining controller and a plurality of computational devices. A first chaining subset of the plurality of computational devices includes at least two of the plurality of computational devices, and the chaining controller is configured to instruct the first chaining subset to operate as a first computational chain.

Computational method, system, and apparatus

A data encryption method performed with ring arithmetic operations using a residue number multiplication process wherein a first conversion to a first basis is done using a mixed radix system and a second conversion to a second basis is done using a mixed radix system. In some embodiments, a modulus C is be chosen of the form 2&#x2212;L, wherein C is a w-bit number and L is a low Hamming weight odd integer less than 2. And in some of those embodiments, the residue mod C is calculated via several steps. P is split into 2 w-bit words Hand L. Sis calculated as equal to L+(H2)+(H2)+ . . . +(H2)+H. Sis split into two w-bit words Hand L. Sis computed as being equal to L+(H2)+(H2)+ . . . +(H2)+H. Sis computed as being equal to S+(2+ . . . +2+1). And the residue is determined by comparing Sto 2. If S&#x3c;2, then the residue equals S. If S&#x2267;2, then the residue equals S&#x2212;2.

Ring arithmetic method, system, and apparatus

A method and system for generating a cryptographically random number stream () is provided. A system includes a module () configured to provide at least two statistically random number streams () and () and an oscillator () operably coupled to the module (). The oscillator () is configured to operate at a frequency which varies in response to physically unpredictable events and to select a current number from one of the at least two statistically random number streams () and () based on the oscillator's state. A process includes several steps. At least two statistically random number streams are provided (). A current number is selected () from one of the at least two statistically random number streams based on the state of an oscillator operating at a frequency which varies in response to physically unpredictable events. The step of selecting () is repeated () to create the cryptographically random number stream. The number streams can be carried by signals (), (), and (). An apparatus for performing the process is also disclosed.

Method and system for generating a cryptographically random number stream

A data encryption method performed with ring arithmetic operations wherein a modulus C is be chosen of the form 2&#x2212;L, wherein C is a w-bit number and L is a low Hamming weight odd integer less than 2. And in some of those embodiments, the residue mod C is calculated via several steps. P is split into 2 w-bit words Hand L. Sis calculated as equal to L+(H2)+(H2)+ . . . +(H2)+H. Sis split into two w-bit words Hand L. Sis computed as being equal to L+(H2)+(H2)+ . . . +(H2)+H. Sis computed as being equal to S+(2+ . . . +2+1). And the residue is determined by comparing Sto 2. If S&#x3c;2, then the residue equals S. If S&#x2267;2, then the residue equals S&#x2212;2.

Private keys for a public key cryptography system are protected within private key storage and communication by the requirement of a password to extract the private key based on a password during decryption. Upon receipt of a message encrypted with the public key, both the public key and the protected private key are retrieved from key storage. Interception of this transaction is useless since the protected private key alone cannot be utilized to decrypt the received message. A user is authenticated by extracting a potential private key from the protected private key utilizing a hashed password value, encrypting a well-known message with the public key, decrypting the encrypted well-known message utilizing the potential private key, and comparing the original and decrypted well-known messages. If they match, the extracted private key is employed to decrypt the received message. Signature values based on the password and/or private key may be employed to change the password or add new public key/private key pairs to the key storage.

Growing community of inventors

Round Rock, TX, United States of America

Kyle Stein