Self-corrector randomisation-encryption and method

• US 7,508,945 B1
• Filed: 10/27/1999
• Issued: 03/24/2009
• Est. Priority Date: 05/18/1999
• Status: Expired due to Fees

• Current Assignee: Angel José Ferre Herrero
• Original Assignee: Angel José Ferre Herrero
• Inventors: Ferre Herrero, Angel José
• Primary Examiner(s): Moise; Emmanuel L
• Assistant Examiner(s): Gelagay; Shewaye
• Application Number:
  US09/979,229
• Time in Patent Office: 3,436 Days
• Field of Search: 713168-200, 705/51, 710/241, 710/266, 380/268
• US Class Current: 380/268
• CPC Class Codes: H04L 2209/08 Randomization, e.g. dummy operations or using noise
• CPC Class Codes: H04L 2209/26 Testing cryptographic entity, e.g. testing integrity of encryption key or encryption algorithm
• CPC Class Codes: H04L 9/0656 Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher
• CPC Class Codes: H04L 9/3247 involving digital signatures

Abstract

Method and system wherein that once the input data sequence (X) and the control block (K) have been supplied, the method and system generates always a sequence of randomized-encrypted data (A) which is an encrypted sequence of random numbers. The method and system randomize-encrypt the data sequence (X) in a corrective way generating the proposed randomized-encrypted text sequence (AP). The randomness verifier (603) validates the randomization of the proposed randomized-encrypted text sequence (AP). If the proposed randomized-encrypted text sequence (AP) is random, it is supplied as randomized-encrypted text sequence (A); if it is not random, the method and system randomize-encrypt the data sequence (X) in a different corrective way again. The iteration is repeated until it is encrypted and at random the proposed randomized-encrypted text sequence (AP).

Claims

1. Data sequence self-corrector randomisation-encryption system (501) for generating an encrypted and random sequence from a plaintext sequence (X) by the use of a freely selectable encryption key (K) comprising:

first input means (511) for receiving said plaintext sequence (X),

second input means (512) for receiving said encryption key (K),

corrective randomising-encrypting means for correctively randomising-encrypting said plaintext sequence (X) with said encryption key (K) generating a candidate randomised-encrypted text sequence (AP), and for generating on the basis of a randomness verification result (T) a new candidate randomised-encrypted text sequence (AP),

randomness verifying means (603) for verifying randomness of said candidate randomised-encrypted text sequence (AP) based on a predetermined randomness test and supplying said randomness verification result (T) in order to generate said new candidate randomised-encrypted text sequence (AP), and supplying said candidate randomised-encrypted text sequence (AP) as randomised-encrypted text sequence (A) if said randomness test indicates that said candidate randomised-encrypted text sequence (AP) is random,

transmission means (513) for transmitting said randomised-encrypted text sequence (A), whereby said randomised-encrypted text sequence (A) corresponds to said plaintext sequence (X) received by said first input means (511),

whereby said randomized-encrypted text sequence (A) is encrypted, and

whereby the confusion and diffusion of values of said randomised-encrypted text sequence (A) is ensured.

2. The system of claim 1 wherein said corrective randomising-encrypting means

include signature generating-assembly means (601) for generating with said plaintext sequence (X) signature from said plaintext sequence (X) and assembling said signature to said plaintext sequence (X), making up signed plaintext sequence (XF),

by-trial input corrector means of sequence (602) for correcting said signed plaintext sequence (XF) resulting in modified signed plaintext sequence (XM), and generating new said modified signed plaintext sequence (XM) with said randomness verification result (T),

randomising-encrypting means (102) for randomising-encrypting with said encryption key

(K) said modified signed plaintext sequence (XM) generating said candidate randomised-encrypted text sequence (AP),

whereby the system is arranged to adapt said plaintext sequence (X) in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

3. The system of claim 2, further including self-corrector decrypting device (502) that

by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generates said plaintext sequence (X) comprising:

first input means of self-corrector decrypting device (513) for receiving said randomised-encrypted text sequence (A),

second input means of self-corrector decrypting device (515) for receiving said control block (K),

decrypting means (104) for decrypting with said encryption key (K) said randomised-encrypted

text sequence (A) generating decrypted text sequence (XD),

by-trial output corrector means of sequence (701) for correcting said decrypted text sequence (XD) resulting in suggested plaintext sequence (XP), and generating with signature correspondence notification (E) new said suggested plaintext sequence (XP),

signature verifying means (702) for generating generated signature with included plaintext sequence segment in said suggested plaintext sequence (XP) and verifying correspondence of said generated signature with included signature in said suggested plaintext sequence (XP) supplying said signature correspondence notification (E), and for supplying said included plaintext sequence segment in said suggested plaintext sequence (XP) as said plaintext sequence (X) if said generated signature corresponds to said included signature,

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A) received by said first input means of self-corrector decrypting device (513).

4. The system of claim 3 wherein said by-trial input corrector means of sequence (602) are implemented in order to correct said signed plaintext sequence (XF) by means of function F¹ (said signed plaintext sequence (XF)), said by-trial output corrector means of sequence (701) are implemented in order to correct said decrypted text sequence (XD) by means of function F² (said decrypted text sequence (XD)), and

said by-trial input corrector means of sequence (602) implement said function F¹ (said signed plaintext sequence (XF)) as F^1′

(XL)=b_L-2, . . . , b₀, □

b_L-1, wherein said XL subblock b_L-1, b_L-2, . . . , b₀ of length L of sequence selected from the group consisting of said signed plaintext sequence (XF) and previous said modified signed plaintext sequence (XM), said L value preferably smaller than length selected from the group consisting of length of said modified signed plaintext sequence (XM) and length of said signed plaintext sequence (XF),

