US 7,321,658 B2 | ||
Padding application method ensuring security of cryptosystem and encryptor/decryptor | ||
Isamu Teranisi, Tokyo (Japan) | ||
Assigned to NEC Corporation, Tokyo (Japan) | ||
Appl. No. 10/561,216 PCT Filed Mar. 23, 2005, PCT No. PCT/JP2005/005287 § 371(c)(1), (2), (4) Date Jan. 12, 2006, PCT Pub. No. WO2005/098756, PCT Pub. Date Oct. 20, 2005. |
||
Claims priority of application No. 2004-102399 (JP), filed on Mar. 31, 2004. | ||
Prior Publication US 2006/0171531 A1, Aug. 03, 2006 | ||
Int. Cl. H04L 9/28 (2006.01) |
U.S. Cl. 380—28 [380/30; 380/37; 380/42; 708/250] | 20 Claims |
1. A padding application method for applying a padding scheme that ensures the security of cryptosystems not using random
numbers, to cryptosystems in which a random number is used to create a ciphertext and is susceptible to recovery at a receiving
end, the method comprising the steps of:
converting input information into a bit string with a prescribed length or less according to the padding scheme;
converting the bit string into a first bit string and a second bit string based on a prescribed conversion rule; and
supplying an encryption function with the first bit string as data input and the second bit string as random number input;
wherein the prescribed conversion rule is a map to map the bit string having a prescribed length or less to the element of
the direct product of the set of the first bit strings and the set of the second bit strings, and satisfies the following
conditions: the map is injective; the map and inverse map thereof are computable by a polynomial time; and the encryption
function whose domain is the direct product is a one-way function.
|