Encryption method using synchronized continuously calculated pseudo-random key

• US 20030115449A1
• Filed: 12/03/2002
• Published: 06/19/2003
• Est. Priority Date: 12/18/2001
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Yochim, Blair
• Granted Patent: US 7,248,699 B2
• Time in Patent Office: Days
• US Class Current: 713/153
• CPC Class Codes: H04L 2209/56 Financial cryptography, e.g. electronic payment or e-cash
• 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/12 Transmitting and receiving encryption devices synchronised or initially set up in a particular manner

Abstract

Prior methods of encryption can be broken by sufficiently powerful decryption techniques. The present invention provides a method of making decryption practically extremely difficult. It involves having synchronized processors continuously calculate a defined pseudo-random number and communicate the message by adding it to the sequentially continuously calculated number.

Claims

1. A method of securely communicating a digital message between first and second information processing devices, the method comprising the steps of:

i) said first and second information processing devices each sequentially calculating and storing the digits of a pre-determined pseudo-random number, wherein such calculations are continuous and synchronized;

ii) said first information processing device adding said digital message to said sequentially calculated digits of said pre-determined pseudo-random number to form an encrypted message;

iii) said first information processing device communicating said encrypted message to said second information processing device; and

iv) said second information processing device subtracting said sequentially calculated pre-determined pseudo-random number from said encrypted message to thereby obtain said digital message.

2. A method according to claim 1 wherein said pre-determined pseudo-random number is an irrational number.

3. A method according to claim 2 wherein said irrational number is a square root of a prime number.

4. A method according to claim 3, wherein said irrational number is the square root of 2.

5. A method according to claim 1 wherein said first and second processors are selected so that the speed of said calculations is maximized.

6. A method according to claim 1 wherein predetermined digits of said calculated pseudo-random number are not communicated.

7. A method according to claim 1 wherein additional pseudo-random digits are inserted between said calculated digits.

8. A method according to claim 1 comprising the further step of, periodically sending stay-online messages to each of said first and second processors from a third secure processor and having one of said first and second processor ceasing calculating said number if it does not receive a stay-online message.

9. A method according to claim 1 wherein said processors are synchronized by each processor comparing in real-time its calculated digits with the received digits in order to self-adjust its calculations speed.

10. A method according to claim 1 wherein said processors are synchronized by sending synchronizing digits without message data.

11. A method according to claim 1 wherein said digits are monitored to ensure their pseudo-randomness is maintained and, if it is determined that the digits are no longer within an acceptable statistical range, then the transmission is halted.

78. A computer program comprising computer program code means adapted to perform all the steps of claim 1 when said program is run on a computer.

79. A computer program as claimed in claim 78 embodied on a computer readable medium.

12. A data processing system for securely communicating a digital message between first and second information processing devices, said data processing system comprising:

i) a digitally-communicative network comprising said first and second information processing devices;

ii) means for said first and second information processing devices to each sequentially calculate and store the digits of a pre-determined pseudo-random number, wherein such calculations are continuous and synchronized;

iii) means for said first information processing device to add said digital message to said sequentially calculated pre-determined pseudo-random number to form an encrypted message;

iv) means for said first information processing device to communicate said encrypted message to said second information processing device; and

v) means for said second information processing device to subtract said sequentially calculated pre-determined pseudo-random number from said encrypted message to thereby obtain said digital message.

13. A data processing system according to claim 12, wherein said pre-determined pseudo-random number is an irrational number.

14. A data processing system according to claim 13, wherein said irrational number is a square root of a prime number.

15. A data processing system according to claim 14, wherein said irrational number is the square root of 2.

16. A data processing system according to claim 12 wherein said first and second processors are selected so that the speed of said calculations is maximized.

17. A data processing system according to claim 12 wherein predetermined digits of said calculated pseudo-random number are not communicated.

18. A data processing system according to claim 12 wherein additional pseudo-random digits are inserted between said calculated digits.

19. A data processing system according to claim 12 further comprising means for periodically sending stay-online messages to each of said first and second processors from a third secure processor and having one of said first and second processor ceasing calculating said number if it does not receive a stay-online message.

20. A data processing system according to claim 12 wherein said processors are synchronized by each processor comparing in real-time its calculated digits with the received digits in order to self-adjust its calculations speed.

21. A data processing system according to claim 12 wherein said processors are synchronized by sending synchronizing digits without message data.

22. A data processing system according to claim 12 further comprising means for monitoring said calculated digits to ensure their pseudo-randomness is maintained and, if it is determined that the digits are no longer within an acceptable statistical range, then halting the transmission.

