Abstract: A transposition processing unit having a k-partition generalized Feistel structure transposes Yb,u into Za,t if Ya,t (t=0, 1, . . . , s?1) is transposed into Zb,u (u=0, 1, . . . , s?1, u?t), in a case where input data entered into the transposition processing unit is Y0, Y1, . . . , Yk?1 (n bits×k); output data from the transposition processing unit is Z0, Z1, . . . , Zk?1; Yi (i=0, 1, . . . , k?1) divided into s blocks (s=2, 4, . . . , n) is Yi, 0, Yi, 1, . . . , Yi, s?1; Zi divided into s blocks is Zi, 0, Zi, 1, . . . , Zi, s?1.

Abstract: An information processing device comprises: a non-linear transformation unit that takes a k/2-number of odd-numbered string data Bi (i=1, 3, . . . , k?1), k being an even number not smaller than 6, out of a k-number of string data {B1, B2, . . . , Bk}, as intermediate data Wi, and that XORs data transformed from the odd-numbered string data Bi based on a bijective F-function, in which an as-transformed value is determined responsive to a value of key data, and even-numbered string data Bi+1, to give intermediate data Wi+1; and a permutation unit that permutes the intermediate data {W1, W2, . . . , Wk} by the data {B1, B2, . . . , Bk}; in so permuting the intermediate data, the permutation unit permuting odd-numbered data by even-numbered data and permuting even-numbered data by odd-numbered data; the permutation unit not permuting Wi+1 by B((i+1)mod—k)+1, where i=0, 1, 2, . . . , k?1 and x mod y is a remainder left after dividing x by y, and not permuting Wi+1 by B((i+k-1)mod—k)+1.

Abstract: The present invention has: a dynamic random access memory (DRAM); a refresh controller that receives information related to a range of the number of lost bits that are lost by stopping refresh processing of the DRAM, and controls a time to stop the refresh processing to achieve the range of the number of lost bits; and a physical information mapping unit that generates device specific information based on position information of the lost bits generated by stopping the refresh processing. It is preferable that the refresh controller corrects the time to stop the refresh processing based on the number of current lost bits to achieve the range of the number of lost bits set.

Abstract: An encryption/decryption method comprises by using a generalized Feistel structure in which data is divided into n pieces and mixing processing with key data is performed, diffusion processing, in which data transformation via linear operation is executed, is performed at least once between rounds of the generalized Feistel structure, wherein. As the diffusion processing, linear transformation is performed in which each of n pieces of output data is operated on by two or more pieces of input data. The method is adapted for encryption or decryption.

Abstract: A transposition processing unit having a k-partition generalized Feistel structure transposes Yb,u into Za,t if Ya,t (t=0, 1, . . . , s?1) is transposed into Zb,u (u=0, 1, . . . , s?1, u?t), in a case where input data entered into the transposition processing unit is Y0, Y1, . . . , Yk?1 (n bits×k); output data from the transposition processing unit is Z0, Z1, . . . , Zk?1; Yi (i=0, 1, . . . , k?1) divided into s blocks (s=2, 4, . . . , n) is Yi, 0, Yi, 1, . . . , Yi, s?1; Zi divided into s blocks is Zi, 0, Zi, 1, . . . , Zi, s?1.

Abstract: Disclosed is an encryption device for generating a pseudo-random number based on a secret key and generates an encrypted text by applying the pseudo-random number sequence to a plain text, uses, an internal state in accordance with a state based on a permutation of a sequence of a finite number of numeric values, as an internal state used for generation of the pseudo-random number sequence, executes a predetermined leftward or rightward rotate shift, depending on a number smaller than an internal state number, based on the result of linear or non-linear, or combination of linear and non-linear using one or more numeric values of the internal state and sets at least one temporary variable used for generation of the pseudo-random number sequence to be a temporary variable having as a value a result of the execution of the predetermined leftward or rightward rotate shift, and generates the pseudo-random number by a predetermined prescribed operation on one or a plurality of numeric values of the internal state a

Abstract: A data encryption system implemented by running on a cache-equipped computer an encryption program including transformation tables each of which contains a predetermined number of entries. All or necessary ones of the transformation tables are loaded into the cache memory before encryption/decryption process. This causes encryption/decryption time to be made substantially equal independently of the number of operation entries for the transformation table. It is very difficult to extract plain texts used to determine a key differential, resulting in difficulties in cryptanalysis.

Abstract: An information processing device comprises: a non-linear transformation unit that takes a k/2-number of odd-numbered string data Bi (i=1, 3, . . . , k?1), k being an even number not smaller than 6, out of a k-number of string data {B1, B2, . . . , Bk}, as intermediate data Wi, and that XORs data transformed from the odd-numbered string data Bi based on a bijective F-function, in which an as-transformed value is determined responsive to a value of key data, and even-numbered string data Bi+1, to give intermediate data Wi+1; and a permutation unit that permutes the intermediate data {W1, W2, . . . , Wk} by the data {B1, B2, . . . , Bk}; in so permuting the intermediate data, the permutation unit permuting odd-numbered data by even-numbered data and permuting even-numbered data by odd-numbered data; the permutation unit not permuting Wi+1 by B((i+1)mod—k)+1, where i=0, 1, 2, . . . , k?1 and x mod y is a remainder left after dividing x by y, and not permuting Wi+1 by B((i+k-1)mod—k)+1.