said by-trial output corrector means of sequence (701) implement said function F² (said decrypted text sequence (XD)) as F^2′

(XG)=□

b₀, b_L-1, . . . , b₁, wherein said XG subblock b_L-1, . . . , b₁, b₀ of length said L of sequence selected from the group consisting of said decrypted text sequence (XD) and previous said suggested plaintext sequence (XP),

said complementary bit operation,

said b_i, wherein said I takes the values from 0 to L−

1, is bit of order said I of respective said subblocks of length said L.

5. The system of claim 1 wherein said corrective randomising-encrypting means include candidate encryption key generating means (801) for generating with said encryption key (K) candidate encryption key (KC), and for generating with said randomness verification result (T) new said candidate encryption key (KC),

signature generating-assembly means (601) for generating with said plaintext sequence (X)

signature from said plaintext sequence (X) and assembling said signature to said plaintext sequence (X), making up signed plaintext sequence (XF),

randomising-encrypting means (102) for randomising-encrypting with said candidate encryption key (KC) said signed plaintext sequence (XF) generating said candidate randomised-encrypted text sequence (AP),

whereby the system is arranged to adapt said candidate encryption key (KC) in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

6. The system of claim 5, further including self-corrector decrypting device (502) that by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generates said plaintext sequence (X) comprising:

first input means of self-corrector decrypting device (513) for receiving said randomised-encrypted text sequence (A),

second input means of self-corrector decrypting device (515) for receiving said control block (K),

said candidate encryption key generating means (801) for generating with said control

block (K) said candidate encryption key (KC), and for generating with signature correspondence notification (E) new said candidate encryption key (KC),

decrypting means (104) for decrypting with said candidate encryption key (KC) said

randomised-encrypted text sequence (A) generating suggested plaintext sequence (XP),

signature verifying means (702) for generating generated signature with included plaintext sequence segment in said suggested plaintext sequence (XP) and verifying correspondence of said generated signature with included signature in said suggested plaintext sequence (XP) supplying said signature correspondence notification (E), and for supplying said included plaintext sequence segment in said suggested plaintext sequence (XP) as said plaintext sequence (X) if said generated signature corresponds to said included signature, whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A) received by said first input means of self-corrector decrypting device (513).

7. The system of claim 6 wherein said candidate encryption key generating means (801) are implemented in order to generate said candidate encryption key (KC) by means of function F³ (said encryption key (K)), and

said candidate encryption key generating means (801) implement said function F³ (said encryption key (K)) as function F⁴ (CR, said encryption key (K))=F⁵_n (said encryption key (K)) for said n of value said CR, wherein said CR selected from the group consisting of counter of said randomness verification result (T) and counter of said signature correspondence notification (E), and said F⁵_n (said encryption key (K)) implemented

as said encryption key (K) for said CR of initial value, and

as F⁵ (F⁵_n-1 (said encryption key (K))), wherein said F⁵_n (said encryption key (K))=union of

F⁶_n (Ki)=union of ((F⁶_n-1 (Ki) oper+/−

B) mod 2^Qi), wherein said Qi value preferably smaller than length of said encryption key (K), said Ki subblock of order said I of said encryption key (K) and of length said Qi, said B value, and said oper+/−

arithmetic operation.

8. The system of claim 1 wherein said corrective randomising-encrypting means include

randomisation-encryption control subblock generating means (1401) for generating with said encryption key (K) plurality of encryption control subblocks (Z₁-Z₅₂) and, optionally, initiatory control subblock of length G (W),

signature generating-assembly means (601) for generating with said plaintext sequence (X) signature from said plaintext sequence (X) and assembling said signature to said plaintext sequence (X), making up signed plaintext sequence (XF),

input assembly means of block of length N (301) for assembling from said signed plaintext sequence (XF) multitude of plaintext blocks of length N (X),

by-trial corrector generating means of transformer block (1801;

2001) for generating optionally with said initiatory control subblock of length G (W) multitude of transformer blocks (WT), and for generating with said randomness verification result (T) new said multitude of transformer blocks (WT),

grouping means (2202) for grouping said plaintext block of length N (X) with said transformer block (WT) generating grouped interblock of length N (V),

encrypting-decrypting means (204) for encrypting with said plurality of encryption control subblocks (Z₁-Z₅₂) said grouped interblock of length N (V) and resulting in randomised-encrypted text block of length N (A), multitude of said randomised-encrypted text block of length N (A) make up said candidate randomised-encrypted text sequence (AP),

whereby the system is arranged to self-adapt in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

9. The system of claim 8, further including self-corrector decrypting device (502) that by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generates said plaintext sequence (X) comprising:

first input means of self-corrector decrypting device (513) for receiving said randomised-encrypted text sequence (A),

second input means of self-corrector decrypting device (515) for receiving said encryption key (K),

decryption control subblock generating means (1501) for generating with said encryption key (K) plurality of decryption control subblocks (U₁-U₅₂) and, optionally, said initiatory control subblock of length G (W),

said by-trial corrector generating means of transformer block (1801;

2001) for generating optionally with said initiatory control subblock of length G (W) said multitude of transformer blocks (WT), and for generating with signature correspondence notification (E) said new said multitude of transformer blocks (WT),

said input assembly means of block of length N (301) for assembling from said randomised-encrypted text sequence (A) multitude of randomised-encrypted text blocks of length N (A),

said encrypting-decrypting means (204) for decrypting with said plurality of decryption control subblocks (U₁-U₅₂) said randomised-encrypted text block of length N (A) resulting in decrypted interblock of length N (S),

said grouping means (2202) for grouping said decrypted interblock of length N (S) with said transformer block (WT) generating plaintext block of length N (X), multitude of said plaintext block of length N (X) make up suggested plaintext sequence (XP),

