SYSTEMS/METHODS OF ENCRYPTION

• US 20140237259A1
• Filed: 11/12/2013
• Published: 08/21/2014
• Est. Priority Date: 01/24/2012
• Status: Abandoned Application

• Current Assignee: Odyssey Wireless, Inc.
• Original Assignee: Odyssey Wireless, Inc.
• Inventors: Karabinis, Peter D.
• Application Number:
  US14/078,041
• Publication Number:
  US 20140237259A1
• Time in Patent Office: Days
• US Class Current: 713/189
• CPC Class Codes: H04B 7/0617 for beam forming
• CPC Class Codes: H04B 7/1851 Systems using a satellite or space-based relay H04B7/18508, H04B7/18521 take precedence; providing specific services H04B7/18523 - H04B7/18576
• CPC Class Codes: H04K 1/00 Secret communication
• CPC Class Codes: H04K 3/25 based on characteristics of target signal or of transmission as countermeasure against surveillance H04K3/827, e.g. using direct sequence spread spectrum or fast frequency hopping spread spectrum techniques H04B1/69
• CPC Class Codes: H04K 3/827 using characteristics of target signal or of transmission as countermeasure against jamming H04K3/25, e.g. using direct sequence spread spectrum or fast frequency hopping spread spectrum techniques H04B1/69
• CPC Class Codes: H04L 2209/12 Details relating to cryptographic hardware or logic circuitry
• CPC Class Codes: H04L 25/067 providing soft decisions, i.e. decisions together with an estimate of reliability H04L25/068 and H04L25/069 take precedence; sequence estimation techniques H04L25/03178
• CPC Class Codes: H04L 9/00 Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
• CPC Class Codes: H04L 9/0637 Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM]
• CPC Class Codes: H04W 28/0236 radio quality, e.g. interference, losses or delay
• CPC Class Codes: H04W 72/23 in the downlink direction of a wireless link, i.e. towards a terminal

Abstract

Encryption is provided via an algorithm that maps a block of N input bits onto a block of M output bits, wherein M≧N. Encryption also may be provided in accordance with bit/bandwidth expansion, wherein M>N. At least one bit of the block of M output bits may be pseudo-randomly generated in accordance with a key and a statistical distribution. The statistical distribution may be any desired/preferred statistical distribution (including Gaussian or truncated Gaussian) and the key may be of any desired length that is deemed appropriate to satisfy un-breakability.

Claims

1. A method of providing encryption;

the method comprising;

providing a block of N input bits that are to be encrypted to a processor;

wherein N≧

1; and

providing encryption by the processor by mapping the block of N input bits into a block of M output bits, wherein M>

N;

wherein at least one bit of the block of M output bits is pseudo-randomly generated by a state machine responsive to a key that is provided at an input of the state machine; and

wherein said providing encryption by the processor comprises providing bit expansion via said mapping of the block of N input bits into the block of M output bits, wherein M>

N.

2. The method according to claim 1, wherein said state machine comprises a pseudo-random number generator that is configured to provide a sequence of output values responsive to the key and in accordance with a statistical distribution.

3. The method according to claim 2, wherein the pseudo-random number generator comprises a number P of pseudo-random number generators;

P≧

2;

the key comprises a number K of keys;

wherein K<

P, K=P or K>

P; and

wherein each one of the K keys provides an input to at least one of the P pseudo-random number generators.

4. The method according to claim 3, wherein the number P of pseudo-random number generators provide a respective number of P outputs, a number U of which are jointly processed therebetween to provide an aggregate value that depends upon at least one of the U outputs that are jointly processed therebetween;

wherein U≦

P.

5. The method according to claim 4, wherein said jointly processed therebetween comprises selecting, changing a magnitude and/or summing.

6. The method according to claim 3, wherein a first one of the P pseudo-random number generators is configured to operate in accordance with a first statistical distribution and a second one of the P pseudo-random number generators is configured to operate in accordance with a second statistical distribution that differs from the first statistical distribution.

7. The method according to claim 3, wherein a first one of the K keys comprises a first number of bits and a second one of the K keys comprises a second number of bits;

wherein the second number of bits differs from the first number of bits.