23. A method of securely communicating a digital message between first and second information processing devices, the method comprising the steps of:

i) said first and second information processing devices each sequentially calculating and storing the digits of a pre-determined pseudo-random number, wherein such calculations are continuous and synchronized;

ii) said first information processing device modifying said sequentially calculated digits of said pre-determined pseudo-random number as a function ƒ

of said digital message to form an encrypted message;

iii) said first information processing device communicating said encrypted message to said second information processing device; and

iv) said second information processing device modifying said encrypted message by the inverse ƒ

<sup>−

1</sup> of said function ƒ

to thereby obtain said digital message.

24. A method according to claim 23 wherein said pre-determined pseudo-random number is an irrational number.

25. A method according to claim 24 wherein said irrational number is a square root of a prime number.

26. A method according to claim 25, wherein said irrational number is the square root of 2.

27. A method according to claim 23 wherein said first and second processors are selected so that the speed of said calculations is maximized.

28. A method according to claim 23 wherein predetermined digits of said calculated pseudo-random number are not communicated.

29. A method according to claim 23 wherein additional pseudo-random digits are inserted between said calculated digits.

30. A method according to claim 23 comprising the further step of, periodically sending stay-online messages to each of said first and second processors from a third secure processor and having said first and second processor ceasing calculating said number if it does not receive a stay-online message.

31. A method according to claim 23 wherein said processors are synchronized by each processor comparing in real-time its calculated digits with the received digits in order to self-adjust its calculations speed.

32. A method according to claim 23 wherein said processors are synchronized by sending synchronizing digits without message data to assist with ensuring synchronization.

33. A method according to claim 23 wherein said digits are monitored to ensure their pseudo-randomness is maintained and, if this monitoring process determines that the digits are no longer within an acceptable statistical range, then the transmission is halted.

34. A method according to claim 23 wherein said function ƒ

is addition.

35. A method according to claim 23 wherein said function ƒ

is an encryption algorithm.

36. A data processing system for securely communicating a digital message between first and second information processing devices, said data processing system comprising:

i) a digitally-communicative network comprising said first and second information processing devices;

ii) means for said first and second information processing devices to each sequentially calculate and store the digits of a pre-determined pseudo-random number, wherein such calculations are continuous and synchronized;

iii) means for said first information processing device to modify said sequentially calculated digits of said pre-determined pseudo-random number as a function ƒ

of said digital message to form an encrypted message;

iv) means for said first information processing device to communicate said encrypted message to said second information processing device; and

v) means for said second information processing device to modify said encrypted message by the inverse ƒ

<sup>−

1</sup> of said function ƒ

to thereby obtain said digital message.

37. A data processing system according to claim 36, wherein said pre-determined pseudo-random number is an irrational number.

38. A data processing system according to claim 37, wherein said irrational number is a square root of a prime number.

39. A data processing system according to claim 38, wherein said irrational number is the square root of 2.

40. A data processing system according to claim 36 wherein said first and second processors are selected so that the speed of said calculations is maximized.

41. A data processing system according to claim 36 wherein predetermined digits of said calculated pseudo-random number are not communicated.

42. A data processing system according to claim 36 wherein additional pseudo-random digits are inserted between said calculated digits.

43. A data processing system according to claim 36 further comprising means for periodically sending stay-online messages to each of said first and second processors from a third secure processor and having one of said first and second processor ceasing calculating said number if it does not receive a stay-online message.

44. A data processing system according to claim 36 wherein said processors are synchronized by each processor comparing in real-time its calculated digits with the received digits in order to self-adjust its calculations speed.

45. A data processing system according to claim 36 wherein said processors are synchronized by sending synchronizing digits without message data.

46. A data processing system according to claim 36 further comprising means for monitoring said calculated digits to ensure their pseudo-randomness is maintained and, if it is determined that the digits are no longer within an acceptable statistical range, then halting the transmission.

47. A data processing system according to claim 36 wherein said function ƒ

is addition.

48. A data processing system according to claim 36 wherein said function ƒ

is an encryption algorithm.

49. Apparatus for use in information processing devices for securely communicating a digital message between first and second information processing devices over a communications network apparatus comprising:

i) means for use by said first and second information processing devices to each sequentially calculate and store the digits of a pre-determined pseudo-random number, wherein such calculations are continuous and synchronized;

ii) means for use by said first information processing device to add said digital message to said sequentially calculated pre-determined pseudo-random number to form an encrypted message;

iii) means for use by said first information processing device to communicate said encrypted message to said second information processing device; and

