Presentation is loading. Please wait.

Presentation is loading. Please wait.

Jamming Resistant Encoding

Similar presentations


Presentation on theme: "Jamming Resistant Encoding"โ€” Presentation transcript:

1 Jamming Resistant Encoding
For Non-Uniformly Distributed Information Batya Karp Yerucham Berkowitz Advisor: Dr. Osnat Keren

2 Motivation & Goal Improve detection of jamming attacks in systems with non-uniformly distributed information Solutions implemented in encoding layer for efficiency: Faster Less hardware overhead (fewer redundancy bits)

3 Platform - Keyboard Perfect example of a system with non-uniformly distributed information Important note: The proposed solutions are applicable to any similar system

4 Basic Concepts Error Masking Probability: Robust Codes
๐‘ธ ๐’† = ๐’„ | ๐’„, ๐’„+๐’† โˆˆ๐‘ช ๐‘ช ๐‘ˆ๐‘›๐‘‘๐‘’๐‘Ÿ ๐‘ˆ๐‘›๐‘–๐‘“๐‘œ๐‘Ÿ๐‘š ๐ท๐‘–๐‘ ๐‘ก๐‘Ÿ๐‘–๐‘๐‘ข๐‘ก๐‘–๐‘œ๐‘› ๐‘ธ ๐’† = ๐’„โˆˆ๐‘ช ๐’‘ ๐’„ ๐‘ท๐’“ ๐’„+๐’†โˆˆ๐‘ช ๐‘ˆ๐‘›๐‘‘๐‘’๐‘Ÿ ๐‘๐‘œ๐‘›โˆ’๐‘ˆ๐‘›๐‘–๐‘“๐‘œ๐‘Ÿ๐‘š ๐ท๐‘–๐‘ ๐‘ก๐‘Ÿ๐‘–๐‘๐‘ข๐‘ก๐‘–๐‘œ๐‘› Robust Codes A code C is robust if and only if ๐‘„ ๐‘ค๐‘ = max ๐‘’โ‰ 0 ๐‘„ ๐‘’ <1 Linear codes are not sufficient! Punctured Cubic Code (Neumeier and Keren) : ๐‘ƒ is a binary ๐‘Ÿร—๐‘˜ matrix of rank 1<๐‘Ÿโ‰ค๐‘˜. ๐‘ช= ๐’™,๐’˜ :๐’™ โˆˆ๐‘ฎ๐‘ญ ๐Ÿ ๐’Œ , ๐’˜= ๐‘ท ๐’™ ๐Ÿ‘ โˆˆ๐‘ฎ๐‘ญ ๐Ÿ ๐’“ , ๐‘„ ๐‘’ โ‰ค 2 โˆ’๐‘Ÿ+1

5 Attacker Profiles M โ€“ set of information words C โ€“ set of code words
Method of attack: Add an error ๐‘’ โˆ— that maximizes the probability of the attack going undetected, i.e. Choose ๐‘’ โˆ— ๐‘ ๐‘ข๐‘โ„Ž ๐‘กโ„Ž๐‘Ž๐‘ก ๐‘„ ๐‘’ โˆ— = ๐‘„ ๐‘ค๐‘

6 Existing Solutions Algebraic Manipulation Detection Codes
Systematic AMD Code (Cramer et. Al. 2008): ๐ถ= ๐‘ ,๐‘ฅ,๐‘“ ๐‘ฅ,๐‘  : ๐‘ โˆˆ ๐น ๐‘ž ๐‘‘ , ๐‘ฅโˆˆ ๐น ๐‘ž ,๐‘“ ๐‘ฅ,๐‘  = ๐‘ฅ ๐‘‘+2 + ๐‘–=1 ๐‘‘ ๐‘  ๐‘– ๐‘ฅ ๐‘– โˆˆ ๐น ๐‘ž is a systematic AMD code with ๐‘„ ๐‘ค๐‘ = ๐‘‘+1 ๐‘ž Security Oriented State Assignment (Shumsky, Keren 2013) ๐‘ช โ€“ robust code, ๐‘ฏ โ€“ Set of most probable information symbols Assign each symbol a vector such that ๐ป๐‘Š ๐‘ฅ ๐‘– โ‰ค๐ป๐‘Š ๐‘ฅ ๐‘— if ๐‘ ๐‘  ๐‘– โ‰ฅ๐‘ ๐‘  ๐‘—

7 Level Out Encoding Let ๐œƒ: ๐น 2 ๐‘˜ โ†’{๐‘†}โŠ† ๐น 2 ๐‘˜+ ๐‘Ÿ ๐‘™๐‘œ be a mapping such that: ๐œƒ ๐‘š ๐‘– โˆ๐‘ ๐‘š ๐‘– Encode the information word ๐œƒ ๐‘š ๐‘– using a robust code

8 Simulation Results

9 Analysis & Conclusions
SOSA: โ€œFreeโ€ but not a viable solution as the EMP remains quite high. AMD: Best option for non-uniformly distributed information. Main drawbacks are the strict constraints and relatively complex computation involved. Level-Out: Not as effective as AMD codes, but much easier to design, and can require less time and hardware to implement.


Download ppt "Jamming Resistant Encoding"

Similar presentations


Ads by Google