8. The method according to claim 3, wherein P=K=32;

each one of the K keys comprises 32 bits;

each one of the P pseudo-random number generators is configured to operate in accordance with a Gaussian statistical distribution and to provide an output whose value is altered by a multiplicative constant of (1/32)^1/2; and

wherein, following the alteration of each one of the outputs by said multiplicative constant, the outputs are summed therebetween to provide an aggregate value.

9. The method according to claim 3, wherein P=K;

each one of the P pseudo-random number generators is configured to operate in accordance with a statistical distribution that is common therebetween and to provide an output;

a number U of the P outputs that are provided by the respective P pseudo-random number generators is selected;

U≦

P;

a value of each one of the U outputs that are selected is altered by a multiplicative constant of (1/U)^1/2; and

wherein, following the alteration of each one of the U outputs that are selected by the multiplicative constant of (1/U)^1/2, the U outputs are summed therebetween to provide an aggregate value.

10. The method according to claim 3, wherein the P pseudo-random number generators are configured to operate in accordance with P respective statistical distributions and to provide P respective outputs;

a number U of the P respective outputs that are provided by the P pseudo-random number generators is selected;

U≦

P;

a value of at least one of the U outputs that are selected is altered; and

wherein, following the alteration of the at least one of the U outputs that are selected, the U outputs are jointly processed therebetween to provide an aggregate value.

11. The method according to claim 1, further comprising:

generating independently of the block of N input bits the at least one bit of the block of M output bits that is pseudo-randomly generated by the state machine responsive to the key.

12. The method according to claim 11, further comprising:

generating independently of the block of N input bits each one of the M bits of the block of M output bits.

13. The method according to claim 1, further comprising:

including in the block of M output bits at least one bit that is generated independently of any bit of the block of N input bits; and

including in the block of M output bits at least one bit that is generated dependently on at least one bit of the block of N input bits.

14. The method according to claim 1, wherein said providing bit expansion comprises generating a value of M that is at least 10 times greater than N;

M≧

10N.

15. The method according to claim 1, wherein said providing bit expansion comprises generating a value of M that is at least 100 times greater than N;

M≧

100N.

16. The method according to claim 1, wherein said providing bit expansion comprises generating a value of M that is at least 1000 times greater than N;

M≧

1000N.

17. The method according to claim 2, further comprising:

generating a number W of discrete-time waveforms, at least one of which is generated pseudo-randomly, in at least one element thereof, in accordance with said statistical distribution, using said key and using said pseudo-random number generator;

wherein W≧

2^N;

wherein a first waveform of the number W of discrete-time waveforms comprises a number Q₁ of discrete-time samples, a second waveform of the number W of discrete-time waveforms comprises a number Q₂ of discrete-time samples, . . . , and a last waveform of the number W of discrete-time waveforms comprises a number Q_W of discrete-time samples; and

wherein said mapping comprises associating with the block of N input bits at least one of the number W of discrete-time waveforms and using a number of the discrete-time samples thereof to form the block of M output bits.

18. The method according to claim 17, wherein Q₁=Q₂= . . . =Q_W.

19. The method according to claim 17, wherein said associating with the block of N input bits at least one of the number W of discrete-time waveforms and using a number of the discrete-time samples thereof to form the block of M output bits comprises:

associating with the block of N input bits at least one of the number W of discrete-time waveforms and using all of the discrete-time samples thereof to form the block of M output bits.

20. The method according to claim 17, further comprising:

orthogonalizing said number W of discrete-time waveforms and using a respective number W of discrete-time waveforms that are orthogonal therebetween to perform said associating with the block of N input bits at least one of the number W of discrete-time waveforms and using a number of the discrete-time samples thereof to form the block of M output bits.

21. The method according to claim 1, wherein the key comprises an initial key and further comprises an initial time interval and/or an initial number of blocks of N input bits over which the initial key is to be used.

22. The method according to claim 21, wherein the key further comprises a field that specifies an initial value of at least one encryption parameter, an interval of validity for the initial value of the at least one encryption parameter, a methodology for acquiring a new value for the at least one encryption parameter, to be used over a respective new interval of validity once the interval of validity for the initial value of the at least one encryption parameter has expired, and the new interval of validity associated therewith.

