By Cunsheng Ding, Guozhen Xiao, Weijuan Shan

Secure message transmission is of maximum value in state-of-the-art information-based society. movement encryption is a virtually vital capacity to this finish. This monograph is dedicated to a brand new element of flow ciphers, particularly the steadiness conception of flow ciphers, with the aim of constructing bounds on complexity which could shape a part of the root for a basic idea of information safeguard and of stabilizing stream-cipher platforms. The process followed during this monograph is new. the subject is taken care of by way of introducing degree indexes at the protection of move ciphers, constructing reduce bounds on those indexes, and constructing connections between them. The therapy contains the steadiness of boolean capabilities, the steadiness of linear complexity of key streams, the interval balance of key streams, and the steadiness of resource codes. deceptive rules approximately flow ciphers are uncovered and new viewpoints offered. the varied degree indexes and boundaries on them which are brought right here, the method in response to spectrum strategies, andthe ten open difficulties awarded will all be priceless to the reader keen on interpreting and designing movement ciphers for securing data.

Show description

Read Online or Download The Stability Theory of Stream Ciphers PDF

Best network security books

IPSec (2nd Edition)

IPSec, moment version is the main authoritative, finished, obtainable, and up to date consultant to IPSec know-how. prime experts hide all points of IPSec structure, implementation, and deployment; evaluation vital technical advances given that IPSec was once first standardized; and current new case reports demonstrating end-to-end IPSec safety.

A Survey of Data Leakage Detection and Prevention Solutions

SpringerBriefs current concise summaries of state-of-the-art examine and sensible purposes throughout a large spectrum of fields. that includes compact volumes of fifty to a hundred pages (approximately 20,000- 40,000 words), the sequence covers quite a number content material from specialist to educational. Briefs let authors to offer their principles and readers to soak up them with minimum time funding.

Unified Communications Forensics. Anatomy of Common UC Attacks

Unified Communications Forensics: Anatomy of universal UC assaults is the 1st ebook to give an explanation for the problems and vulnerabilities and display the assaults, forensic artifacts, and countermeasures required to set up a safe (UC) atmosphere. This e-book is written by way of major UC specialists Nicholas furnish and Joseph W.

CCSP Self-Study CCSP Cisco Secure PIX Firewall Advanced Exam Certification Guide

Community protection is a truly advanced enterprise. The Cisco pictures Firewall plays a few very particular features as a part of the safety method. it is important to to be acquainted with many networking and community protection suggestions sooner than you adopt the CSPFA certification. This booklet is designed for safeguard execs or networking execs who're drawn to starting the safety certification procedure.

Additional info for The Stability Theory of Stream Ciphers

Sample text

1 are feasible to attack, provided that those with non-correlation-immune ones are feasible to attack. This means that employing correlation-immune filter functions in the stream cipher of Fig. 3. 1 may not get any advantage under the case the filter function and the feedback polynomial of the driving LFSR are known. Stream ciphers of the type of Fig. 3. 2 with correlation-immune combining functions have also equivalent ones of the same type with non-correlation-immune combining functions. They can be found out by the following procedure: Step 1 : Calculate {S(s ) (w) } , and find the set Es = { w : S ( s ) ( w ) v a O, w V= 0} Step 2 : Choose as m a n y linearly independent vectors {wl, - " , wm} in Ef as possible and also make ]S(s ) (w~) I as large as possible, l ~ i ~ m .

Stream ciphers of the type of Fig. 3. 2 with correlation-immune combining functions have also equivalent ones of the same type with non-correlation-immune combining functions. They can be found out by the following procedure: Step 1 : Calculate {S(s ) (w) } , and find the set Es = { w : S ( s ) ( w ) v a O, w V= 0} Step 2 : Choose as m a n y linearly independent vectors {wl, - " , wm} in Ef as possible and also make ]S(s ) (w~) I as large as possible, l ~ i ~ m . , wm} as a basis for GF (2)", say, {W l , " .

Z L m a k e s no contribution to the known 26 bits of key stream s 26 . The probability with which the nonlinear term makes contributions M times to N consecutive bits of the key stream is equal to or less than (N2--~) M . Although the probability is very small, it may occur. If some of the k n o w n N consecutive bits have contributions by nonlinear terms and the number of contributions M is small enough, one may elimilate those contributions by an error-correcting approach or the linear check approach given by Zeng [Zeng 87-1, under the condition that the feedback polynomial of the original LFSR is known.

Download PDF sample

Rated 4.31 of 5 – based on 26 votes