1 / 19

Cryptographic Spread Spectrum Relay Communication

Cryptographic Spread Spectrum Relay Communication. Zahoor Ahmed J.P.Cances V.Meghdadi. NGMAST 2008. Break up. Spread Spectrum Cryptography Relay Network (Orthogonal) Conclusions. Introduction. Spread Spectrum Cryptography

lisbet
Télécharger la présentation

Cryptographic Spread Spectrum Relay Communication

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Cryptographic Spread Spectrum Relay Communication Zahoor Ahmed J.P.Cances V.Meghdadi NGMAST 2008

  2. Break up Spread Spectrum Cryptography Relay Network (Orthogonal) Conclusions

  3. Introduction Spread Spectrum Cryptography to hide the Signal below noise level Message Encryption Doubly secured information Transmission through Relay Channel

  4. Spread Spectrum Spread spectrum is an RF communications system in which the baseband signal bandwidth is intentionally spread over a larger bandwidth by injecting a higher frequency signal Reason ? secure communications Makes jamming and interception harder prevent detection.

  5. Tb=8Tc Tb=8Tc Tb=8Tc 1 -1 - 1 +1 Data Signal t Tb -1 1,-1,- 1,1,-1,1,1,-1 +1 PN Signal t -1 Tc +1 t Data x PN -1

  6. Example

  7. Spread Spectrum The data transmitted with bit duration Tb d(t)= dn{ 1,-1} PN Sequence N=Tb/Tc transmitted with chip duration Tc The Data in channel

  8. Cryptography Message Secret key Cryptogram To recover the original message, the receiver computes

  9. SS and Cryptography To encrypt the message data or PN sequence Suppose we want to transmit the Message with SF N=Tb/Tc PN Sequence to synchronize bit and chip time, add S in M where is N time repetition of M

  10. Synchronization Problem Cryptogram Since the energy of SS is lower than ambient noise, so it is not possible to recover the message without the knowledge of S Problem ? Good cryptographic PN Sequences confronts the problem of synchronization.

  11. Suggestion To counter the problem of synchronization, we use a technique very like that of steganography We can spread N over a more larger bandwidth to mask the message inside ambient noise. We mask the secret SS signal with a classical dummy communication. This method is more robust than classical stegano.

  12. SS using BPSK Channel Let Be the non-secret message Then the transmitted signal will be let Be the hidden message Then the secret communication is

  13. SS using BPSK Channel Then the transmitted signal is The receiver uses non-secret communication to synchronization, recover the signal The secret message is smaller than the noise, so is not detectable if the PN sequence is not known to compute correlation

  14. SS and Orthogonal transmission If an error occurs on symbol M, this error induces very high noise on secret message m To avoid this problem we use a relay channel in which two signals are sent orthogonally, so now it is unlikely that that the non secret message can cause an error in the secret message. So now the transmitted signal will be Where

  15. Relay Network Relay Source Destination

  16. Relay Network(Orthogonal)

  17. Relay network Capacity Achievability is proved by cut-set bound

  18. Conclusion SS Communications are difficult to detect. Encrypted PN sequences makes the communication more secure. The selection of good key make the communication absolutely secure Synchronization problem is addressed by Splitting the signal into phase and quadrature.

  19. THANKS ? ANY

More Related