Methods of encoding and decoding data

• US 20060098815A1
• Filed: 11/07/2005
• Published: 05/11/2006
• Est. Priority Date: 11/05/2004
• Status: Abandoned Application

• Current Assignee: Synaptic Laboratories Limited
• Original Assignee: Synaptic Laboratories Limited
• Inventors: O'Neil, Sean
• Application Number:
  US11/267,212
• Publication Number:
  US 20060098815A1
• Time in Patent Office: Days
• US Class Current: 380/28
• CPC Class Codes: H04L 2209/08 Randomization, e.g. dummy operations or using noise
• CPC Class Codes: H04L 9/0618 Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation

Abstract

A cryptographic process (100) receives variable length user data (150) as input and performs an initialization process, at least one pass of at least one pass function and an output function. The pass function the invokes at least one round function (171). Each round function (171) receives inputs which are at least one reversible input (151) selected from the intermediate text (150), at least two irreversible inputs (152, 157) selected from the intermediate text (150), so that each pair of the at least two irreversible inputs (152, 157) are selected from the intermediate text (150) so that they separated by at least one bit of intermediate text (150). The round function (171) generates at least one reversible output (151) that updates the intermediate text (150). The sum of the length of the reversible (151) and irreversible (152, 157) inputs received by the round function (171) from the intermediate text (150) is less than the length of the intermediate text (150) in bits minus eight times the length of the sum of the output bits (151) of the round function (171). The output function (171) ensures each block of intermediate text (150) is updated at least once from the output of a unique round function (171) invocation. The output function releases a set of bits from the intermediate text (150) only after the pass function has updated the intermediate text (150) at least once.

Claims

1. A process that receives as input variable length user data comprising at least 56 octets, the process comprising:

an initialization process comprising the initialization of intermediate text which is of the same length as the length of the variable length user data;

at least one pass of at least one pass function, each pass function comprising;

the invocation of at least one round function, each round function;

receiving inputs comprising;

at least one reversible input selected from the intermediate text;

at least two irreversible inputs selected from the intermediate text, so that each pair of the at least two irreversible inputs selected from the intermediate text is separated by at least one bit of intermediate text; and

generating at least one reversible output that updates the intermediate text;

and in which;

 

the sum of the length of the reversible and irreversible inputs received by the round function from the intermediate text is less than the length of the intermediate text in bits minus eight times the length of the sum of the output bits of the round function;

and comprising a sequence of steps that ensures each block of intermediate text is updated at least once from the output of a unique round function invocation; and

an output function which releases a set of bits from the intermediate text only after the pass function has updated the intermediate text at least once.

2. A process as claimed in claim 1, in which at least one round function invocation receives as at least one irreversible input at least a portion of the output of the immediately preceding round function invocation.

3. A process as claimed in claim 1, in which the round function additionally receives at least one irreversible block of input regarding the reversible input.

4. A process as claimed in claim 1, in which each bit of the output of at least one of the round functions has a nonlinear dependency on at least two of the at least two irreversible inputs of the round function.

5. A process as claimed in claim 1, in which the round function is a block cipher with irreversible inputs that are twice the length of its plaintext input.

6. A process as claimed in claim 1, in which a minimum number of rounds is performed before the output function is called, that minimum number of rounds being calculated by the steps comprising:

a. determining the number of rounds required for the output of the successive round functions to be computationally indistinguishable from random; and

b. setting the minimum number of rounds as a multiple of at least 3 times the number of rounds determined by the step a.

c. calculating the number of passes achieved by the number of rounds in step b by dividing the length of the intermediate text (calculated in units equal to the length of the output of the round function used to update the intermediate text) by the number of rounds determined by step b.

d. calculating the number of rounds required to achieve at least three complete passes of the intermediate text by dividing the length of the intermediate text in blocks by the length of the output of the round function multiplied by the number of passes required.

e. calculating the largest number of rounds as determined by steps c and d as the minimum number of round functions that must execute before the output function is called.

7. Apparatus that receives as input variable length user data comprising at least 56 octets, the apparatus comprising:

an initialization module which implements an initialization process, the initialization process comprising the initialization of intermediate text which is of the same length as the length of the variable length user data;

a pass function module which implements at least one pass of at least one pass function, each pass function comprising;

the invocation of at least one round function, each round function;

receiving inputs comprising;

at least one reversible input selected from the intermediate text;

at least two irreversible inputs selected from the intermediate text, so that each pair of the at least two irreversible inputs selected from the intermediate text is separated by at least one bit of intermediate text; and

generating at least one reversible output that updates the intermediate text;

and in which;

 

the sum of the length of the reversible and irreversible inputs received by the round function from the intermediate text is less than the length of the intermediate text in bits minus eight times the length of the sum of the output bits of the round function;

and comprising a sequence of steps that ensures each block of intermediate text is updated at least once from the output of a unique round function invocation; and

an output module which implements an output function, which output function releases a set of bits from the intermediate text only after the pass function has updated the intermediate text at least once.

8. Apparatus as claimed in claim 7, in which at least one round function invocation receives as at least one irreversible input at least a portion of the output of the immediately preceding round function invocation.

9. Apparatus as claimed in claim 7, in which the round function additionally receives at least one irreversible block of input regarding the reversible input.

10. Apparatus as claimed in claim 7, in which a single pass of the pass function ensures that each block of intermediate text is updated once by the output of a round function.

11. Apparatus as claimed in claim 7, in which the round function is a block cipher with irreversible inputs that are twice the length of its plaintext input.

12. Apparatus as claimed in claim 7, in which the minimum number of rounds is calculated by the steps comprising:

a. determining the number of rounds required for the output of the successive round functions to be computationally indistinguishable from random; and

b. setting the minimum number of rounds as a multiple of at least 3 times the number of rounds determined by the step a..

c. calculating the number of passes achieved by the number of rounds in step b by dividing the length of the intermediate text (calculated in units equal to the length of the output of the round function used to update the intermediate text) by the number of rounds determined by step b.

d. calculating the number of rounds required to achieve at least three complete passes of the intermediate text by dividing the length of the intermediate text in blocks by the length of the output of the round function multiplied by the number of passes required.

e. calculating the largest number of rounds as determined by steps c and d as the minimum number of round functions that must execute before the output function is called.