signature verifying means (702) for generating generated signature with included plaintext sequence segment in said suggested plaintext sequence (XP) and verifying correspondence of said generated signature with included signature in said suggested plaintext sequence (XP) supplying said signature correspondence notification (E); and

for supplying said included plaintext sequence segment in said suggested plaintext sequence (XP) as said plaintext sequence (X) if said generated signature corresponds to said included signature,

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A) received by said first input means of self-corrector decrypting device (513).

10. The system of claim 9 wherein said by-trial corrector generating means of

transformer block (1801;

2001) are implemented in order to generate nth said transformer block (WT) of said multitude of transformer blocks (WT) by means of function F⁸ (said initiatory control subblock of length G (W), nth minus one said randomised-encrypted text block of length N (A)), and

said grouping means (2202) include exclusive-OR operation, and

said by-trial corrector generating means of transformer block (1801;

2001) implement said function F⁸ (said initiatory control subblock of length G (W), nth minus one said randomised-encrypted text block of length N (A)) as

for first said transformer block (WT) equal to said initiatory control subblock of length G (W), and

for said nth said transformer block (WT) as (said nth minus one said randomised-encrypted text block of length N (A) oper+/−

CR) mod 2^N, wherein said CR selected from the group consisting of counter of said randomness verification result (T) and counter of said signature correspondence notification (E), said oper+/−

arithmetic operation.

11. The system of claim 9 wherein said by-trial corrector generating means of transformer block (1801;

2001) are implemented in order to generate said multitude of transformer blocks (WT) by means of function F¹⁴ (said initiatory control subblock of length G (W)), and

said grouping means (2202) include exclusive-OR operation, and

said by-trial corrector generating means of transformer block (1801;

2001) implement said function F¹⁴ (said initiatory control subblock of length G (W)) for nth said transformer block (WT) as F¹⁵_n (CR, said initiatory control subblock of length G (W)), wherein said CR selected from the group consisting of counter of said randomness verification result (T) and counter of said signature correspondence notification (E), and said n takes the value of nth, and

said by-trial corrector generating means of transformer block (1801;

2001) implement said function F¹⁵_n (CR, said initiatory control subblock of length G (W)) as union of F¹⁶_n (said CR, Wi)=union of ((F¹⁶_n-1 (said CR, Wi) oper+/−

said CR) mod 2^Qi), wherein said Qi value preferably smaller than length of said initiatory control subblock of length G (W), said Wi subblock of order said I of said initiatory control subblock of length G (W) and of length said Qi, and said oper+/−

arithmetic operation.

12. The system of claim 1 wherein said corrective randomising-encrypting means include selected index generating means (2402) for generating selected index (IS) and for generating with said randomness verification result (T) new said selected index (IS),

by-index input corrector means of sequence (2401) for correcting said plaintext sequence (X) according to said selected index (IS) supplying by-index modified plaintext sequence (XI),

randomising-encrypting means (102) for randomising-encrypting with said encryption key

(K) said selected index (IS) and said by-index modified plaintext sequence (XI), generating said candidate randomised-encrypted text sequence (AP),

whereby the system is arranged to adapt said plaintext sequence (X) in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

13. The system of claim 12, further including self-corrector decrypting device (502) that by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generates said plaintext sequence (X) comprising:

first input means of self-corrector decrypting device (513) for receiving said

randomised-encrypted text sequence (A),

second input means of self-corrector decrypting device (515) for receiving said control block (K),

decrypting means (104) for decrypting with said encryption key (K) said randomised-encrypted text sequence (A) generating extracted selected index (IS) and decrypted plaintext sequence (XD),

by-index output corrector means of sequence (2501) for correcting said decrypted plaintext sequence (XD) according to said extracted selected index (IS), resulting in said plaintext sequence (X),

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A) received by said first input means of self-corrector decrypting device (513).

14. The system of claim 13 wherein said by-index input corrector means of sequence (2401) are implemented in order to correct said plaintext sequence (X) by means of function F¹⁷ (said selected index (IS), said plaintext sequence (X)), and said by-index output corrector means of sequence (2501) are implemented in order to correct said decrypted plaintext sequence (XD) by means of function F¹⁹ (said extracted selected index (IS), said decrypted plaintext sequence (XD)), and

said by-index input corrector means of sequence (2401) implement said function F¹⁷ (said selected index (IS), said plaintext sequence (X)) as F^17′

(said selected index (IS), XL)=(XL XOR said selected index (IS)), wherein said XL subblock of length L of sequence selected from the group consisting of said plaintext sequence (X) and previous said by-index modified plaintext sequence (XI), said L value preferably smaller than length selected from the group consisting of length of said plaintext sequence (X) and length of said by-index modified plaintext sequence (XI), and

said by-index output corrector means of sequence (2501) implement said function F¹⁹ (said extracted selected index (IS), said decrypted plaintext sequence (XD)) as F^19′

(said extracted selected index (IS), XG)=(XG XOR said extracted selected index (IS)), wherein said XG subblock of length said L of said decrypted plaintext sequence (XD).

15. The system of claim 1 wherein said corrective randomising-encrypting means include selected index generating means (2402) for generating initial selected index (IS) and for generating with said randomness verification result (T) alternative selected index (IS),

by-index encryption key generating means (2602) for generating with said encryption key (K) and said initial selected index (IS) initial by-index control block (KI), and for generating alternative by-index control block (KI) according to said alternative selected index (KI),

randomising-encrypting means (102) for randomising-encrypting said alternative selected index (IS) with said initial by-index control block (KI) and said plaintext sequence (IX) with said alternative by-index control block (KI) generating said candidate randomised-encrypted text sequence (AP),

