Potential and specific features of the method of transmission and integrated protection of information Stocos, Ltd.1.

Slides:



Advertisements
Similar presentations
Practical and Theoretical Issues on Adaptive Security Alexander Shnitko Novosibirsk State Technical University.
Advertisements

Cyclic Code.
Applied Algorithmics - week7
Computer Networking Error Control Coding
1 Computer Networks and Internets, 5e By Douglas E. Comer Lecture PowerPoints Adapted from the notes By Lami Kaya, © 2009 Pearson Education.
Information Theory EE322 Al-Sanie.
4.2 Digital Transmission Pulse Modulation (Part 2.1)
Arbitrary Bit Generation and Correction Technique for Encoding QC-LDPC Codes with Dual-Diagonal Parity Structure Chanho Yoon, Eunyoung Choi, Minho Cheong.
Session 4 Asymmetric ciphers.
Using Redundancy to Cope with Failures in a Delay Tolerant Network Sushant Jain, Michael Demmer, Rabin Patra, Kevin Fall Source:
Secure Data Communication in Mobile Ad Hoc Networks Authors: Panagiotis Papadimitratos and Zygmunt J Haas Presented by Sarah Casey Authors: Panagiotis.
Fundamental limits in Information Theory Chapter 10 :
Efficient Data Dissemination and Survivable Data Storage Lihao Xu
WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.
Theory I Algorithm Design and Analysis (9 – Randomized algorithms) Prof. Dr. Th. Ottmann.
WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.
Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
On Error Preserving Encryption Algorithms for Wireless Video Transmission Ali Saman Tosun and Wu-Chi Feng The Ohio State University Department of Computer.
“NATIONAL CHAMBER OF PRIVATE BAILIFF OFFICERS ” in the new era of the online execution SIAIP INTRODUCTION 16 th of December 2014.
Introduction.
Review of modern noise proof coding methods D. Sc. Valeri V. Zolotarev.
Network Security. Security Threats 8Intercept 8Interrupt 8Modification 8Fabrication.
Universität Siegen Institut für Digitale Kommunikationssysteme Univ.-Prof. Dr. Christoph Ruland Hölderlinstraße 3 D Siegen
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Thrust 2 Layerless Dynamic Networks Lizhong Zheng, Todd Coleman.
Propagation Delay and Receiver Collision Analysis in WDMA Protocols I.E. Pountourakis, P.A. Baziana and G. Panagiotopoulos School of Electrical and Computer.
Application of Finite Geometry LDPC code on the Internet Data Transport Wu Yuchun Oct 2006 Huawei Hisi Company Ltd.
Multiuser Detection (MUD) Combined with array signal processing in current wireless communication environments Wed. 박사 3학기 구 정 회.
© 2005, it - instituto de telecomunicações. Todos os direitos reservados. J.Almeida, J.Barros Instituto de Telecomunicações Universidade do Porto Joint.
Basic Concepts of Encoding Codes, their efficiency and redundancy 1.
Scientific session DNIT of the RAS New optimization coding theory and its applied achievements V.V.Zolotarev, SRI RAS.
Codes Codes are used for the following purposes: - to detect errors - to correct errors after detection Error Control Coding © Erhan A. Ince Types: -Linear.
COEN 180 Erasure Correcting, Error Detecting, and Error Correcting Codes.
ACM 511 Introduction to Computer Networks. Computer Networks.
Energy-Efficient Signal Processing and Communication Algorithms for Scalable Distributed Fusion.
Introduction of Low Density Parity Check Codes Mong-kai Ku.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
A new Ad Hoc Positioning System 컴퓨터 공학과 오영준.
Coding Theory. 2 Communication System Channel encoder Source encoder Modulator Demodulator Channel Voice Image Data CRC encoder Interleaver Deinterleaver.
Coding Theory Efficient and Reliable Transfer of Information
Linear codes of good error control performance Tsonka Baicheva Institute of Mathematics and Informatics Bulgarian Academy of Sciences Bulgaria.
Communications Systems. 1Analogue modulation: time domain (waveforms), frequency domain (spectra), amplitude modulation (am), frequency modulation (fm),
Recent Results in Combined Coding for Word-Based PPM Radu Rădescu George Liculescu Polytechnic University of Bucharest Faculty of Electronics, Telecommunications.
© 2009 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets, 5e By Douglas E. Comer Lecture PowerPoints.
Name Iterative Source- and Channel Decoding Speaker: Inga Trusova Advisor: Joachim Hagenauer.
Information Theory Linear Block Codes Jalal Al Roumy.
Authentication protocol providing user anonymity and untraceability in wireless mobile communication systems Computer Networks Volume: 44, Issue: 2, February.
On Coding for Real-Time Streaming under Packet Erasures Derek Leong *#, Asma Qureshi *, and Tracey Ho * * California Institute of Technology, Pasadena,
PGP & IP Security  Pretty Good Privacy – PGP Pretty Good Privacy  IP Security. IP Security.
Coding technology Lecturer: Prof. Dr. János LEVENDOVSZKY Course website:
Timo O. Korhonen, HUT Communication Laboratory 1 Convolutional encoding u Convolutional codes are applied in applications that require good performance.
1 Lecture 7 System Models Attributes of a man-made system. Concerns in the design of a distributed system Communication channels Entropy and mutual information.
802.11b PHY Wireless LANs Page 1 of 23 IEEE b WLAN Physical Layer Svetozar Broussev 16-Feb-2005.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
A Simple Transmit Diversity Technique for Wireless Communications -M
Supercharged Forward Error Correction Codes draft-stauffer-rmt-bb-fec-supercharged-00 (update to this soon to be submitted officially) IETF #84 – Vancouver.
Implementation of Turbo Code in TI TMS320C8x Hao Chen Instructor: Prof. Yu Hen Hu ECE734 Spring 2004.
Hongjie Zhu,Chao Zhang,Jianhua Lu Designing of Fountain Codes with Short Code-Length International Workshop on Signal Design and Its Applications in Communications,
Error Detecting and Error Correcting Codes
Simulation of Finite Geometry LDPC code on the Packet Erasure channel Wu Yuchun July 2007 Huawei Hisi Company Ltd.
Chapter Nine: Data Transmission. Introduction Binary data is transmitted by either by serial or parallel methods Data transmission over long distances.
Digital Communications Chapter 6. Channel Coding: Part 1
INTRODUCTION. Electrical and Computer Engineering  Concerned with solving problems of two types:  Production or transmission of power.  Transmission.
DATA STRUCTURES AND ALGORITHM (CSE 220)
Space Time Codes.
Quantum Cryptography Arjun Vinod S3 EC Roll No:17.
Independent Encoding for the Broadcast Channel
Information Redundancy Fault Tolerant Computing
Error Trapping on LFBSR
Information Theoretical Analysis of Digital Watermarking
Instructor Materials Chapter 5: Ensuring Integrity
Presentation transcript:

