


Optical Cryptography 158
chill writes: "In Cryptonomicon, Neil Stephenson wrote about Bell Labs' research into using static, or chaotic signals to mask communications. A message would be generated, then the signal masked in noise. Someone on the other end would subtract out the noise to get the signal. Works great if both ends have the exact same noise. Now, Jia-ming Liu, professor of electrical engineering at UCLA, is giving a presentation on doing essentially the same thing using OC-48 (2.5 Gbps) optical circuits. The presentation will be at the upcoming Optical Fiber Communications Conference and Exhibit. There is an article covering this and some other nice advances in optical over in Wired."
Noise (Score:2)
-Sean
Nope: You've just given the bad guy your key. (Score:3, Informative)
The trick to all noise-masking techniques is for YOU and YOUR PARTNER to have the same set of noise and NOBODY ELSE to have it.
Use a well-known public noise source and a link to that source becomes the key which decrypts all your traffic.
Oops!
Re:Nope: You've just given the bad guy your key. (Score:2)
Re:Nope: You've just given the bad guy your key. (Score:2, Insightful)
Re:Security through obscurity. (Score:2, Insightful)
It's really, really hard to mask a legitimate messages in random noise and hope that the bad guy won't be able to differentiate the two.
Use BWT instead of LZ for even more diffusion (Score:4, Interesting)
How does one hide messages in reandom noise, though? Would it work to LZ-compress them, to make them appear random?
LZ+Huffman (i.e. deflate, the core of gzip and pkzip) works, but you get more compression in a Burrows-Wheeler based scheme such as bzip2 [redhat.com]. More compression => more entropy per coded symbol => more resistance to known plaintext attacks.
Asymptotic rate is not good enough. (Score:1)
It doesn't mean that it is superior for finite length data sets, and it may be that BWT and subsequent coding is also universal.
And yes, there are other compression schemes that are essentially better. Lempel-ziv has a certain approach to the entropy rate for certain reasonable classes of sources, markov models.
That rate is not as good as it could be---there is a theoretical limit (Rissanen) that says how good any estimator could get.
There *ARE* compression algorithms that do achieve that limit, and LZ does not, and they are proven to be universal too. (Context Tree Weighting).
They are not used in commonly available hacker-tool programs because they run slower than gzip or bzip2 right now. But the professionals know about them.
Re:Asymptotic rate is not good enough. (Score:1, Insightful)
Ok...
So you're saying Rissanen gave the theoretical limit for how quickly a compression algorithm asymptotically approaches maximum entropy in its output, and Context Tree Weighing and other algorithms actually reach that limit?
Or is this only proven for certain classes of input, like Markov models?
Re:Asymptotic rate is not good enough. (Score:2, Informative)
Roughly, Rissanen proved how well any estimator for probabilities that has a total of "k" free parameters that you can use as a coding thing (Kraft inequality and all that).... the extra coding redundancy, i.e. number of bits about N*H where H is the entroypy rate is k/2 log N.
So if you have a source with k free parameters and your receiver is in the same model class and can adapt those 'k' parameters, you will get a redundancy of k/2 log N.
That assumes you know the class.
If you don't know anything about the class it's also been proven that there is no single unviversal appraoch to the limit, i.e. the thing you're asking for in the first part is impossible to get.
For certain classes of input like Markov models, yes the CTW and other methods achieve the Rissanen limit and Lempel-Ziv does not, it has a clearly slower rate of convergence.
You might wonder whether or not LZ does achieve that limit on some other class of sources and CTW does not, but the class of sources that is LZ's is defined very implicitly and it's not very obvious.
There's been nothing found theoretically and in imost practical tests the modeling algorithms (CTW and prediction by partial matching---PPM) seem to be better on compression performance both finite length and asymptotically.
Interestingly the BWT and the subsequent coding of the transformed signal (BWT is only half of the bzip2 algorithm!) turns out to be sort of like a rough approximation to a context-tree kind of method (PPM or CTW) but with some extra glitches.
The advantage is that it's computationally fast.
Re:Asymptotic rate is not good enough. (Score:1)
Do you have any idea how these compression algorithms fare on typical realworld input, like text, executables and graphic images?
Who needs better encryption? (Score:1)
128-bit public key encryption might not be enough for their secret messages.
British American Link during World War II (Score:3, Informative)
Check out the NSA's explanation [nsa.gov]
Previous Slashdot Story [slashdot.org]
A Shortcut... (Score:5, Informative)
steganography ? (Score:3, Insightful)
where a message is hidden in noise (the image) then when the image (noise) is subtracted the message appears.
are we still trying to re-invent the wheel here or am i missing something ?
Re:steganography ? (Score:3, Informative)
Re:steganography ? (Score:2, Insightful)
If you merely have to superimpose two lightwaves to steganize (sp?) a message, it all goes in realtime no matter how much bandwidth the lightwave carries.
It's not a digital technique. It uses analog lightwaves.
So that technique can be used in e.g. optical fibres, so nobody can intercept messages by physically eavesdropping on the fibre.
I don't think it's intended for home computers. It sounds more like a simple way for telephone companies to protect all the data in optic fibres without going in and encrypting the individual IP packages and such.
Re:steganography ? (Score:1)
Re:steganography ? (Score:1)
If you have 10 kilobytes of data to send, using stegenography, you may have to distribute that 10 kbytes across 1 or more megabytes of documents. Using noise encryption, you are only sending 10 kbytes of data.
Of course there is noting saying that you can not combine methods.
I do seem seem to recall Tom Clancy using a variation on this idea in several of his novels, where the CIA burns two CDs giving an agent one, and keeping one at the agency. The agent encrypts his message using a tool that destructively reads the CD as it is encoding the message. The CIA gets the encoded message and destructively reads their own CD to decode the message. The source for the two CDs is a cosmic ray counter, or something like that.
Then again, I could be wrong.
-Rusty
Re:steganography ? (Score:2)
What next? `They flew to Mars...just like that guy out of that movie with Arnie in it`?
Seems like a waste of noise... (Score:3, Interesting)
Re:Seems like a waste of noise... (Score:2, Informative)
--sam
Re:Seems like a waste of noise... (Score:1, Informative)
Light consists of waves, and when two waves are placed on top of each other, they form a new wave that takes no more space or bandwidth than the first one.
Re:Seems like a waste of noise... (Score:2, Insightful)
This wave would take up more bandwidth than either of the other two.
Re:Seems like a waste of noise... (Score:1, Informative)
Re:Seems like a waste of noise... (Score:2)
Just like when I XOR two streams of data together they take no more space than one stream? Kind of tough to pick that apart again. /dev/null doesn't get any bigger when I throw a stream of data in it either.
Assuming the waves are assembled constructively, receiving them in the same bandwidth requires double the signal/noise ratio that receiving one wave would require, because your equipment needs to be just as sensitive but handle twice the signal amplitude. See Shannon's Law [bldrdoc.gov].
Cryptonomicon (Score:2, Funny)
Or is it just that I'm studying World War II?
I liked that book (Score:1)
Re:I liked that book (Score:1)
I can't wait to hear from slashdot that mathematics was invented in this book.
How is this different from (Score:1, Interesting)
OTP: person a adds agreed upon random noise to the plaintext. person b subtracts the same random noise from the cyphertext.
This: person a adds agreed upon random noise to the singal. person b subtracts the same random noise from the encrypted signal.
Seems the only difference is what level of the stack you apply the OTP.
Re:How is this different from (Score:2, Informative)
Re:How is this different from (Score:1)
I.E. it is a psuedo-random stream that is reproducable at the other end.
So it violates one of the rules of a true OTP system
The "noise" generation is a function of the laser setup and can be replicated by another source.
With a known plaintext attack you could easily compute the desired "noise" and then find the appropriate laser configuration to create that noise and read the messages.
Other than being analog rather than a program and really fast, I don't see it as being all that secure.
This isn't about the OTP (Score:2, Informative)
Yes, the actual encryption being performed is similar to a OTP. That's not the news here, though. The problem with OTPs has always been how to generate and distribute the pads. Typically, this requires transmission via some separate secure link (for instance, a courier), and leaves you with a limited amount of pad-- once you run out, you need to go through the whole rigamarole again.
This is a technique by which a key can be generated and distributed without that messy step. In the end, the data's basically being put through the same encryption process as one would use with a OTP, but it's being done with a random signal that's being generated on the fly over a wire between two geographically separated points, but is (ideally) still secure even if somebody eavesdrops.
Quantum cryptography is another example of a nifty concept that (in the end) relies on the old OTP technique. A random signal is generated and measured in two different places by measuring quantum characteristics of entangled particles. This is the cool part. Then that signal, which is truly random, can't be intercepted, and doesn't require a courier to deliver, is used as a OTP, which is the bread-and-butter part.
You might as well criticize a story on the development of fusion powered cars because the car still rests on old-fashioned wheels... which've been around for sooo many years.
Re:It is not (Score:1)
This is a one time pad (Score:3, Informative)
--sam
No chaotic communication is *not* a one time pad. (Score:4, Informative)
It relies on the effect of chaotic synchronization. That sort of amazing fact that even though you can have a dynamical system that is continuously unstable in 'some degrees of freedom' making up the chaotic system the combination system of transmitter and receiver can still be stable in the 'transverse' direciton to the synchronization manifold.
All communication systems work by synchronization whether implicitly or explicitly. Here you will explicitly have chaotic oscillators as both transmitters and receivers. Yes, radio is like this too, you have a linear oscillator in the transmitting tower and an oscillator in your RF circuit in your receiver and their electric fields will synchronize the receiver's oscillator to the transmitter.
The trick is how to add in modulation and demodulation that does not destabilize the system and still permit reconstruction of the transmitted information.
All chaotic systems essentially have some sort of nonlinear feedback. The trick that seems to work very frequently with optical dynamics is to mix in some of the transmitted signal coming over the channel with the self-regenerated system at the receiver. In previous work with fiber optic ring laser it really was literally mixing optical signals, in the thing I did it was mixing in electro-optic electrical feedback signals; more like mixing intensities.
It turns out that a fairly generic form of dynamics often seems to work.
I worked on this project from a theoretical modeling level with Jia-Ming Liu's group at UCLA.
(We're at UCSD not UCLA).
I'm not sure what this new work is about but in the version that I did there was no significant role for the dynamics or properties of the fiber optics in the creation of the chaos or the demodulation.
It will a very significant amount of engineering to make this fully practical and find all the good properties but that's true for every advance.
Re:No chaotic communication is *not* a one time pa (Score:1, Interesting)
So you mean there is a chaotic system A at the sender's end, and another chaotic system B at the receiver's end, of the same type?
And that they would diverge if left to themselves, but are continously synchronized with each other, so both A and B generate approximately the same signal (the same "sequence of encryption keys", if this had been digital encryption).
And that an eavesdropper, with his own chaotic system C, cannot synchronize it with A and B?
Re:No chaotic communication is *not* a one time pa (Score:3, Informative)
For communication it is one-way synchronization with unidirectional coupling, not the mutual coupling which is more well known in math and physics.
The important point is that the chaos and the 'keys' and the message can all be combined nonlinearly.
Eavesdropper C would need the same chaotic system with the same settings up to some tolerance. Notice that robustness to attack is thus inversely proportional to tolerance to mismatch.
The issue of security is not directly addressed by chaotic communication.
Chaos may be an opportunity to do things other than classical encipherment. It may be like CDMA spreading a signal over a wider frequency band. It may allow you to use cheaper devices or those running past their "normal" tolerance bounds if the requirement for linearity is no longer a factor. It may mean lots of different things; the general point is a greatly increased flexibility and the potential to try widely different kinds of transmission methods. Linear signal transmission is kind of boring, there's AM, FM and minor variations upon those.
However, it may be that some digital ciphers have properties similar to chaotic systems and people are starting to investigate this connection at a different level. that is more mathematics now than communications engineering.
Re:No chaotic communication is *not* a one time pa (Score:1)
It would seem to me that this encryption is less useful then schemes which use one-way algorithms, such as public key cryptography. While these can be attacked by brute force, it is easy to make the encryption strong enough that brute-force is impractical even for a government. This leaves them vulnerable only to key-stealing which can be guarded against by regularly generating new keys.
So all in all, I am not sure I see the use in this. It might be useful for ubiquitous encryption because it adds no lag to the process do to it's unique relience on hardware, but I am not sure why ubiquitous encryption on the network level is useful, anyway. It might be useful for governments, but I doubt it for the reasons I gave above. I can't see any way it would be useful to cypherpunks and the like...
Anybody care to explain to me in more detail what this is useful for?
Re:No chaotic communication is *not* a one time pa (Score:1)
This isn't quite my bag, but it seems this is essentially a OTP of possibly infinite length which doesn't require you to send the entire pad to the other guy. The only way to break a OTP(if it is truly random) is to have the OTP and the only way to get the OTP is steal it from one of the parties or if they reuse it. If the pad is infinite and random, all you can do is hope they have to resynch sometime and be waiting for it.
Chaotic crypto crackable, OTPs not (Score:3, Interesting)
By contrast, a theoretical one-time pad is theoretically provably uncrackable - if you really do have uncorrelated random bits for your pad, and you really only use them once, it's perfectly secure, and even knowing N-1 bits of a message tells you nothing about the other bit. In practice, source of random numbers aren't always perfect, and sometimes people cheat and reuse pads - the NSA's "Venona" crack of Soviet crypto primarily succeeded due to rampant reuse of pads by sloppy crypto users, though I think they also found some non-randomness in the pads that they could exploit a bit. But this optical system guarantees that if you know the initial conditions, you can use the first N-1 bits of a message to predict the next one, and sometimes you may be able to deduce those initial conditions closely enough to crack the system.
have i seen this before? (Score:1)
Is this quantum encryption's working model?
Re:have i seen this before? (Score:2)
QE is based on a handshake protocol in which I send you a message and you send me a confirmation and we use traded information to communicate. It's not THAT different than the current http model - and other models could be used - as I understand it. The different thing about QE is that it cannot be eavesdropped on.
Parties A and B handshake and Wil E. Crackor can listen as the communication stream goes past effectively snorting the information to be hacked at later by whatever means he has access to.
In a quantum event listening to the communication will change them so after we handshake if some one snorts the packets they arrive garbled on the other end. Hence any successful communication is a secure communication. Not easy or cheap to implement but the only method I know of that certifies security in process. If we can talk we are know to be the only one's listening.
Even with extra strong encryption there's not guarantee that some one who's listening doesn't have a copy and a way to break it - eventually.
=tkk
Now it IS open to a "man in the middle attack" I THINK... but only if you have your own quantum generation device. ;)
No it's much different from quantum crypto (Score:2)
Re:have i seen this before? (Score:1)
DMCA (Score:4, Funny)
Security through obscurity (Score:2, Interesting)
The voice module for some of the high end (25+ CD) Pioneer CD changers is able to hear your voice even if the music is blasting. It does this by taking the music that's playing and mixing it into the microphone preamp 180 degrees out of phase, cancelling out most of the music. This isn't perfect, but I've seen it work, and I'm sure it can be adapted to do the same thing here. In fact, any imperfections may even help, due to the fact that you can (probably) tune it and pick up the real signal out of the mess.
Brute force. How random is this random noise? If you can create a similar noise generator, all you have to do is filter out 80% of the crap, and you'll be able to grab the signal. It's like picking out the flashlight from a group of strobes. It's a PITA, but once you cover most of the strobes, you can see the flashlight.
Re:Security through obscurity (Score:1)
Re:Security through obscurity (Score:1)
Person 1 uses noise A to "encrypt" a message and send it to person 2. Person 3 intercepts this message, noise and all. Now if either person sends a message with this same noise through, person 3 would be at least get a fair idea what they were talking about in both messages. This is of course assuming that person 3 knows exactly when this specific communication is going to take place, and there isn't 5 billion different noises to chose from and actually used.
Knowing when the communication takes place shouldn't be that hard if person 3 is watching all the traffic and sees this unintelligble blob all of the sudden.
Another problem is being able to securely make sure only person 2 has all the different noise files.
Re:Security through obscurity (Score:1)
Now if either person sends a message with this same noise through
But the whole point of this method is that that's not going to happen. There's a limitless supply of noise, so no need to reuse it.
Re:Security through obscurity (Score:2)
Actually it does it by *inverting* one of the signals, and then applying some delay to the other signal to account for the propagation time of the sound. You can only make a signal 180 degrees out of phase at a particular frequency.
Re:Security through obscurity (Score:1)
Ah, so you propose LOCATION-based encryption. The real signal is spread across key "real" locations and random noise generators fill in the blanks with simliar level noise. This can work on cellphone bandwidths and other "live" signals. A more sophisticated method would shift key spots around the signal to keep things dynamic.
This could be used for static messages as well as the keypad would be the locations of the actual signal intermixed into noise.
Re:Security through obscurity (Score:1)
Re:Security through obscurity (Score:1)
OC-48 (Score:2, Funny)
Isn't this a bit like 2048-bit encryption? Sure it's a good idea, but the technology requirements are a bit excessive.
Re:OC-48 (Score:2)
There are instances where a DRM plan calls for mirrored FibreChannel RAID sets at very remote locations via Dark Fibre. With the advent of the IP based FibreChannel spec 2048 bit encryption (or better) would be de-rigeure, I'd suspect. IP based FC is supposed to be cheaper and more cross platform since it uses a known, standard protocol that is the basis for the Internet. So, companies may want to send entire machine images through thier OC3 Internet pipe. Now, if you sent that essentially raw data through such hostile territory poorly protected, well, the rest is obvious.
For the masses - no. For the massive, yes.
Soko
Nah - 2048-bit crypto is cheap :-) (Score:1)
But OC48s are still kinda expensive, even though their cheaper cousin, Gigabit Ethernet, has come down to $150 for a PCI board.
Not the same as cryptonomicon. (Score:4, Informative)
The encryption in cryptonomicon was a one time pad. The pad was implemented as a record, but the concept was the same. The fact that the conversation could only last as long as the record and each record was only used once is indicative.
But then, perhaps the lasers could be considered an infinite one-time pad? Of course, if anyone else is listening to the synchronisation codes, couldn't they themselves end up with a synched laser too?
As a form of encryption, this doesn't appear (to me) to be incredibly useful to the average person. It doesn't secure the communication, only the physical connection between the two points. However, it would work for keeping snooping foreign governments from listening in on international traffic on submarine cables. Or nasty pirates from splicing themselves into the cable TV network...
Re:Not the same as cryptonomicon. (Score:1)
There is a finite number of setups for syncing the laser - that is your key - the noise output is simply an function of that syncing and setup.
I would expect that this is by no means secure.
A plaintext attack - sending through a message that you already know the contents of would give you the "noise" and that information could help you determine what kind of syncing setup they are using. - narrowing down your keyspace.
The point here is that OTP rely on truly random key pads where this one is an analog function of the laser syncing setup and so is not really random.
Re:Not the same as cryptonomicon. (Score:1)
Initially sounds like the syncronized Dynamical Systems of the lasers are acting like optical syncronized feedback-shift-registers, and thus are pseudo-random number generators (PRNG's), which are classically not quite as secure as true one-time-pads.
But by using a quantized variant of state variable of a continuous dynamical system as the key, they can, reyling on the Lorenz effect, avoid allowing a surreptious third party syncronizing a non-matched generator. Thus avoiding the deduce-the-PRNG-settings problem.
However, there's still a key exchange problem. You have to have distrbuted matched pairs of these precision feedback lasers with anyone you want to communicate with this way. Hardly public key! In order to get the cost down, I'd hope these are semi-lasers. But if they're mass-produceable, how can I trust the manufacturer to not create more than 2 identical at a time? If they can make them cheap enough and softkeyable, what's to stop NSA from building a Huge Parallel Array of them? (Decades ago, we had a camper-trailer whose key was interchangeable with the Chevy's.)
Didn't we see this somewhere before? (Score:3, Funny)
Why didn't somebody think of this before?
Re:Didn't we see this somewhere before? (Score:2)
Re:Didn't we see this somewhere before? (Score:1)
your sig is the best i've ever seen
Re:Didn't we see this somewhere before? (Score:2)
"Oh yeah...Johnny Mnemonic! Yeah, when he was picking random images for the data to encrypt it. I find it strange that something from such a mediocre movie gets to actually be applied as technology. (Then again, the whole point of the movie was its neat ideas.)"
Ummmm
Re:Didn't we see this somewhere before? (Score:1)
-1 grammar
Re:Didn't we see this somewhere before? (Score:2)
Prediction: GPS encryption validation (Score:1)
Just a thought.
Re:Prediction: GPS encryption validation (Score:1)
Churchill and Roosevelt (Score:1)
You can still see Churchill's phone at the Cabinet War Rooms in London. I don't know if Roosevelt's phone is in a museum or not.
Was this the thing mentioned in Cryptonomicon? I can't remember.
Sigsaly was digital, not analog (Score:1)
NSA Paper [nsa.gov]
Re:Churchill and Roosevelt (Score:1)
quantum cryptography? (Score:1)
How would this compare to quantum crypto? (Score:1)
Slashdot (Score:2, Funny)
Nulls. (Score:3, Interesting)
Even having a small multiple of nulls to significant elements increases the complexity of calculation exponentially. For example, a 1:1 proportion of null bits in 512-bit blocks. The result is a 1024-bit blocked key stream. You can't do any sort of intelligent analysis of the stream unless you can figure out which bits are significant, and there are 2^512 possible permutations of significant and garbage bits for each block.
err... (Score:1)
Key stream? Duhhhhh... data stream.
Pointless, actually... (Score:2, Interesting)
AES/Rijndael is FAST in hardware, a $10 FPGA can do counter mode encryption, fully key agile, at 1.3 Gbps. Why create an algorithm dependant on chaotic laser behavior when you know that you can get cheap encryption which is secure in available hardware.
Re:Pointless, actually... (Score:2)
For fuck's sake, just to fucking do it.
Why do you bother wasting your time posting to slashdot when you're just going to die someday and it's not going to matter?
Besides, your FPGA doesn't exactly fit well into an all-optical switch or router with MEMS or bubble gates that bounce light around, does it? But it's easy enough to add or subtract the optical noise optically without having to waste a bunch of fucking time demodulating the signal, feeding it through a (comparitavely) ass-slow FPGA, modulating it again then sending it down the pipe. Latency is the issue, not whether or not your toaster has more crypto in it for the buck. Besides that, it would likely scale more cheaply than something like an FPGA solution. Bump the speed 10x - suddenly you need thousands of dollars worth of FPGA's, yet you probably only need a slightly faster oscillator of some sort in your chaotic noise generator - maybe a $5 difference or similar. And did you consider that you can probably use the SAME noise generators to cover your entire optical network - one pair in each device - while you'd need a pair of encrypting/decrypting FPGA's at either end of a link? Think of a 48 port switch and you've just saved an enormous amount of money.
~GoRK
Re:Pointless, actually... (Score:2)
Bad crypto, impractical, but still cool (Score:2)
mbkennel's posting [slashdot.org] has some good discussion on it. Chaotic crypto has usually been cracked any time anybody's seriously attacked an implementation of it, and this approach sounds like it's designed to be *easier* to crack than the average chaotic system, but it's still interesting stuff.
random noise (Score:2, Informative)
There's a couple things to be aware of in this system. First, it does not increase the amount of information sent. Here's an example:
Here's the message: 0 1 1 0 1 0 0 1
Here's the noise : 1 0 1 1 0 1 0 0
Then XOR them : 1 1 0 1 1 1 0 1
Notice that the message does not get any longer by encrypting it. As long as you know the noise, then you can take the XORed result and find the original message.
Another problem is that a lot of noise isn't really random. If the noise isn't random, then the message can be decrypted. For example, if there is a tendency for the noise to have a pattern or there are long series of 0's, the original message can be decripted without the "noise key". Very few physical processes are actually random (not hits on a website, not sunspots). One of them that is random is radioactive decay.
A wee bit self defeating (Score:2)
Re:A wee bit self defeating (Score:1)
The general idea is that you encrypt a message, or a key to a message using a process that can not be reversed using the publicly available key that you use. You send the encrypted message to the recipient who holds the private key which is the only key that can decrypt the original message.
The problem then becomes verifying that the public key you are using is actually the public key of the recipient. There are two methods to do that. One is a digital fingerprint, effectively a has of the public key that you can validate over the phone or in some other method. (This is a one way method where the fingerprint can not be used to regenerate the public or private key) The other is peer validation. peer validation relly's upon you trusting a third party to act as an authority on the person you are sending data to. So if you trust your cousin to know his cousin, and your cousin has signed his cousin's public key, you may trust his cousin's public key.
Diffey and Helmen published this, the fine triplet known as RSA subsequently pattented an implementation of the procedure, and that pattent has since expired. In other words this is old news.
-Rusty
Re:A wee bit self defeating (Score:1)
It does give you a logistical advantage that you can transfer the secret information at a time, place and method of your choosing and then send communication over an unsecure channel safely later.
I.e. load it on to the aircraft computer at the military base, or on your laptop inside the firewall at HQ, ect - assuming those networks are secure or at least more secure.
And then communicate it instantly over the insecure internet or radio when the time is right.
Not that new an idea (Score:1)
I've had "Optical Cryptography" for ages (Score:2)
rr
High scores for the prof (Score:1)
Variation on a theme (DSSS) (Score:2, Informative)
One useful side effect is that you can use two or more different sequences on the same band (or wire) the two underlying signals do not interfere with each other (or not to a great extent).
Anyway it looks like this professor has managed to create the optical equivalent of a linear feedback shift register with two matching lasers.
Simmilar work at Bangor University (Score:3, Informative)
Prof Alan Shore [bangor.ac.uk] has done some work simmilar to this [bangor.ac.uk] at Bangor university
Re:Simmilar work at Bangor University (Score:1)
GPS-like (Score:2)
-me
Spectrum widening (Score:2, Informative)
Spectrum widening consists on "dissoluting" the original signal (i.e. a 1 MHz signal) into a larger one (i.e. a 100 MHz signal). This way, information is distributed thru the whole 100 MHz spectrum and you get shielding against noise and big resistance to spyers.
Get your names right! (Score:1)
The first name of the cyberpunk writer Stephenson is
The same noise ... old folks can relate (Score:1, Offtopic)
"Someone on the other end would subtract out the noise to get the signal. Works great if both ends have the exact same noise."
I know some older folks who think that two people with "Metallica - Injustice for All" have the same noise. Is this what they are referring to here? &^}
But seriously, if two people have 'the same noise' and use it to decrypt, it can't possibly be considered noise. It become a signal. No two ways about it. Think people
Re:The same noise ... old folks can relate (Score:1)
Noise generally refers to "Any signal other than the desired signal."
Re:The same noise ... old folks can relate (Score:2)
"Noise is a type of signal, at least if you talk to any signal processing geek."
Remind me not to talk to any signal processing geeks. If some idiot starts babbling meaningless gibberish, I suppose that this is a signal that he is an idiot who spouts gibberish. Beyond that, it doesn't tell me anything. It certainly doesn't tell me anything usefull. It's like a purple light at an intersection
"Noise generally refers to "Any signal other than the desired signal.""
That's exactly what I just said. If it is a signal you want/need to decrypt something it is not an undesired signal (noise), it is the very signal a would be cracker desires
A reasonable analogy would be the way some idiot modded my post as off-topic. At first glance it looks like noise, but it really tells me something. It tells me the cluless buffoon who modded my post is an idiot. Looks like noise, but it's not. Get it? 8^}
Signal to Noise (novel) (Score:1)
This is your PHONE (Score:1)
Any of you use a cellular phone? A CDMA one? Your phone uses the same technology. It's called Direct Sequence Spread Spectrum.
Doesn't solve the problem (Score:1)
The wonder of asymmetric encryption meant that (public) keys could be sent by normal mail, email, or even posted on a big billboard on your house just so long as it got distributed.
"Noise" encryption means that both sender and receiver have to have the same type of noise, otherwise they can't subtract it. So this noise (the key) has to be given by the sender to the receiver. Bang! Asymmetric encryption. And once you've used it once, you may as well carry on using it because if it's weak, you've broken the security, and if it's strong, it's.... strong.
There's the additional problem that the noise has to be as long as the cypher (lengthy keys) or repeated (insecure).
But anyway. IANASE.
Re:Doesn't solve the problem (Score:1)
Re:Rudimentary question (Score:1)