Non-linear data converter, encoder and decoder

• US 8,401,180 B2
• Filed: 03/21/2008
• Issued: 03/19/2013
• Est. Priority Date: 05/24/2007
• Status: Expired due to Fees

• Current Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Original Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Inventors: Komano, Yuichi, Shimizu, Hideo, Miyake, Hideyuki, Shimbo, Atsushi, Fujisaki, Koichi
• Primary Examiner(s): Arani, Taghi
• Assistant Examiner(s): LEE, JASON T
• Application Number:
  US12/053,143
• Publication Number:
  US 20080292100A1
• Time in Patent Office: 1,824 Days
• Field of Search: 380/29, 380/263, 713/194
• US Class Current: 380/29
• CPC Class Codes: H04L 2209/046 of operations, operands or results of the operations
• CPC Class Codes: H04L 2209/08 Randomization, e.g. dummy operations or using noise
• CPC Class Codes: H04L 2209/24 Key scheduling, i.e. generating round keys or sub-keys for block encryption
• CPC Class Codes: H04L 9/003 for power analysis, e.g. differential power analysis [DPA] or simple power analysis [SPA]
• CPC Class Codes: H04L 9/0618 Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation

Abstract

According to an aspect of the present invention, there is provided a non-linear data converter including: first to fourth converters that each performs a respective converting process on an input bit string to output respective output bit string; a generator that generates a random number bit string; and a selector that selects any one of the output bit strings from the first to fourth converters based on the random number bit string. Each of the converting processes is equivalent to performing a first mask process, a non-linear conversion predetermined for an encoding or a decoding and a second mask process.

Claims

1. A non-linear data converter including a CPU and comprising:

a first converter that performs a first process on an input bit string to output a first output bit string, the first process equivalent to performing;

a mask process using a first mask,

a non-linear conversion predetermined for performing an encoding or a decoding, and

a mask process using a second mask;

a second converter that performs a second process on the input bit string to output a second output bit string, the second process equivalent to performing;

the mask process using the first mask,

the non-linear conversion, and

a mask process using an inverted second mask;

a third converter that performs a third process on the input bit string to output a third output bit string, the third process equivalent to performing;

a mask process using an inverted first mask,

the non-linear conversion, and

the mask process using the second mask;

a fourth converter that performs a fourth process on the input bit string to output a fourth output bit string, the fourth process equivalent to performing;

the mask process using the inverted first mask,

the non-linear conversion, and

the mask process using the inverted second mask;

a generator that generates a random number bit string; and

a selector that selects any one of the first to fourth output bit strings based on the random number bit string.

2. An encoder comprising:

a key scheduler that generates a j-th enlarged key from a secret key, j being an integer larger than 1and smaller than z, z being an integer larger than 2;

a random number generator that generates a j-th random number bit string;

a mask generator that generates a j-th first mask and a j-th second mask based on the j-th random number bit string, a predetermined first mask and a predetermined second mask;

a pre-processor that outputs a first bit string based on an input plaintext block;

the non-linear data converter of claim 1 as a j-th function calculator that performs an encoding calculation to a j-th bit string to output a (j+1)-th bit string; and

a post-processor that outputs a ciphertext block based on a (Z+1)-th bit string.

3. A decoder comprising:

a key scheduler that generates a j-th enlarged key from a secret key, j being an integer larger than 1 and smaller than z, z being an integer larger than 2;

a random number generator that generates a j-th random number bit string;

a mask generator that generates a j-th first mask and a j-th second mask based on the j-th random number bit string, a predetermined first mask and a predetermined second mask;

a pre-processor that outputs a first bit string based on an input ciphertext block;

the non-linear data converter of claim 1 as a j-th function calculator that performs a decoding calculation to a j-th bit string to output a (j+1)-th bit string; and

a post-processor that outputs a decoded sentence block based on a (Z+1)-th bit string.