whereby the system is arranged to adapt said alternative by-index control block (KI) in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

16. The system of claim 15, further including self-corrector decrypting device (502) that by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generates said plaintext sequence (X) comprising:

first input means of self-corrector decrypting device (513) for receiving said randomised-encrypted text sequence (A),

second input means of self-corrector decrypting device (515) for receiving said control block (K),

said by-index control block generating means (2602) for generating with said control block (K) said initial by-index control block (KI) and for generating with extracted alternative selected index (IS) said alternative by-index control block (KI),

decrypting means (104) for decrypting said randomised-encrypted text sequence (A) and, with said initial by-index control block (KI) resulting in said extracted alternative selected index (IS) and, with said alternative by-index control block (KI) resulting in said plaintext sequence (X),

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A) received by said first input means of self-corrector decrypting device (513).

17. The system of claim 16 wherein said by-index control block generating means (2602) are implemented in order to generate said initial by-index control block (KI) and said alternative by-index control block (KI) by means of function F²¹ (IS, said encryption key (K)), wherein said IS is index selected from the group consisting of said initial selected index (IS) and said alternative selected index (IS) and said extracted alternative selected index (IS), and

said by-index control block generating means (2602) implement said function F²¹ (IS, said encryption key (K)) as union of F²⁴ (said IS, Kj)=union of ((Kj oper+/−

said IS) mod 2^Qj), wherein said Qj value preferably smaller than length of said encryption key (K), said Kj subblock of order said j of said encryption key (K) and of length said Qj, and said oper+/−

arithmetic operation.

18. The system of claim 1 wherein said corrective randomising-encrypting means include

randomisation-encryption control subblock generating means (1401) for generating with said encryption key (K) plurality of encryption control subblocks (Z₁-Z₅₂) and, optionally, generate initiatory control subblock of length G (W),

selected index generating means (2402) for generating selected index (IS), and for generating with said randomness verification result (T) new said selected index (IS),

input assembly means of block of length N (301) for assembling from said plaintext sequence (X) multitude of plaintext blocks of length N (X),

by-index corrector generating means of transformer block (3201;

3401) for generating with said selected index (IS) and optionally with said initiatory control subblock of length G (W) multitude of transformer blocks (WT), and for generating with said new said selected index (IS) new said multitude of transformer blocks (WT),

grouping means (2202) for grouping said plaintext block of length N (X) with said transformer block (WT) generating grouped interblock of length N (V),

encrypting-decrypting means (204) for encrypting with said plurality of encryption control subblocks (Z₁-Z₅₂) said grouped interblock of length N (V) and resulting in randomised-encrypted text block of length N (A), multitude of said randomised-encrypted text block of length N (A) make up said candidate randomised-encrypted text sequence (AP),

whereby the system is arranged to self-adapt in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

19. The system of claim 18, further including self-corrector decrypting device (502) that by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generates said plaintext sequence (X) comprising:

first input means of self-corrector decrypting device (513) for receiving said randomised-encrypted text sequence (A),

second input means of self-corrector decrypting device (515) for receiving said encryption key (K),

decryption control subblock generating means (1501) for generating with said encryption key (K) plurality of decryption control subblocks (U₁-U₅₂) and, optionally, said initiatory control subblock of length G (W),

said by-index corrector generating means of transformer block (3201;

3401) for generating optionally with said initiatory control subblock of length G (W) first multitude of transformer blocks (WT), and for generating with extracted selected index (IS) second multitude of transformer blocks (WT),

said input assembly means of block of length N (301) for assembling from said randomised-encrypted text sequence (A) multitude of randomised-encrypted text blocks of length N (A),

said encrypting-decrypting means (204) for decrypting with said plurality of decryption control subblocks (U₁-U₅₂) said randomised-encrypted text block of length N (A) resulting in decrypted interblock of length N (S),

said grouping means (2202) for grouping first multitude of said decrypted interblock of length N (S) with said first multitude of transformer blocks (WT) generating said extracted selected index (IS), and for grouping second multitude of transformer blocks (WT) with second multitude of said decrypted interblocks of length N (S) generating multitude of plaintext blocks of length N (X), said multitude of plaintext blocks of length N (X) make up said plaintext sequence (X),

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A) received by said first input means of self-corrector decrypting device (513).

20. The system of claim 19 wherein said by-index corrector generating means of transformer block (3201;

3401) are implemented in order to generate from said multitude of transformer blocks (WT) nth transformer block (WT) by means of function F²⁵ (IS, said initiatory control subblock of length G (W), nth minus one said randomised-encrypted text block of length N (A)), wherein said IS index selected from the group consisting of said initial selected index (IS) and said alternative selected index (IS) and said extracted selected index (IS), and

said grouping means (2202) include exclusive-OR operation, and

said by-index corrector generating means of transformer block (3201;

3401) implement said function F²⁵ (IS, said initiatory control subblock of length G (W), nth minus one said randomised-encrypted text block of length N (A)) as F²⁷_n (said IS, said initiatory control subblock of length G (W)) XOR said nth minus one said randomised-encrypted text block of length N (A), wherein said n acquires the value of nth, and

said by-index corrector generating means of transformer block (3201;

3401) implement said function F²⁷_n (said IS, said initiatory control subblock of length G (W)) including hash function.

21. The system of claim 19 wherein said by-index corrector generating means of transformer block (3201;

3401) are implemented in order to generate said multitude of transformer blocks (WT) by means of function F³¹ (IS, said initiatory control subblock of length G (W)), wherein said IS index selected from the group consisting of said initial selected index (IS) and said alternative selected index (IS) and said extracted selected index (IS), and