23. The method according to claim 21, further comprising:

using the initial key over the initial time interval and/or over the initial number of blocks of N input bits;

refraining from using the initial key outside of the initial time interval and/or outside of the initial number of blocks of N input bits;

receiving a subsequent key to use outside of the initial time interval and/or outside of the initial number of blocks of N input bits; and

using the subsequent key outside of the initial time interval and/or outside of the initial number of blocks of N input bits.

24. The method according to claim 22, wherein the initial value of the at least one encryption parameter comprises a value for N and/or M.

25. The method according to claim 17, wherein the key comprises a field that specifies an initial value of at least one encryption parameter, an interval of validity for the initial value of the at least one encryption parameter, a methodology for acquiring a new value for the at least one encryption parameter, to be used over a respective new interval of validity once the interval of validity for the initial value of the at least one encryption parameter has expired, and the new interval of validity associated therewith.

26. The method according to claim 25, further comprising:

using the initial value of the at least one encryption parameter over the interval of validity thereof;

refraining from using the initial value of the at least one encryption parameter beyond the interval of validity thereof;

using the methodology for acquiring a new value for the at least one encryption parameter and acquiring the new value for the at least one encryption parameter and also acquiring the respective new interval of validity associated therewith; and

using the new value of the at least one encryption parameter over the respective new interval of validity thereof.

27. The method according to claim 25, wherein the initial value of the at least one encryption parameter comprises a value for W, Q₁, Q₂, . . . , and/or Q_W.

28. The method according to claim 4, wherein the key comprises a field that specifies an initial value of at least one encryption parameter, an interval of validity for the initial value of the at least one encryption parameter, a methodology for acquiring a new value for the at least one encryption parameter, to be used over a respective new interval of validity once the interval of validity for the initial value of the at least one encryption parameter has expired, and the new interval of validity associated therewith.

29. The method according to claim 28, further comprising:

using the initial value of the at least one encryption parameter over the interval of validity thereof;

refraining from using the initial value of the at least one encryption parameter beyond the interval of validity thereof;

using the methodology for acquiring a new value for the at least one encryption parameter and acquiring the new value for the at least one encryption parameter and also acquiring the respective new interval of validity associated therewith; and

using the new value of the at least one encryption parameter over the respective new interval of validity thereof.

30. The method according to claim 28, wherein the initial value of the at least one encryption parameter comprises a value that specifies P, U, K, an aspect of the pseudo-random number generator, a number of bits of the key to be used and/or the statistical distribution.

31. The method according to claim 1, further comprising:

providing the block of M output bits to a decipher to be decrypted; and

decrypting by the decipher by performing an inverse mapping on the block of M output bits and reconstructing the block of N input bits via the inverse mapping.

32. The method according to claim 31, wherein the inverse mapping comprises a matched filter operation.

33. The method according to claim 1, further comprising:

associating a waveform with the block of M output bits and transmitting the waveform by a transmitter.

34. The method according to claim 33, further comprising:

receiving a waveform at a receiver responsive to said associating a waveform with the block of M output bits and transmitting the waveform by a transmitter;

processing the received waveform at the receiver and recovering the block of M output bits;

providing the block of M output bits to a decipher to be decrypted; and

decrypting by the decipher by performing an inverse mapping on the block of M output bits and reconstructing the block of N input bits via the inverse mapping.

35. The method according to claim 34, wherein the inverse mapping comprises a matched filter operation.

36. A system of providing encryption;

the system comprising;

a processor that is configured to encrypt a block of N input bits by mapping the block of N input bits into a block of M output bits, wherein N≧

1 and M>

N;

wherein at least one bit of the block of M output bits is pseudo-randomly generated by a state machine responsive to a key that is provided at an input of the state machine; and

wherein the processor is configured to provide encryption by providing bit expansion via said mapping of the block of N input bits into the block of M output bits, wherein M>

N.

37. The system according to claim 36, wherein said state machine comprises a pseudo-random number generator that is configured to provide a sequence of output values responsive to the key and in accordance with a statistical distribution.

38. The system according to claim 37, wherein the pseudo-random number generator comprises a number P of pseudo-random number generators;