iv) means for use by said second information processing device to subtract said sequentially calculated pre-determined pseudo-random number from said encrypted message to thereby obtain said digital message.

50. Apparatus according to claim 49, wherein said pre-determined pseudo-random number is an irrational number.

51. Apparatus according to claim 50, wherein said irrational number is a square root of a prime number.

52. Apparatus according to claim 51, wherein said irrational number is the square root of 2.

53. Apparatus according to claim 49 wherein said first and second processors are selected so that the speed of said calculations is maximized.

54. Apparatus according to claim 49 wherein predetermined digits of said calculated pseudo-random number are not communicated.

55. Apparatus according to claim 49 wherein additional pseudo-random digits are inserted between said calculated digits.

56. Apparatus according to claim 49 further comprising means for periodically sending stay-online messages to each of said first and second processors from a third secure processor and having one of said first and second processor ceasing calculating said number if it does not receive a stay-online message.

57. Apparatus according to claim 49 wherein said processors are synchronized by each processor comparing in real-time its calculated digits with the received digits in order to self-adjust its calculations speed.

58. Apparatus according to claim 49 wherein said processors are synchronized by sending synchronizing digits without message data.

59. Apparatus according to claim 49 further comprising means for monitoring said calculated digits to ensure their pseudo-randomness is maintained and, if it is determined that the digits are no longer within an acceptable statistical range, then halting the transmission.

60. Apparatus for use in each data processing device of a data processing system for securely communicating a digital message between first and second information processing devices comprising:

i) means for said first and second information processing devices to each sequentially calculate and store the digits of a pre-determined pseudo-random number, wherein such calculations are continuous and synchronized;

ii) means for said first information processing device to modify said sequentially calculated digits of said pre-determined pseudo-random number as a function ƒ

of said digital message to form an encrypted message;

iii) means for said first information processing device to communicate said encrypted message to said second information processing device; and

iv) means for said second information processing device to modify said encrypted message by the inverse ƒ

<sup>−

1</sup> of said function ƒ

to thereby obtain said digital message.

61. Apparatus according to claim 60, wherein said predetermined pseudo-random number is an irrational number.

62. Apparatus according to claim 61, wherein said irrational number is a square root of a prime number.

63. Apparatus according to claim 62, wherein said irrational number is the square root of 2.

64. Apparatus according to claim 60 wherein said first and second processors are selected so that the speed of said calculations is maximized.

65. Apparatus according to claim 60 wherein predetermined digits of said calculated pseudo-random number are not communicated.

66. Apparatus according to claim 60 wherein additional pseudo-random digits are inserted between said calculated digits.

67. Apparatus according to claim 60 further comprising means for periodically sending stay-online messages to each of said first and second processors from a third secure processor and having one of said first and second processor ceasing calculating said number if it does not receive a stay-online message.

68. Apparatus according to claim 60 wherein said processors are synchronized by each processor comparing in real-time its calculated digits with the received digits in order to self-adjust its calculations speed.

69. Apparatus according to claim 60 wherein said processors are synchronized by sending synchronizing digits without message data.

70. Apparatus according to claim 60 further comprising means for monitoring said calculated digits to ensure their pseudo-randomness is maintained and, if it is determined that the digits are no longer within an acceptable statistical range, then halting the transmission.

71. Apparatus according to claim 60 wherein said function ƒ

is addition.

72. Apparatus according to claim 60 wherein said function ƒ

is an encryption algorithm.

73. Apparatus for use in information processing devices for securely communicating a digital message between first and second information processing devices over a communications network apparatus comprising:

a computer-readable signal-bearing medium;

i) code means in the medium for use by said first and second information processing devices to each sequentially calculate and store the digits of a pre-determined pseudo-random number, wherein such calculations are continuous and synchronized;

ii) code means in the medium for use by said first information processing device to add said digital message to said sequentially calculated pre-determined pseudo-random number to form an encrypted message;

iii) code means in the medium for use by said first information processing device to communicate said encrypted message to said second information processing device; and

iv) code means in the medium for use by said second information processing device to subtract said sequentially calculated pre-determined pseudo-random number from said encrypted message to thereby obtain said digital message.

74. Apparatus according to claim 73, wherein the medium is a recordable data storage medium.

75. Apparatus according to claim 74, wherein the medium is selected from the group consisting of magnetic optical, biological and atomic data storage media.

76. Apparatus according to claim 75, wherein the medium is a modulated carrier signal.

77. Apparatus according to claim 76, wherein the signal is a transmission over the Internet.