said grouping means (2202) include exclusive-OR operation, and

said by-index corrector generating means of transformer block (3201;

3401) implement said function F³¹ (IS, said initiatory control subblock of length G (W)) in order to generate nth said transformer block (WT) as union of F³²_n (said IS, Wi)=union of ((F³²_n-1 (said IS, Wi) oper+/−

said IS) mod 2^Qi), wherein said Qi value preferably smaller than length of said initiatory control subblock of length G (W), said Wi subblock of order said I of said initiatory control subblock of length G (W) and of length said Qi, said oper+/−

arithmetic operation, and said n takes the value of nth.

22. The system of claim 3, further including

predetermined first length sequence dividing means for dividing said plaintext sequence (X) into multitude of plaintext subsequences of predetermined first length supplying each said plaintext subsequence to said self-corrector randomisation-encryption system (501), and

randomised-encrypted text sequence dividing means of predetermined second length for dividing said randomised-encrypted text sequence (A) into multitude of randomised-encrypted text subsequences of predetermined second length supplying each said randomised-encrypted text subsequence to said self-corrector decrypting device (502).

23. The system of claim 22 wherein said randomness verifying means (603) verify randomness of said candidate randomised-encrypted text sequence (AP) implementing randomness test wherein said randomness test includes dividing said candidate randomised-encrypted text sequence (AP) into 20000 bit subblocks and checking monobit test, poker test, runs test and long run test with each said 20000 bit subblock,

wherein said monobit test includes verifying that 9.654<

number of value 1 bits<

10.346,

wherein said poker test includes dividing said 20000 bit subblock into 5000 4 bit segments, and calculating X=(16/5000)*(Σ

[f(I)²])−

5000, wherein said I value from 0 to 15 and said f(I) number of value I segments, and verifying that 1.03<

X<

57.4,

wherein said runs test includes counting the number of runs of bits 0s and 1s of said 20000

bit subblock, wherein said runs number of consecutive bits of the same value, and verifying that 2.267<

=runs of 1<

=2.733, 1079 runs of 2<

=1421, 502<

=runs of 3<

=748, 223<

=runs of 4<

=402, 90<

=runs of 5<

=223, 90<

=runs of 6<

=223,

wherein said long run test includes verifying that there is no said runs of length 34 or more.

24. Data sequence self-corrector randomisation-encryption method (501) for generating an encrypted and random sequence from a plaintext sequence (X) by the use of a freely selectable encryption key (K) comprising the steps of:

(a) correctively randomising-encrypting said plaintext sequence (X) with said encryption key (K) and generating candidate randomised-encrypted text sequence (AP),

(b) verifying randomness of said candidate randomised-encrypted text sequence (AP) based

on a predetermined randomness test and repeating said step (a) as many times as necessary until said candidate randomised-encrypted text sequence (AP) is at random, being supplied said candidate randomised-encrypted text sequence (AP) as randomised-encrypted text sequence (A) when said randomness test indicates that said candidate randomised-encrypted text sequence (AP) is random,

(c) transmitting said randomised-encrypted text sequence (A) via a transmission channel (513),

whereby said randomised-encrypted text sequence (A) corresponds to said plaintext sequence (X),

whereby said randomized-encrypted text sequence (A) is encrypted,

whereby the confusion and diffusion of values of said randomised-encrypted text sequence (A) is ensured.

25. The method of claim 24 wherein said step (a) of correctively randomising-encrypting said plaintext sequence (X) with said encryption key (K) includes the steps of:

(d) generating signature from said plaintext sequence (X) and assembling said signature to

said plaintext sequence (X) and making up signed plaintext sequence (XF),

(e) correcting said signed plaintext sequence (XF) resulting in modified signed plaintext sequence (XM),

(f) providing randomising-encrypting means (102) that with said encryption key (K) randomise-encrypt said modified signed plaintext sequence (XM) and generate said candidate randomised-encrypted text sequence (AP),

whereby the method is arranged to adapt said plaintext sequence (X) in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

26. The method of claim 25, further including self-correcting decrypting steps that by

making use of said encryption key (K) with said randomised-encrypted text sequence (A) generate said plaintext sequence (X) comprising:

(g) providing decrypting means (104) that with said encryption key (K) decrypt said randomised-encrypted text sequence (A) and generate decrypted text sequence (XD),

(h) correcting said decrypted text sequence (XD) and resulting in suggested plaintext sequence (XP),

(I) generating generated signature of included plaintext sequence segment in said suggested

plaintext sequence (XP) and repeating said step (h) as many times as necessary until said generated signature corresponds to included signature in said suggested plaintext sequence (XP), and supplying said included plaintext sequence segment in said suggested plaintext sequence (XP) as said plaintext sequence (X) when said generated signature corresponds to said included signature,

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A).

27. The method of claim 26 wherein said step (e) in order to correct said signed plaintext sequence (XF) makes use of function F¹ (said signed plaintext sequence (XF)), said step (h) in order to correct said decrypted text sequence (XD) makes use of function F² (said decrypted text sequence (XD)), and

said step (e) implements said function F¹ (said signed plaintext sequence (XF)) as F^1′

(XL,CR)=union of ((XLj oper+/−

CR) mod 2%), wherein said XL subblock of length L of sequence selected from the group consisting of said signed plaintext sequence (XF) and previous said modified signed plaintext sequence (XM), said L value preferably smaller than length selected from the group consisting of length of said modified signed plaintext sequence (XM) and length of said signed plaintext sequence (XF), said CR number of repetitions of said steps (e) and (f), said oper+/−

arithmetic operation, and said XLj subblock of order said j of said XL and of length said Qj,

said step (h) implements said function F² (said decrypted text sequence (XD)) as F^2′

