Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2007-06-12
2007-06-12
Vu, Kim (Department: 2135)
Cryptography
Particular algorithmic function encoding
C713S152000
Reexamination Certificate
active
09328726
ABSTRACT:
A method and apparatus are disclosed for improving public key encryption and decryption schemes that employ a composite number formed from three or more distinct primes. The encryption or decryption tasks may be broken down into sub-tasks to obtain encrypted or decrypted sub-parts that are then combined using a form of the Chinese Remainder Theorem to obtain the encrypted or decrypted value. A parallel encryption/decryption architecture is disclosed to take advantage of the inventive method.
REFERENCES:
patent: 4200770 (1980-04-01), Hellman et al.
patent: 4218582 (1980-08-01), Hellman et al.
patent: 4405829 (1983-09-01), Rivest et al.
patent: 4424414 (1984-01-01), Hellman et al.
patent: 4514592 (1985-04-01), Miyaguchi
patent: 4995082 (1991-02-01), Schnorr
patent: 5046094 (1991-09-01), Kawamura et al.
patent: 5046194 (1991-09-01), Alaniz et al.
patent: 5321752 (1994-06-01), Iwamura et al.
patent: 5351298 (1994-09-01), Smith
patent: 5761310 (1998-06-01), Naciri
patent: 5848159 (1998-12-01), Collins et al.
patent: 5974151 (1999-10-01), Slavin
Quisquater et al, Fast Decipherment Algorithm for RSA Public-Key Cryptosystem, Oct. 14, 1982, Electronics Letters, vol. 18 No. 21, pp. 905-907.
Menezes et al, Handbook of Applied Cryptography, Oct. 17, 1996, pp. 89 and 613.
Menezes et al, Handbook of Applied Cryptography, Oct. 16, 1996, pp. 68, 69, 283-287, 610-618.
Ding, Pei, and Salomaa, The Chinese Remainder Theorem World Scientific 1996.
Lidl and Pilz Applied Abstract Algebra, Undergraduate Texts in Mathematics, Springer 1984.
Nemo, RSA Moduli Should Have 3 Prime Factors, Aug. 1996.
Quisquater and Couvreur, Fast Decipherment Algorithm For RSA Public Key Cryptosystem, Electronic letters, Oct. 1982, pp. 905-907.
Rivest et al. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.
Richar Schroeppel, Copyleft for Scientific Papers, Mar. 3, 1994.
Bruce Schneier: “Applied Cryptography” Second Edition, Jan. 1, 1996, John Wiley & sons, USA, XP002283138, pp. 466-474.
European Search Report, dated Oct. 11, 2004; App No. EP 95 3075.
IEEE 1994 Electronics Letters Online No: 19941450 “Using four-prime RSA in which some of the bits are specified” S.A. Vanstone and R.J. Zuccherat—Electronics Letters Dec. 8, 1994 vol. 30, No. 24, pp. 2118, 2119.
RSA '98 Presentation—F. Levy-dit-Vehel—Jan. 98 “Stuffing An RSA Into The Smallest 68HC05”, pp. 1-14.
Generating a Product of Three Primes With an Unknown Factorization, Dan Boneh and Jeremy Horwitz, Computer Science Department, Stanford University.
ChipCenter: The Web's Definitive Electronics Resource—“Compaq Computer Corporation—WebScan :Press Release”(Apr. 11, 2000).
Newell Public Relations, Hong Kong—“RSA Security teams with Compaq to provide high-speed cryptography breakthrough for manufacturers of wireless and embedded devices” (Apr. 19, 2000).
Compaq News via WebLibrary—“New RSA BSAFE Crypto-C Encryption Software Offers up to 500 Percent Performance Gains for E-Commerce, Secure E-Mail and Other Applications” PR News Wire via DowVision (Sep. 6, 2000).
Compaq News via WebLibrary—“RSA Security Releases RSA Encryption Algorithm into Public Domain” PR News Wire via DowVision (Sep. 6, 2000).
RSA Security—RSA BSAFE★ —Wireless Transport Layer Security for C(Aug. 31, 2000).
CyberLaw Presents: The RSA Algorithm&The RSA Patent—“Using the RSA Algorithm for Encryption and Digital Signatures: Can You Encrypt, Decrypt, Sign and Verify without Infringing the RSA?” Patrick J. Flinn and James M. Jordan III★; (c) 1997 Alston & Bird LLP (Jul. 9, 1997).
RSA Laboratories / Bulletin 13(Apr. 2000) “A Cost-Based Security Analysis of Symmetric and Asymmetric Key Lengths” Robert D. Silverman, RSA Laboratories.
1982 International Symposium on Information Theory; Les Arcs, France (Jun. 21-25, 1982).
Lecture Notes in Computer Science(Edited by G. Goos and J. Hartmanis) —“Advances in Cryptology—CRYPTO 86” Proceedings.
“An Introduction to Fast Generation of Large Prime Numbers” by C. Couvreur and J.J. Quisquater; Phillips J. Res. 37, 231-264, 1982.
“A Method for Obtaining Digital Signatures and Public Key Cryptosystems” R.L. Rivest, A. Shamir, and L. Adelman, MIT Laboratory for Computer Science and Department of Mathematics.
MIT/LCS/TR-212—“Digitalized Signatures and Public-Key Functions As Intractable As Factorization” Michael O. Rabin (Jan. 1979) Massachusetts Institute of Technology Laboratory for Computer Science.
Permutation Polynomials in RSA-CryptosystemsRudolf Lidl and Winfried B. Muller; Department of Mathematics, University of Tasmania, Hobart Australia 7001 and Institut für Mathematik, Universität Klagenfurt, A-9020 Klagenfurt, Austria.
PKCS #1: RSA Encryption Standart—An RSA Laboratories Technical Note, Version 1.5, Revised Nov. 1, 1993.
High-Speed RSa ImplementationCetin Kaya Koc, RSA Laboratories RSA Data Security, Inc., 100 Marine Parkway, Suite 500, Redwood City CA 94065-1031; Copyright © RSA Laboratories Version 2.0—Nov. 1994.
International Search Report (PCT).
RSI Moduli Should Have 3 Prime Factors★ by Captain Nemo.
Collins Thomas
Hopkins Dale
Langford Susan
Sabin Michael
Klimach Paula
Vu Kim
LandOfFree
Multiprime RSA public key cryptosystem does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Multiprime RSA public key cryptosystem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiprime RSA public key cryptosystem will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3884727