P≧

2;

the key comprises a number K of keys;

wherein K<

P, K=P or K>

P; and

wherein each one of the K keys provides an input to at least one of the P pseudo-random number generators.

39. The system according to claim 38, wherein the number P of pseudo-random number generators provide a respective number of P outputs, a number U of which are jointly processed therebetween to provide an aggregate value that depends upon at least one of the U outputs that are jointly processed therebetween;

wherein U≦

P.

40. The system according to claim 39, wherein said jointly processed therebetween comprises selecting at least one of the number U of outputs, changing a magnitude of at least one of the number U of outputs and/or summing at least two of the number U of outputs.

41. The system according to claim 38, wherein a first one of the P pseudo-random number generators is configured to operate in accordance with a first statistical distribution and a second one of the P pseudo-random number generators is configured to operate in accordance with a second statistical distribution that differs from the first statistical distribution.

42. The system according to claim 38, wherein a first one of the K keys comprises a first number of bits and a second one of the K keys comprises a second number of bits that differs from the first number of bits.

43. The system according to claim 38, wherein P=K=32;

each one of the K keys comprises 32 bits;

each one of the P pseudo-random number generators is configured to operate in accordance with a Gaussian statistical distribution and to provide an output whose value is altered by a multiplicative constant of (1/32)^1/2; and

wherein, following the alteration of each one of the outputs by said multiplicative constant, the outputs are summed therebetween to provide an aggregate value.

44. The system according to claim 38, wherein P=K;

each one of the P pseudo-random number generators is configured to operate in accordance with a statistical distribution that is common therebetween and to provide an output;

a number U of the P outputs that are provided by the respective P pseudo-random number generators is selected;

U≦

P;

a value of each one of the U outputs that are selected is altered by a multiplicative constant of (1/U)^1/2; and

wherein, following the alteration of each one of the U outputs that are selected by the multiplicative constant of (1/U)^1/2, the U outputs are summed therebetween to provide an aggregate value.

45. The system according to claim 38, wherein the P pseudo-random number generators are configured to operate in accordance with P respective statistical distributions and to provide P respective outputs;

a number U of the P respective outputs that are provided by the P pseudo-random number generators is selected;

U≦

P;

a value of at least one of the U outputs that are selected is altered; and

wherein, following the alteration of the at least one of the U outputs that are selected, the U outputs are jointly processed therebetween to provide an aggregate value.

46. The system according to claim 36, wherein the at least one bit of the block of M output bits that is pseudo-randomly generated by the state machine responsive to the key is generated independently of the block of N input bits.

47. The system according to claim 46, wherein each one of the M bits of the block of M output bits is generated independently of the block of N input bits.

48. The system according to claim 36, wherein the block of M output bits includes at least one bit that is generated independently of any bit of the block of N input bits and also includes at least one bit that is generated dependently on at least one bit of the block of N input bits.

49. The system according to claim 36, wherein said providing bit expansion comprises generating a value of M that is at least 10 times greater than N;

M≧

10N.

50. The system according to claim 36, wherein said providing bit expansion comprises generating a value of M that is at least 100 times greater than N;

M≧

100N.

51. The system according to claim 36, wherein said providing bit expansion comprises generating a value of M that is at least 1000 times greater than N;

M≧

1000N.

52. The system according to claim 37, wherein the processor is further configured to generate a number W of discrete-time waveforms, at least one of which is generated pseudo-randomly, in at least one element thereof, in accordance with said statistical distribution, using said key and using said pseudo-random number generator;

wherein W≧

2^N;

wherein a first waveform of the number W of discrete-time waveforms comprises a number Q₁ of discrete-time samples, a second waveform of the number W of discrete-time waveforms comprises a number Q₂ of discrete-time samples, . . . , and a last waveform of the number W of discrete-time waveforms comprises a number Q_W of discrete-time samples; and

wherein said mapping comprises associating with the block of N input bits at least one of the number W of discrete-time waveforms and using a number of the discrete-time samples thereof to form the block of M output bits.

53. The system according to claim 52, wherein Q₁=Q₂= . . . =Q_W.

