Titlebook: Cryptography and Coding; 7th IMA Internationa Michael Walker Conference proceedings 1999 Springer-Verlag Berlin Heidelberg 1999 AES.Boolean

Atmosphere

绿州

Some Applications of Bounds for Designs to the Cryptography,n codes, secret sharing schemes, correlation-immune and resilient functions. In this paper we give applications of some methods and results from the design theory, especially bounding the optimal size of the designs and codes, to cryptography. We give a new bound for the parameter ., when (.)-resili

ALE

Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions,. In this paper we study the tradeoff between two such criteria, the nonlinearity and the resiliency. The results are twofold. Firstly, we establish the maximum nonlinearity for a fixed resiliency in certain cases. Secondly, we present a simple search algorithm for finding Boolean functions with goo

VOK

,Combinatorial Structure of Finite Fields with Two Dimensional Modulo Metrics⋆,trics) and some group actions defined over them. We follow the well known approach of P. Delsarte [.] to this problem through the construction of association schemes. Association schemes based on this distances are the basic tools we propose to deal with the metric properties of codes defined over t

foppish

A New Method for Generating Sets of Orthogonal Sequences for a Synchronous CDMA System,ollection of n sequences, of length n chips, that are mutually orthogonal. Although there are many possible combinations of sequences forming orthogonal sets of a specified length, few have been identified with a structured method of generation such as Walsh codes and orthogonal Gold codes. The appl