(XG,CD)=union of ((XGk oper−

/+ CD) mod 2^Qi), wherein said XG subblock of length said L of sequence selected from the group consisting of said decrypted text sequence (XD) and previous said suggested plaintext sequence (XP), said CD number of repetitions of said step (h), said oper−

/+ reverse arithmetic operation to said oper+/−

, said XGk subblock of order said k of said XG and of length said Qj,

said Qj value preferably smaller than said L.

28. The method of claim 24 wherein said step (a) of correctively randomising-encrypting said plaintext sequence (X) with said encryption key (K) includes the steps of:

(d) generating signature from said plaintext sequence (X) and assembling said signature to said

plaintext sequence (X) and resulting in signed plaintext sequence (XF),

(e) generating with said encryption key (K) candidate control block (KC),

(f) providing randomising-encrypting means (102) that with said candidate control block (KC) randomise-encrypt said signed plaintext sequence (XF) and generate said candidate randomised-encrypted text sequence (AP),

whereby the method is arranged to adapt said candidate control block (KC) in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

29. The method of claim 28, further including self-correcting decrypting steps that by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generate said plaintext sequence (X) comprising:

(g) said step (e) of generating with said encryption key (K) said candidate control block (KC),

(h) providing decrypting means (104) that with said candidate control block (KC) decrypt

said randomised-encrypted text sequence (A) and generate suggested plaintext sequence (XP),

(I) generating generated signature of included plaintext sequence segment in said suggested

plaintext sequence (XP) and repeating said steps (g) and (h) as many times as necessary until said generated signature corresponds to included signature in said suggested plaintext sequence (XP), and supplying said included plaintext sequence segment in said suggested plaintext sequence (XP) as said plaintext sequence (X) when said generated signature corresponds to said included signature,

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A).

30. The method of claim 29 wherein said step (e) in order to generate said candidate control block (KC) makes use of function F³ (said encryption key (K)), and

said step (e) implements said function F³ (said encryption key (K)) as function F⁴(CR, said control block encryption key (K)), wherein said CR selected from the group consisting of number of repetitions of said steps (e) and (f) and number of repetitions of said steps (g) and (h), and said function F⁴(CR, said encryption key (K))=union of F⁷ (said CR, Ki)=union of ((Ki oper+/−

said CR) mod 2^Qi), wherein said Qi value preferably smaller than length of said encryption key (K), said Ki subblock of order said I of said encryption key (K) and of length said Qi, and said oper+/−

arithmetic operation.

31. The method of claim 24 wherein said step (a) of correctively randomising-encrypting said plaintext sequence (X) with said encryption key (K) includes the steps of:

(d) generating signature from said plaintext sequence (X) and assembling said signature to

said plaintext sequence (X) making up signed plaintext sequence (XF),

(e) generating with said encryption key (K) plurality of encryption control subblocks (Z₁-Z₅₂)

and, optionally, initiatory control subblock of length G (W),

(f) assembling said signed plaintext sequence (XF) into multitude of plaintext blocks of length N (X),

(g) correctingly generating multitude of transformer blocks (WT) optionally with said initiatory control subblock of length G (W),

(h) grouping each said plaintext block of length N (X) with corresponding said transformer

block (WT) and generating grouped interblock of length N (V),

(I) providing encrypting-decrypting means (204) that with said plurality of encryption control subblocks (Z₁-Z₅₂) encrypt said grouped interblock of length N (V) and result in randomised-encrypted text block of length N (A), multitude of said randomised-encrypted text block of length N (A) make up said candidate randomised-encrypted text sequence (AP),

whereby the method is arranged to self-adapt in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

32. The method of claim 31, further including self-correcting decrypting steps that by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generate said plaintext sequence (X) comprising:

(j) generating with said encryption key (K) plurality of decryption control subblocks (U₁-U₅₂)

and, optionally, said initiatory control subblock of length G (W),

(k) assembling said randomised-encrypted text sequence (A) into multitude of said randomised-encrypted text block of length N (A),

(l) said step (g) of correctingly generating said multitude of transformer blocks (WT) optionally with said initiatory control subblock of length G (W),

(m) providing said encrypting-decrypting means (204) that with said plurality of decryption

control subblocks (U₁-U₅₂) decrypt said randomised-encrypted text block of length N (A) and result in decrypted interblock of length N (S),

(n) grouping said decrypted interblock of length N (S) with corresponding said transformer

block (WT) and generating said plaintext block of length N (X), multitude of said plaintext block of length N (X) make up suggested plaintext sequence (XP),

(o) generating generated signature of included plaintext sequence segment in said suggested

plaintext sequence (XP) and repeating said steps (l), (m) and (n) as many times as necessary until said generated signature corresponds to included signature in said suggested plaintext sequence (XP), and supplying said included plaintext sequence segment in said suggested plaintext sequence (XP) as said plaintext sequence (X) when said generated signature corresponds to said included signature,

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A).

33. The method of claim 32 wherein said steps (g) and (l) of correctingly generating multitude of transformer blocks (WT) in order to generate nth said transformer block (WT) of said multitude of transformer blocks (WT) make use of function F⁸ (said initiatory control subblock of length G (W), nth minus one said randomised-encrypted text block of length N (A)), and

said steps (h) and (n) of grouping make use of exclusive-OR operation, and

said steps (g) and (l) implement said function F⁸ (said initiatory control subblock of length G (W), nth minus one said randomised-encrypted text block of length N (A)) as F¹⁰_n(CR, said initiatory control subblock of length G (W)) XOR said nth minus one said randomised-encrypted text block of length N (A), wherein said n takes the value of nth, and said CR selected from the group consisting of number of repetitions of said steps (g), (h) and (I), and number of repetitions of said steps (l), (m) and (n), and