Potential and specific features of the method of transmission and integrated protection of information Stocos, Ltd.1

The method in question has certain advantages over the state-of- the-art methods both from the point of view of functionality (it demonstrates universality and integrated approach to protection) and performance (high speed of information processing, the guaranteed reliability in any channel, high percentage of corrected errors). Universality is understood as applicability in any data memory bank and in any communication channel (with various interference rates and the law of interference distribution). Integrated approach to the protection problem is understood as possibility to protect the information at various kinds of impact within the framework of a single algorithm of information processing and at one-time redundancy introduction. Stocos, Ltd.2

The method is based on new codes for restoration of integrity of the information - stochastic codes, i.e. the errors correction with the preset accuracy. Stocos, Ltd.3

Encoding of codes with restoration of information integrity is reduced to application of any binary (n, k)-code with correction of the errors, described by verification matrix Н and the code distance d, in the form of l-interlacing code blocks, where l the binary symbols with the same name are considered to be a q-ary symbol (q=2l); each q-ary symbol, prior to transmission to a channel, is subject to randomization (stochastic transformation) with randomization parameter changing for each new symbol. Randomization operation is carried out by Shannon rules of cryptography. Stocos, Ltd. 4 Stochastic encoding procedure

Decoding procedure the reverse randomization of q-ary symbols ; correction of deformed symbols by means of preliminary allocation (localization) of non- deformed symbols in the channel; check of accuracy of the allocated symbols the joint (co-coordinated) decoding individual binary l interlacing of the code block; correction of not allocated or inexact symbols by correction of deletions, where the corrected symbol is expressed through authentically allocated symbols Stocos, Ltd.5

Main distinction between stochastic codes and the conventional codes with error correction Correction of errors is carried out by the rule of maximum accuracy, unlike the principle of maximum credibility used in the theory of coding, which principle is reduced to allocation, from all possible vectors of errors, of such vector, which "is the most credible" in the type of channels used. Stocos, Ltd.6

Integrated efficiency of stochastic protection methods One may speak of “maximum benefit” (ultimate probability of message delivery, minimal probability of decoding error, minimal probability of inflicting false information, minimal probability of cracking the context of a confidential message) at minimal investments (introduction of minimal redundancy, required complexity of processing, minimal delay time) Stocos, Ltd.7

Processing speed for decoding and individual operations, achieved in modeling (for the processor with 1467 MHz clock rate) Speed of decoding is up to 50 Mb/sec and practically does not depend on the code parameters and on the probability of error appearance. Speed of direct stochastic conversion is bit/sec. Speed of reverse stochastic conversion is bit/sec. Stocos, Ltd.8

Transmission rate at selecting the optimal values of code with error correction Stocos, Ltd.9 Pq code (8.2) (8.4) (16.7) (16.11) (32.26) (64.57) ( ) ( ) ( )

Transmission methods comparison Stocos, Ltd.10

Rate gain in transmission via communication channels In a binary channel with a binary symbol deformation probability within the range of to (other methods do not work at all) the relative (efficient) speed is within the range of 0.1 – 0.3 ; In a binary channel with a binary symbol deformation probability within the range of to the method in question offers the gain in the range of 1.5 to 2 (0.3 to 0.5 and up to 0.75) times over the conventional cascade codes with error correction ; In a binary channel with a binary symbol deformation probability within the range of to the method in question offers the gain in the range of 1.5 to 1.7 (0.6 to 0.7 and up to 0.95) times over the conventional cyclic codes. Stocos, Ltd.11

Improvements in methods of checking and integrity restoration In case of attempted infliction of false information the checking and integrity restoration processes are initiated in the mode of imitation rejecting error correction. Stocos, Ltd.12

Advantages in solving the cryptography problems High speed processing (10 Mb/sec); Large size key (2 Kb); Encrypting endurance close to Shannon absolute maximum. Stocos, Ltd.13

Application of stochastic methods in information protection protocols for information transmission via any communication channels; protocols for information protection by applying methods of cryptographic protection from reading and inflicting false information; methods and protocols for checking and restoration of information integrity in computer systems. Stocos, Ltd. 14

Legal Status The International (PCT) application PCT/RU2007/ has been duly filed. The national phase was initiated in Europe (Europatent), the USA, Japan, China and India. Stocos, Ltd