The present invention generally relates to secure communications, and in particular to such communications which vary the timing of communication signals.
Often times, when U.S. Diplomats are working outside the continental United States (OCONUS), communications are closely monitored by the visited country. The monitoring is done to identify transmissions that are considered harmful to local governments. When United States personal are operating in these countries, they need to send their information back to the US using encryption to protect their mission. There are, of course, other instances where securely transmitted communications are very useful. The sending of encrypted messages either over-the-air or over a terrestrial link can bring undesired attention to the sender, which could have damaging consequences. Therefore it is useful to have a method for sending secure communications that do not appear to be secure.
One embodiment of the present invention provides a system for encoding data in a signal, comprising: at least one signal carrier; an overt persistent digital channel containing a host signal and carried on the at least one signal carrier; a non-persistent channel encoded onto the host signal by timing variation of the host signal, the non-persistent channel including access data for accessing hidden information in the host signal. The term “non-persistent” means that without specific knowledge as to how to receive and process the channel, the data in the non-persistent channel is lost.
The access data may be selected from the group consisting of a stencil, a code book and a decryption key. The host signal may be an intelligible work of nominal information. The host signal may be encrypted and the access data may be an encryption key. The encrypted host signal may be encoded with a code book to reduce entropy, prior to encoding the host signal with the non-persistent channel. The timing variation may be less than a level of timing stability for detecting and capturing the data stream.
The system may further comprise: a processor coupled to receive the host signal from the at least one signal carrier; and a high stability oscillator (HSO) producing a reference signal coupled to the processor for use in reading pulse timing variations of the host signal, wherein the reference signal has a stability greater than the level of timing variations of the host signal; wherein the timing variations of the host signal are smaller than the sampling period for detecting and capturing the data stream. The host signal may be a digital data stream, and the timing variations may be pulse timing variations.
Another embodiment of the present invention provides a method for sending data on a signal carrier, comprising: modulating a host signal in an overt persistent channel to create a non-persistent channel including access data, using timing variations, wherein the access data provides means for accessing hidden data in the host signal; reading timing variations from the host signal for separating the access data; and accessing the hidden data using the access data.
The access data may be selected from the group consisting of a stencil, a code book and a decryption key. The host signal may be an intelligible work of nominal information.
The host signal may be encrypted and the access data is an encryption key. The method may further comprise encoding the host signal with a code book to reduce entropy, prior to encoding the host signal with the non-persistent channel.
The pulse timing variation may be smaller than the sampling period for detecting and capturing the host signal. The host signal may be a digital data stream, and the timing variations may be pulse timing variations. The host signal may be an analog signal.
The present invention is illustratively shown and described in reference to the accompanying drawings, in which:
This application describes three methods for sending secure messages. In the methods described, two channels are used to send the message. The first channel is an overt channel, which carries a message that is openly detectable. The second channel is a non-persistent channel, which includes data or keys for accessing information hidden in the open channel. The term “non-persistent” means that without specific knowledge as to how to receive and process the channel, the data in the non-persistent channel is lost. To create the non-persistent channel, an overt channel is generated with minimal timing jitter as limited by a high stability oscillator (HSO) and other system constraints. Non-persistent data is then encoded onto the nominally jitter-free overt channel by precisely modulating the signal timing. The reference signal has a stability of 10−15 part of a second as opposed to the de facto industry standard of Cesium, which is 10−12. An example of implementing a non-persistent channel is described in copending U.S. Patent Application for METHOD AND SYSTEM FOR NON-PERSISTENT COMMUNICATION, filed on the same day herewith, and hereby incorporated herein in its entirety.
Using a modulation scheme such as a Gaussian Clock Dither Modulation scheme and the HSO, the data in the non-persistent channel is imperceptible to anyone not possessing a comparable oscillator tuned to the appropriate frequency. The keys are extracted as they are received and applied directly to the cipher text message, and then the keys are discarded once used. The message and the keys are transmitted and processed in a streaming fashion.
Anyone intercepting these transmissions, not using an HSO with comparable stability, will lose the non-persistent channel, upon reception. This is because the granularity of the received transmission will have insufficient time resolution to detect the non-persistent channel.
The first method 10 is a steganographic approach, which is illustrated in
Host message 14 is also provided to a digital stencil module 16. Digital stencil module 16 accepts both the message 18 to be securely transmitted and the host message 14 as inputs, and it outputs a digital stencil 20 identifying the secure message 18 in the host message 14. Digital stencil 20 is a virtual overlay used to identify either the characters, in the case of an ASCII host message 14, or the bits, in the case of a digital host message 14, to be used to decode the host message and reconstruct the actual message 18 that was transmitted. Stencil 20 is then used in a timing modulator 22 to modulate the timing of pulses in host message 14 to form non-persistent channel 13 and thereby transmit the stencil 20. This nominal encoding 10 and decoding 11 is graphically illustrated in
The ability of this embodiment to send the digital stencil along with the message on the non-persistent channel because the stencil is virtually imperceptible reduces risk that a stencil might be intercepted or otherwise compromised. Additionally, the message does not appear to be encrypted because the host message simply appears to be a nominal text.
Again, the ability to send the code book along with the message on the non-persistent channel reduces the risk of discovery of the codebook because the code book is virtually imperceptible for the reasons described above. Additionally, the message does not appear to be encrypted.
The implementation of
The present invention is introduced using examples and particular embodiments for descriptive purposes. Although a variety of examples are presented to show how various configurations can be employed to achieve the desired improvements, these particular embodiments are only illustrative and not intended in any way to restrict the inventions presented.
The present application, METHOD OF ENCRYPTION OBFUSCATION is being filed on the same day as and in conjunction with related applications: METHOD FOR DETECTING TIME DELAYS IN NON-PERIODIC SIGNALS; METHOD AND SYSTEM FOR NON-PERSISTENT COMMUNICATION; and METHOD AND SYSTEM FOR NON-PERSISTENT REAL-TIME ENCRYPTION KEY DISTRIBUTION, which applications all share some common inventors herewith, and the contents of which are al hereby incorporated herein in their entirety.
This application claims priority from U.S. Provisional Patent Application Ser. No. 61/988,409, filed May 5, 2014, U.S. Provisional Patent Application Ser. No. 61/988,416, filed May 5, 2014, U.S. Provisional Patent Application Ser. No. 61/988,423, filed May 5, 2014, and U.S. Provisional Patent Application Ser. No. 61/988,418, filed May 5, 2014, all of which are incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
3899772 | Mead et al. | Aug 1975 | A |
3916307 | Hekimian | Oct 1975 | A |
4221931 | Seiler | Sep 1980 | A |
4631600 | Fukui | Dec 1986 | A |
5077761 | Tokunaga | Dec 1991 | A |
5228062 | Bingham | Jul 1993 | A |
5254843 | Hynes | Oct 1993 | A |
5699370 | Kaniwa et al. | Dec 1997 | A |
5774508 | Kallman et al. | Jun 1998 | A |
6163209 | Myers | Dec 2000 | A |
6396877 | Hollenbach et al. | May 2002 | B1 |
7133647 | Dent | Nov 2006 | B2 |
7200014 | Hawkes et al. | Apr 2007 | B1 |
7269261 | Jennings | Sep 2007 | B1 |
7497637 | Brandstein | Mar 2009 | B2 |
8283911 | Bierer | Oct 2012 | B1 |
8363774 | Lin et al. | Jan 2013 | B2 |
8498197 | Kent | Jul 2013 | B2 |
8717147 | Bae et al. | May 2014 | B2 |
9509538 | Al-dweik et al. | Nov 2016 | B1 |
20020054605 | Aizawa | May 2002 | A1 |
20020063933 | Maeda | May 2002 | A1 |
20020071556 | Moskowitz | Jun 2002 | A1 |
20040125952 | Alattar | Jul 2004 | A1 |
20050135501 | Chang et al. | Jun 2005 | A1 |
20050286649 | Redfern | Dec 2005 | A1 |
20060036411 | Nagai | Feb 2006 | A1 |
20060239501 | Petrovic | Oct 2006 | A1 |
20060239503 | Petrovic | Oct 2006 | A1 |
20070064849 | May | Mar 2007 | A1 |
20070279784 | Yamamoto | Dec 2007 | A1 |
20080090588 | Mizugaki et al. | Apr 2008 | A1 |
20080175115 | Muraoka | Jul 2008 | A1 |
20080253232 | Irie | Oct 2008 | A1 |
20090196419 | Tapster | Aug 2009 | A1 |
20090287837 | Felsher | Nov 2009 | A1 |
20100265139 | Beadle et al. | Oct 2010 | A1 |
20110228943 | Amirtharajan | Sep 2011 | A1 |
20110299678 | Deas | Dec 2011 | A1 |
20120106380 | Vaidyanathan et al. | May 2012 | A1 |
20130108042 | Yin | May 2013 | A1 |
20150318982 | Kowalevicz et al. | Nov 2015 | A1 |
20150318985 | Graceffo et al. | Nov 2015 | A1 |
20150319061 | Kowalevicz | Nov 2015 | A1 |
20160336977 | Kowalevicz et al. | Nov 2016 | A1 |
Entry |
---|
“U.S. Appl. No. 15/155,490, Preliminary Amendment filed Jun. 30, 2016”, 6 pgs. |
“U.S. Appl. No. 14/704,916, Ex Parte Quayle Action mailed Nov. 5, 2015”, 8 pgs. |
“U.S. Appl. No. 14/704,916, Preliminary Amendment filed Jul. 15, 2015”, 3 pgs. |
“U.S. Appl. No. 14/704,923, Non Final Office Action mailed Dec. 2, 2016”, 25 pgs. |
“U.S. Appl. No. 14/704,929, Preliminary Amendment filed Jul. 15, 2015”, 3 pgs. |
“U.S. Appl. No. 14/704,916, Notice of Allowance mailed Feb. 18, 2016”, 17 pgs. |
“U.S. Appl. No. 14/704,916, Response filed Jan. 5, 2016 to Ex Parte Quayle Action mailed Nov. 5, 2015”, 6 pgs. |
“U.S. Appl. No. 15/155,490, Preliminary Amendment filed May 16, 2016”, 3 pgs. |
“U.S. Appl. No. 14/704,923, Examiner Interview Summary mailed Mar. 30, 2017”, 3 pgs. |
“U.S. Appl. No. 14/704,923, Response filed Apr. 3, 2017 to Non-Final Office Action mailed Dec. 2, 2016”, 8 pgs. |
“U.S. Appl. No. 14/704,929, Notice of Allowance mailed Mar. 1, 2017”, 8 pgs. |
“U.S. Appl. No. 15/155,490, Non Final Office Action dated Apr. 13, 2017” 10 pgs. |
“U.S. Appl. No. 15/581,014, Preliminary Amendment filed 4-2817”, 9 pgs. |
Number | Date | Country | |
---|---|---|---|
20160267815 A1 | Sep 2016 | US |
Number | Date | Country | |
---|---|---|---|
61988418 | May 2014 | US | |
61988416 | May 2014 | US | |
61988409 | May 2014 | US | |
61988423 | May 2014 | US |