said steps (g) and (l) implement said function F¹⁰_n (CR, said initiatory control subblock of length G (W)) including at random number generator.

34. The method of claim 32 wherein said steps (g) and (l) of correctingly generating multitude of transformer blocks (WT) in order to generate said multitude of transformer blocks (WT) make use of function F¹⁴ (said initiatory control subblock of length G (W)), and

said steps (h) and (n) of grouping make use of exclusive-OR operation, and

said steps (g) and (l) implement said function F¹⁴ (said initiatory control subblock of length G (W)) for nth said transformer block (WT) as F¹⁵_n (CR, said initiatory control subblock of length G (W)), wherein said CR selected from the group consisting of number of repetitions of said steps (g), (h) and (I), and number of repetitions of said steps (l), (m) and (n), and

said steps (g) and (l) implement said function F¹⁵₅ (CR, said initiatory control subblock of length G (W)) including hash function.

35. The method of claim 24 wherein said step (a) of correctively randomising-encrypting said plaintext sequence (X) with said encryption key (K) includes the steps of:

(d) generating selected index (IS),

(e) correcting said plaintext sequence (X) according to said selected index (IS) and resulting

in by-index modified plaintext sequence (XI),

(f) providing randomising-encrypting means (102) that with said encryption key (K) randomise-encrypt said selected index (IS) and said by-index modified plaintext sequence (XI) and generate said candidate randomised-encrypted text sequence (AP),

whereby the method is arranged to adapt said plaintext sequence (X) in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

36. The method of claim 35, further including self-correcting decrypting steps that by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generate said plaintext sequence (X) comprising:

(g) providing decrypting means (104) that with said encryption key (K) decrypt said randomised-encrypted text sequence (A) and generate extracted selected index (IS) and decrypted plaintext sequence (XD),

(h) correcting according to said extracted selected index (IS) said decrypted plaintext sequence (XD) and resulting in said plaintext sequence (X),

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A).

37. The method of claim 36 wherein said step (e) for correcting said plaintext sequence (X) makes use of function F¹⁷ (said selected index (IS), said plaintext sequence (X)), and said step (h) for correcting said decrypted plaintext sequence (XD) makes use of function F¹⁹ (said extracted selected index (IS), said decrypted plaintext sequence (XD)), and

said step (e) implements said function F¹⁷ (said selected index (IS), said plaintext sequence (X)) as F^17′

(said selected index (IS), XL)=union of F¹⁸ (said selected index (IS), XLj)=union of ((XLj oper+/−

said selected index (IS)) mod 2^Qi), wherein said XL subblock of length L of sequence selected from the group consisting of said plaintext sequence (X) and previous said by-index modified plaintext sequence (XI), said L value preferably smaller than length selected from the group consisting of length of said plaintext sequence (X) and length of said by-index modified plaintext sequence (XI), said oper+/−

arithmetic operation, and said XLj subblock of order said j of said XL and of length said Qj, and

said step (h) implements said function F¹⁹ (said extracted selected index (IS), said decrypted plaintext sequence (XD)) as F^19′

(said extracted selected index (IS), XG)=union of F²⁰ (said extracted selected index (IS), XGk)=union of ((XGk oper−

/+ said extracted selected index (IS)) mod 2%), wherein said XG subblock of length said L of said decrypted plaintext sequence (XD), said oper−

/+reverse arithmetic operation to said oper+/−

, said XGk subblock of order said k of said XG and of length said Qj, and

said Qj value smaller than said L.

38. The method of claim 24 wherein said step (a) of correctively randomising-encrypting said plaintext sequence (X) with said encryption key (K) includes the steps of:

(d) generating initial selected index (IS) and alternative selected index (IS),

(e) generating with said control block encryption key (K) and said initial selected index (IS), initial by-index

control block (KI), and according to said alternative selected index (IS), alternative by-index control block (KI),

(f) providing randomising-encrypting means (102) that randomise-encrypt said alternative selected index (IS) with said initial by-index control block (KI), and said plaintext sequence (X) with said alternative by-index control block (KI), and generate said candidate randomised-encrypted text sequence (AP),

whereby the method is arranged to adapt said alternative by-index control block (KI) in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

39. The method of claim 38, further including self-correcting decrypting steps that by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generate said plaintext sequence (X) comprising:

(g) said step (e) of generating with said encryption key (K) and said initial selected index (IS), said initial by-index control block (KI), and according to extracted alternative selected index (IS), said alternative by-index control block (KI),

(h) providing decrypting means (104) that decrypt said randomised-encrypted text sequence (A) and with said initial by-index control block (KI) result in said extracted alternative selected index (IS), and with said alternative by-index control block (KI) extracted result in said plaintext sequence (X),

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A).

40. The method of claim 39 wherein said steps (e) and (g) for generating said initial by-index control block (KI) and said alternative by-index control block (KI) make use of function F²¹ (IS, said encryption key (K)), wherein said IS index selected from the group consisting of said initial selected index (IS) and said alternative selected index (IS) and said extracted alternative selected index (IS), and

said steps (e) and (g) implement said function F²¹ (IS, block encryption key (K)) as union of F²⁴ (said IS, Kj)=union of ((Kj oper+/−

said IS) mod 2^Qj), wherein said Qj value preferably smaller than length of said encryption key (K), said Kj subblock of order said j of said encryption key (K) and of length said Qj, and said oper+/−

arithmetic operation.

41. The method of claim 24 wherein said step (a) of correctively randomising-encrypting said plaintext sequence (X) with said encryption key (K) includes the steps of:

(d) generating with said encryption key (K) plurality of encryption control subblocks (Z₁-Z₅₂) and, optionally, initiatory control subblock of length G (W),

