U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Technique for reducing RSA Crypto variable storage

Patent 4736423 Issued on April 5, 1988. Estimated Expiration Date: Icon_subject January 31, 2006. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

RSA Public-key data encryption system having large random prime number generating microprocessor or the like
Patent #: 4351982
Issued on: 09/28/1982
Inventor: Miller ,   et al.

Cryptographic communications system and method
Patent #: 4405829
Issued on: 09/20/1983
Inventor: Rivest ,   et al.

Security system for electronic funds transfer system
Patent #: 4408203
Issued on: 10/04/1983
Inventor: Campbell

Automatic resetting apparatus for storing and dispensing objects
Patent #: 4423827
Issued on: 01/03/1984
Inventor: Guigan

Exponentiation cryptographic apparatus and method
Patent #: 4424414
Issued on: 01/03/1984
Inventor: Hellman ,   et al.

Apparatus and method for cryptographic identity verification
Patent #: 4438824
Issued on: 03/27/1984
Inventor: Mueller-Schloer

Protection system for intelligent cards Patent #: 4453074
Issued on: 06/05/1984
Inventor: Weinstein

Inventor

Application

No. 06/823151 filed on 01/31/1986

US Classes:

713/185, Using record or token380/282, By public key method380/30, Public key713/174, Including particular multiplication or exponentiation circuit902/27, Magnetically encoded902/4Means to read data stored on identifier*

Examiners

Primary: Cangialosi, Salvatore

Attorney, Agent or Firm

International Classes

G07F 7/10 (20060101)
H04L 9/28 (20060101)
H04L 9/30 (20060101)

Abstract

A technique for reducing RSA (Rivest, Shamir and Adleman algorithm) cryptovariable key from 1200 bits (400-bit public key, 400-bit secret key and 400-bit modulus) to 106 bits makes feasible the storage of the RSA algorithm parameters on current magnetic stripe cards used by the banking and finance industry. Of the 106 bits required, only 56 bits must be kept secret; the remaining 50 bits are nonsecret. These 106 bits are used to derive two 200-bit primes P and Q from which is computed the modulus N=PQ and two 400-bit keys PK (public key) and SK (secret key). In effect, a savings in storage is achieved at the expense of performing a precomputation to derive the modulus and keys each time the system is utilized for encryption/decryption. The 56-bit value plus the additional 50 bits of nonsecret data can be used to generate the RSA cryptovariables in systems where the RSA algorithm has been implemented. In another embodiment, a technique is provided for reducing the RSA cryptovariable storage of the public key PK and modulus from 800 bits to 260 bits. These 260 bits can be used at any later time to derive the 400-bit public key PK and 400-bit modulus N=PQ. The savings in storage is achieved by performing a precomputation each time the system is utilized for encryption/decryption.

PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$16.95more info
 
Sign InRegister
Username  
Password   
forgot password?