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

Efficient cryptographic hash functions and methods for amplifying the security of hash functions and pseudo-random functions

Patent 5608801 Issued on March 4, 1997. Estimated Expiration Date: Icon_subject November 16, 2015. 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

Generator for generating binary ciphering sequences
Patent #: 4817145
Issued on: 03/28/1989
Inventor: Gunther

Pseudo-random sequence generator
Patent #: 4944009
Issued on: 07/24/1990
Inventor: Micali, et al.

Public key/signature cryptosystem with enhanced digital signature certification
Patent #: 5005200
Issued on: 04/02/1991
Inventor: Fischer

High speed word generator
Patent #: 5224165
Issued on: 06/29/1993
Inventor: Reinhardt, et al.

Large provably fast and secure digital signature schemes based on secure hash functions Patent #: 5432852
Issued on: 07/11/1995
Inventor: Leighton, et al.

Inventors

Assignee

Application

No. 559213 filed on 11/16/1995

US Classes:

380/46, Nonlinear (e.g., pseudorandom)331/78, ELECTRICAL NOISE OR RANDOM WAVE GENERATOR380/28, PARTICULAR ALGORITHMIC FUNCTION ENCODING380/29, NBS/DES algorithm380/30, Public key380/44, Having particular key generator380/47, Plural generators708/250, Random number generation713/176, Authentication by digital signature representation or digital watermark713/187, COMPUTER PROGRAM MODIFICATION DETECTION BY CRYPTOGRAPHY713/188COMPUTER VIRUS DETECTION BY CRYPTOGRAPHY

Examiners

Primary: Gregory, Bernarr E.

Attorney, Agent or Firm

International Classes

H04L 009/00
G06F 001/02
H03B 029/00

Abstract

Methods and circuitry for generating a cryptographic hash function using a strong pseudo-random generator along with the input data to create high quality pseudo-random keys as indices to pseudo-random functions, as well as a pseudo-random function from 2n bits to 2n bits given a pseudo-random function from n bits to n bits.

Other References

  • Data Encryption Standard (DES), as published by the National Bureau of Standards, Department of Commerce, FIPS, pub 46, Jan. 1977
  • A. C. Yao, "Theory and Applications of Trapdoor Functions," Proc. of IEEE Symp. on Foundations of Computer Science (1982), pp. 80-91
  • M. Blum, and S. Micali, "How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits," SIAM Journal of Computing, {13} (1984) 850-864
  • R. Rivest, "The MD4 Message Digest Algorithm," Advances in Cryptology, Proc. of Crypto 90, Lecture Notes in Computer Science 537, Springer Verlag 1991, 303-311
  • "The MD5 Message Digest Algorithm," Request for Comments, 1321, Internet Activities Board, Internet Privacy Task Force, Apr. 199
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?