54. The system according to claim 52, wherein said associating with the block of N input bits at least one of the number W of discrete-time waveforms and using a number of the discrete-time samples thereof to form the block of M output bits comprises:

associating with the block of N input bits at least one of the number W of discrete-time waveforms and using all of the discrete-time samples thereof to form the block of M output bits.

55. The system according to claim 52, wherein the processor is further configured to orthogonalize said number W of discrete-time waveforms and to use a respective number W of discrete-time waveforms that are orthogonal therebetween to perform said associating with the block of N input bits at least one of the number W of discrete-time waveforms and using a number of the discrete-time samples thereof to form the block of M output bits.

56. The system according to claim 36, wherein the key comprises an initial key and further comprises an initial time interval and/or an initial number of blocks of N input bits over which the initial key is to be used.

57. The system according to claim 56, wherein the key further comprises a field that specifies an initial value of at least one encryption parameter, an interval of validity for the initial value of the at least one encryption parameter, a methodology for acquiring a new value for the at least one encryption parameter, to be used over a respective new interval of validity once the interval of validity for the initial value of the at least one encryption parameter has expired, and the new interval of validity associated therewith.

58. The system according to claim 56, wherein the initial key is only used over the initial time interval and/or over the initial number of blocks of N input bits;

and wherein a subsequent key is received and used outside of the initial time interval and/or outside of the initial number of blocks of N input bits.

59. The system according to claim 57, wherein the initial value of the at least one encryption parameter comprises a value for N and/or M.

60. The system according to claim 52, wherein the key comprises a field that specifies an initial value of at least one encryption parameter, an interval of validity for the initial value of the at least one encryption parameter, a methodology for acquiring a new value for the at least one encryption parameter, to be used over a respective new interval of validity once the interval of validity for the initial value of the at least one encryption parameter has expired, and the new interval of validity associated therewith.

61. The system according to claim 60, wherein the initial value of the at least one encryption parameter is used only over the interval of validity thereof;

the methodology for acquiring a new value for the at least one encryption parameter is used to acquire the new value for the at least one encryption parameter and the new interval of validity associated therewith; and

wherein the new value of the at least one encryption parameter is used over the respective new interval of validity thereof.

62. The system according to claim 60, wherein the initial value of the at least one encryption parameter comprises a value for W, Q₁, Q₂, . . . , and/or Q_W.

63. The system according to claim 39, wherein the key comprises a field that specifies an initial value of at least one encryption parameter, an interval of validity for the initial value of the at least one encryption parameter, a methodology for acquiring a new value for the at least one encryption parameter, to be used over a respective new interval of validity once the interval of validity for the initial value of the at least one encryption parameter has expired, and the new interval of validity associated therewith.

64. The system according to claim 63, wherein the initial value of the at least one encryption parameter is used only over the interval of validity thereof;

the methodology for acquiring a new value for the at least one encryption parameter is used to acquire the new value for the at least one encryption parameter and the respective new interval of validity associated therewith; and

wherein the new value of the at least one encryption parameter is used over the respective new interval of validity thereof.

65. The system according to claim 63, wherein the initial value of the at least one encryption parameter comprises a value that specifies P, U, K, an aspect of the pseudo-random number generator, a number of bits of the key to be used and/or the statistical distribution.

66. The system according to claim 36, further comprising:

a decipher that is configured to receive the block of M output bits and to decrypt the block of M output bits by performing an inverse mapping on the block of M output bits and reconstructing the block of N input bits via the inverse mapping.

67. The system according to claim 66, wherein the inverse mapping comprises a matched filter operation.

68. The system according to claim 36, further comprising:

a transmitter that is configured to associate a waveform with the block of M output bits and to transmit the waveform thus transmitting encrypted information.

69. The system according to claim 68, further comprising:

a receiver that is configured to receive and process the waveform;

to recover the block of M output bits; and

to provide the block of M output bits to a decipher for decryption; and

a decipher that is configured to perform an inverse mapping on the block of M output bits; and

to reconstruct the block of N input bits via the inverse mapping.

70. The system according to claim 69, wherein the inverse mapping comprises a matched filter operation.

71. The system according to claim 68, wherein the transmitter comprises a wireless transmitter and/or a wireline transmitter.