Abstract: A data transmission device (100) performs encryption processing on transmission data, performs encryption processing of a Feistel structure on the obtained first converted data, and performs processing in the relationship of an inverse function with the first encryption processing on the obtained second converted data. A first converting unit (105) divides transmission data into N sets (N being three or greater) of divided transmission data, performs operation processing on the divided transmission data to generate at least N sets of operation processing data, and combines the generated N sets of operation processing data to generate the first converted data.

Abstract: An encryption/decryption method comprises by using a generalized Feistel structure in which data is divided into n pieces and mixing processing with key data is performed, diffusion processing, in which data transformation via linear operation is executed, is performed at least once between rounds of the generalized Feistel structure, wherein. As the diffusion processing, linear transformation is performed in which each of n pieces of output data is operated on by two or more pieces of input data. The method is adapted for encryption or decryption.

Abstract: A pseudorandom number generation apparatus used for a stream cipher comprises at least one internal state, a non-linear conversion means that updates numeric data saved in the internal state, and a transposition means that performs only bit transposition for the numeric data, updated by the non-linear conversion means, based on a predefined rule.

Abstract: Disclosed is an encryption device for generating a pseudo-random number based on a secret key and generates an encrypted text by applying the pseudo-random number sequence to a plain text, uses, an internal state in accordance with a state based on a permutation of a sequence of a finite number of numeric values, as an internal state used for generation of the pseudo-random number sequence, executes a predetermined leftward or rightward rotate shift, depending on a number smaller than an internal state number, based on the result of linear or non-linear, or combination of linear and non-linear using one or more numeric values of the internal state and sets at least one temporary variable used for generation of the pseudo-random number sequence to be a temporary variable having as a value a result of the execution of the predetermined leftward or rightward rotate shift, and generates the pseudo-random number by a predetermined prescribed operation on one or a plurality of numeric values of the internal state a

Abstract: A data encryption system implemented by running on a cache-equipped computer an encryption program including transformation tables each of which contains a predetermined number of entries. All or necessary ones of the transformation tables are loaded into the cache memory before encryption/decryption process. This causes encryption/decryption time to be made substantially equal independently of the number of operation entries for the transformation table. It is very difficult to extract plain texts used to determine a key differential, resulting in difficulties in cryptanalysis.

Abstract: A data encryption system implemented by running on a cache-equipped computer an encryption program including transformation tables each of which contains a predetermined number of entries. All or necessary ones of the transformation tables are loaded into the cache memory before encryption/decryption process. This causes encryption/decryption time to be made substantially equal independently of the number of operation entries for the transformation table. It is very difficult to extract plain texts used to determine a key differential, resulting in difficulties in cryptanalysis.

Abstract: An encryption evaluation support system, includes an evaluation executing unit, and a point storing unit. The evaluation executing unit receives a figure representation of an encryption algorithm. The figure representation includes a plurality of unit figures. The point storing unit stores points allocated to the plurality of unit figures respectively. The evaluation executing unit gives the points to the plurality of unit figures of the figure representation, respectively, to output the points given to the plurality of unit figures of the figure representation.

Abstract: A data encryption system implemented by running on a cache-equipped computer an encryption program including transformation tables each of which contains a predetermined number of entries. All or necessary ones of the transformation tables are loaded into the cache memory before encryption/decryption process. This causes encryption/decryption time to be made substantially equal independently of the number of operation entries for the transformation table. It is very difficult to extract plain texts used to determine a key differential, resulting in difficulties in cryptanalysis.

Abstract: An encryption strength evaluation support apparatus includes a statistical data sampling program executing means for statistically obtaining correlations between individual bits of input and output data of an encryption device to be evaluated, a statistical result storage means for storing the bit correlations obtained by the statistical data sampling program executing means, and a statistical result edit/output means for editing and outputting the bit correlations stored in the statistical result storage means in the form of a table or a two- or three-dimensional graph. A mechanically readable recording medium recording an encryption strength evaluation support program for the above apparatus is also disclosed.

Abstract: An encryption evaluation support system, includes an evaluation executing unit, and a point storing unit. The evaluation executing unit receives a figure representation of an encryption algorithm. The figure representation includes a plurality of unit figures. The point storing unit stores points allocated to the plurality of unit figures respectively. The evaluation executing unit gives the points to the plurality of unit figures of the figure representation, respectively, to output the points given to the plurality of unit figures of the figure representation.

Abstract: The present encryption apparatus is provided with a plurality of conversion means connected in multiple steps, an intermediate-key generating means for performing linear or non-linear conversion for an intermediate-key and subsequently generating an initial-value of the intermediate-key, and an intermediate-key memory means for updating and storing the intermediate-key update information. The present encryption apparatus provides a ciphertext which is refractory to a chosen plaintext cryptanalysis in the evaluation of the key update information. The present apparatus is capable of high speed operation by parallel processing and is also capable of maintaining high speed operation by higher multiplication of the parallel operation even when the number of repetitive conversion is increased.