Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2008-01-22
2008-01-22
Vu, Kim (Department: 2135)
Cryptography
Particular algorithmic function encoding
C380S030000, C380S037000, C380S042000, C708S250000
Reexamination Certificate
active
07321658
ABSTRACT:
An encryptor/decryptor capable of achieving secure cryptographic communication by applying appropriate padding to a cryptosystem such as NTRU cryptosystems.When an n-bit plaintext M is received, the OAEP+ padding is applied thereto. According to a conversion rule or a conversion function A that satisfies the conditions as described below, two bit strings m and r are obtained from the result of the OAEP+ padding. The conversion function A is a map to map a bit string consisting of k bits or less to the element of Lm×Lr, where Lmis the scope of m and Lris the scope of r. The conversion function A should satisfy the following conditions: A is injective; A and the inverse map thereof can be computed by a polynomial time; and if an encryption function is denoted by E(m,r), a map E: A(X)→Leis a one-way function, where X is the scope of (m,r) and Leis the space of the entire ciphertext. After a bit string is divided into the two bit strings m and r, e=Er(m) is computed to be encrypted. Thus, a ciphertext e is transmitted to a receiver.
REFERENCES:
patent: 5068895 (1991-11-01), Shimada
patent: 5345507 (1994-09-01), Herzberg et al.
patent: 6081597 (2000-06-01), Hoffstein et al.
patent: 7164765 (2007-01-01), Nishioka et al.
patent: 2002/0199001 (2002-12-01), Wenocur et al.
patent: 2004/0078576 (2004-04-01), Geitinger
patent: 2004/0151307 (2004-08-01), Wang et al.
patent: 4582897 (1998-03-01), None
patent: 2 263 588 (2005-01-01), None
patent: 1232588 (1999-10-01), None
patent: 2000-516733 (2000-12-01), None
patent: WO 98/08323 (1998-02-01), None
M. Bellare and P. Rogaway, “Optimal Asymmetric Encryption- How to Encrypt with RSA”, Advances in Cryptography- Encrypt 94 Proceedings, Lecture Noted in Computer Science vol. 950, A. De Santis ed., Springer-Verlag, 1994.
Victor Shoup, “OAEP Reconsidered (Extended Abstract),” LNCS, vol. 2139, 2001, pp. 239 to 259.
Phong Q. Nguyen, et al. “Analysis and Improvements of NTRU Encryption Paddings,” LNCS, vol. 2442, 2002, pp. 210 to 225.
John A. Proos, “Imperfect Decryption and an Attack on the NTRU Encryption Scheme,” University of Waterloo, Jan. 7, 2003, pp. 1 to 28.
Eliane Jaulmes, et al. “A Chosen-Ciphertext Attack Against NTRU,” Crypto 2000 Springer Lecture Notes in Computer Sciences, 2000, pp. 20 to 35.
Jeffrey Hoffstein, et al. “Protecting NTRU Against Chosen Ciphertext and Reaction Attacks,” NTRU Cryptosystems Technical Report, Report #016, Version 1, Jun. 9, 2000, pp. 1 to 6.
Jeffrey Hoffstein, et al. “Optimizations for NTRU,” NTRU Cryptosystems, Inc., pp. 1 to 12.
Joseph H. Silverman, “Plaintext Awareness and the NTRU PKCS,” NTRU Cryptosystems Technical Report, Report #007, Version 2, Jun. 2000, pp. 1 to 7.
Don Coppersmith, et al. “Lattice Attacks on NTRU,” Eurocrypt '97 Springer Lecture Notes in Computer Sciences, 1997, pp. 52 to 61.
Jeffrey Hoffstein, et al. “NTRU: A Ring-Based Public Key Cryptosystem”.
NEC Corporation
Patel Nirav
Sughrue Mion Pllc.
Vu Kim
LandOfFree
Padding application method ensuring security of 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 Padding application method ensuring security of cryptosystem..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Padding application method ensuring security of cryptosystem... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2799537