(e) assembling said plaintext sequence (X) in multitude of plaintext blocks of length N (X),

(f) generating selected index (IS),

(g) by-index correctingly generating, optionally with said initiatory control subblock of length G (W), first multitude of transformer blocks (WT) and, with said selected index (IS), second multitude of transformer blocks (WT),

(h) grouping said selected index (IS) with said first multitude of transformer blocks (WT) and said multitude of plaintext blocks of length N (X) with said second multitude of transformer blocks (WT), generating multitude of grouped interblocks of length N (V),

(I) providing encrypting-decrypting means (204) that with said plurality of encryption control subblocks (Z₁-Z₅₂) encrypt said grouped interblock of length N (V) and result in randomised-encrypted text block of length N (A), multitude of said randomised-encrypted text block of length N (A) make up said candidate randomised-encrypted text sequence (AP),

whereby the method is arranged to self-adapt in order to maximise confusion and diffusion of values in said randomised-encrypted text sequence (A).

42. The method of claim 41, further including self-correcting decrypting steps that by making use of said encryption key (K) with said randomised-encrypted text sequence (A) generate said plaintext sequence (X) comprising:

(j) generating with said encryption key (K) plurality of decryption control subblocks (U₁-U₅₂) and, optionally, said initiatory control subblock of length G (W),

(k) assembling said randomised-encrypted text sequence (A) in multitude of said randomised-encrypted text block of length N (A),

(l) said step (g) of by-index correctingly generating, optionally with said initiatory control subblock of length G (W), said first multitude of transformer blocks (WT) and, with extracted selected index (IS), said second multitude of transformer blocks (WT),

(m) providing said encrypting-decrypting means (204) that with said plurality of decryption control subblocks (U₁-U₅₂) decrypt said randomised-encrypted text block of length N (A) and result in decrypted interblock of length N (S),

(n) grouping first multitude of said decrypted interblock of length N (S) with said first multitude of transformer blocks (WT) and resulting in said extracted selected index (IS), and grouping second multitude of transformer blocks (WT) with second multitude of said decrypted interblock of length N (S) and generating multitude of said plaintext block of length N (X), said multitude of plaintext block of length N (X) make up said plaintext sequence (X),

whereby said plaintext sequence (X) corresponds to said randomised-encrypted text sequence (A).

43. The method of claim 42 wherein said steps (g) and (l) for generating nth said transformer block (WT) make use of function F²⁵ (IS, said initiatory control subblock of length G (W), nth minus one said randomised-encrypted text block of length N (A)), wherein said IS index selected from the group consisting of said selected index (IS) and said extracted selected index (IS), and

said steps (h) and (n) of grouping make use of exclusive-OR operation, and

said steps (g) and (l) implement said function F²⁵ (IS, said initiatory control subblock of length G (W), nth minus one said randomised-encrypted text block of length N (A)) as said initiatory control subblock of length G (W) XOR F²⁹_n (said IS, said nth minus one said randomised-encrypted text block of length N (A)), wherein said n takes the value of nth, and

said steps (g) and (l) implement said function F²⁹_n (said IS, said nth minus one said randomised-encrypted text block of length N (A)) as union of F³⁰_N (said IS, Ai_n-1)=union of ((Ai_n-1 oper+/−

said IS) mod 2^Qi), wherein said Qi value preferably smaller than length of said nth minus one said randomised-encrypted text block of length N (A), said Ai_n-1 subblock of order said I of said nth minus one said randomised-encrypted text block of length N (A) and of length said Qi, and said oper+/−

arithmetic operation.

44. The method of claim 42 wherein said steps (g) and (l) for generating transformer block (WT) make use of function F³¹ (IS, said initiatory control subblock of length G (W)), wherein said IS index selected from the group consisting of said selected index (IS) and said extracted selected index (IS), and

said steps (h) and (n) of grouping make use of exclusive-OR operation, and

said steps (g) and (l) implement said function F³¹ (IS, said initiatory control subblock of length G (W)) including hash function.

45. The method of claim 26, further including the steps

(p) dividing said plaintext sequence (X) into multitude of plaintext subsequences of predetermined first length and supplying each said plaintext subsequence as said plaintext sequence (X) to said self-correcting randomising-encrypting steps, and

(q) dividing said randomised-encrypted text sequence (A) into multitude of randomised-encrypted text subsequences of predetermined second length and supplying each said randomised-encrypted text subsequence as said randomised-encrypted text sequence (A) to said self-correcting decrypting steps.

46. The method of claim 45 wherein said step of verifying randomness verifies randomness of said candidate randomised-encrypted text sequence (AP) by making use of randomness test wherein said randomness test includes dividing said candidate randomised-encrypted text sequence (AP) into 20000 bit subblocks and checking monobit test, poker test, runs test and long run test with each said 20000 bit subblock,

wherein said monobit test includes verifying that 9.654<

number of value 1 bits<

10.346,

wherein said poker test includes dividing said 20000 bit subblock into 5000 4 bit segments, and calculating X=(16/5000)*(Σ

[f(i)²])−

5000, wherein said i value from 0 to 15 and said f(i) number of value i segments, and verifying that 1.03<

X<

57.4,

wherein said runs test includes counting the number of runs of bits 0s and 1s of said 20000 bit subblock, wherein said runs number of consecutive bits of the same value, and verifying that 2.267<

=runs of 1<

=2.733, 1079 runs of 2<

=1421, 502<

=runs of 3<

=748, 223<

=runs of 4<

=402, 90<

=runs of 5<

=223, 90<

=runs of 6<

=223,

wherein said long run test includes verifying that there is no said runs of length 34 or more.