Digital certificates

Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C380S028000, C380S029000, C380S030000, C713S155000, C713S156000, C713S157000, C713S158000, C726S003000, C726S004000, C726S005000, C726S006000

Reexamination Certificate

active

07904721

ABSTRACT:
A method for producing a certificate, the certificate including data, the method including choosing a seed s, the seed s including a result of applying a function H to the data, generating a key pair (E,D), such that E=F(s,t), F being a publicly known function, and including s and t in the certificate. Related methods, and certificates produced by the various methods, are also described.

REFERENCES:
patent: 5373561 (1994-12-01), Haber et al.
patent: 5717757 (1998-02-01), Micali
patent: 5999711 (1999-12-01), Misra et al.
patent: 6084966 (2000-07-01), Maebara et al.
patent: 6233577 (2001-05-01), Ramasubramani et al.
patent: 6298153 (2001-10-01), Oishi
patent: 6496929 (2002-12-01), Lenstra
patent: 6683953 (2004-01-01), Kasahara et al.
patent: 2002/0046339 (2002-04-01), Bellare et al.
patent: 2002/0152385 (2002-10-01), Vanstone et al.
patent: 2003/0005317 (2003-01-01), Audebert et al.
patent: 2004/0015692 (2004-01-01), Green et al.
patent: WO 01/01625 (2001-01-01), None
“NTRUSIGN: Digital Signatures Using NTRU Lattice”, Apr. 2002.
Mar. 18, 2009 Office Communication in connection with EP application 03 780 595.9-2415.
Donald E. Eastlake et al., “US Secure Hash Algorithm (SHA 1)” (Network Working Group, Request for Comments 3174) (The Internet Society, Sep. 2001), available on the World Wide Web at www.ietf.org/rfc/rfc3174.txt?number=3174.
Jeffrey Hoffstein et al., “NTRUsign: Digital Signatures Using the NTRU Lattice” (Preliminary Draft 2, Apr. 2, 2002); available on the World Wide Web at: http//www.ntru.com.
A.K. Lenstra et al., “Factoring Polynomials with Rational Coefficients” Mathematische Annaleu 261, pp. 515-534 (1982); available at the World Wide Web at: http://www.springerlink.com/index/v4h8324p08422m61.pdf.
Alfred J Menezes et al., “The L3-lattice basis reduction algorithm”, Handbook of Applied Cryptography, §3.10.1 (CRC Press 1996).
Alfred J. Menezes et al., “Probabilistic primarily tests”, Handbook of Applied Cryptography, §4.2 (CRC Press 1996).
Phong Q. Nguyen et al.; “Lattice reduction in cryptology: An update”; available on the World Wide Web at: http://www.di.ens.fr.
R. L. Rivest et al., “A Method of Obtaining Digital Signatures and Public-Key Cryptosystems” Communications of the ACM vol. 21, Issue 2, pp. 120-126 (Feb. 1978).
“Announcing the Advanced Encryption Standard (AES)” (FIPS PUB 197) (National Institute of Standards and Technology, Nov. 26, 2001), available on the World Wide Web at: http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf.
“Information technology—Open systems interconnection—The Directory: Public-key and attribute certificate frameworks” (ITU-T Recommendation X.509) (ITU Telecommunication Standardization Sector. Mar. 2000).
NRTU Cryptolab FAQs, available on the World Wide Web at: http://www.ntru.com/cryptolab/faqs.htm.
“Secure Hash Standard” (FIPS PUB 180-1) (National Institute of Standards and Technology, Apr. 17, 1995).
Apr. 3, 2009 Office Communication in connection with Chinese patent application 2003 011029X.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Digital certificates does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Digital certificates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Digital certificates will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2661702

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.