Authentication Codes and Combinatorial Designs by Dingyi Pei

By Dingyi Pei

Researchers and practitioners of cryptography and data protection are continuously challenged to answer new assaults and threats to details platforms. Authentication Codes and Combinatorial Designs offers new findings and unique paintings on ideal authentication codes characterised when it comes to combinatorial designs, specifically powerful in part balanced designs (SPBD).Beginning with examples illustrating the ideas of authentication schemes and combinatorial designs, the e-book considers the likelihood of profitable deceptions through schemes related to 3 and 4 individuals, respectively. From this element, the writer constructs the appropriate authentication schemes and explores encoding ideas for such schemes in a few distinct cases.Using rational general curves in projective areas over finite fields, the writer constructs a brand new relatives of SPBD. He then provides a few proven combinatorial designs that may be used to build excellent schemes, akin to t-designs, orthogonal arrays of index harmony, and designs developed by way of finite geometry. The booklet concludes through learning definitions of excellent secrecy, houses of completely safe schemes, and buildings of ideal secrecy schemes with and with no authentication.Supplying an appendix of development schemes for authentication and secrecy schemes, Authentication Codes and Combinatorial Designs issues to new functions of combinatorial designs in cryptography.

Show description

Read Online or Download Authentication Codes and Combinatorial Designs PDF

Similar combinatorics books

Applications of Unitary Symmetry And Combinatorics

A concise description of the prestige of a desirable clinical challenge - the inverse variational challenge in classical mechanics. The essence of this challenge is as follows: one is given a suite of equations of movement describing a definite classical mechanical procedure, and the query to be replied is: do those equations of movement correspond to a couple Lagrange functionality as its Euler-Lagrange equations?

Analysis and Logic

This quantity offers articles from 4 impressive researchers who paintings on the cusp of study and good judgment. The emphasis is on lively learn issues; many effects are awarded that experience no longer been released ahead of and open difficulties are formulated. huge attempt has been made through the authors to make their articles available to mathematicians new to the realm

Notes on Combinatorics

Méthodes mathématiques de l’informatique II, collage of Fribourg, Spring 2007, model 24 Apr 2007

Optimal interconnection trees in the plane : theory, algorithms and applications

This publication explores basic elements of geometric community optimisation with functions to a number of actual global difficulties. It offers, for the 1st time within the literature, a cohesive mathematical framework in which the houses of such optimum interconnection networks could be understood throughout quite a lot of metrics and value capabilities.

Additional info for Authentication Codes and Combinatorial Designs

Sample text

When r ≥ 2 for each mr ∈ M r , |{mr−1 | mr−1 ⊂ mr }| = r. By (iii) we have |M r | = 1 r |M (mr−1 )| = mr−1 ∈M r−1 (k − r + 1)|M r−1 | . rPr−1 Thus, (iv) follows by induction on r. 2 holds. Copyright 2006 by Taylor & Francis Group, LLC 24 Authentication Codes and Combinatorial Designs We write M (e) instead of e(S ) for each e ∈ E in the following; it is a subset of M with k elements. Thus, we have a family of k-subsets {M (e) ⊂ M | e ∈ E }. 11) A subset is also called a block in the combinatorial design theory.

2 A Cartesian code (S , M , E ) is t-fold perfect of Type I if and only if its encoding matrix is an orthogonal array OA(nt , k, n, t) of index unity and pE is uniform where k = |S |, n = |M (s)| for each s ∈ S , and |E | = nt . 1 reduces the construction of perfect authentication codes to the construction of SPBD. For the special case of Cartesian codes of Type I it is reduced to the construction of orthogonal arrays of index unity. 2 A orthogonal array OA(nt , k, n, t) is an r − (kn, nt , k; nt−r , 0) design for 2 ≤ r ≤ t and is a 1 − (kn, nt , k, nt−1 ) design as well.

This is a t-fold perfect Cartesian code. If r = t the above system of linear equations always has a unique solution, and hence, this code is of Type I. Copyright 2006 by Taylor & Francis Group, LLC Authentication Schemes with Three Participants 29 Scheme 2 If we require that at−1 = 0 in Scheme 1, then we have a new code with q t−1 (q − 1) blocks defined as t−1 B (at−1 , at−2 , · · · , a0 ) = {(x, y) : y = ai xi , x ∈ Fq } i=0 for each t-tuple (at−1 , at−2 , · · · , a0 ), ai ∈ Fq , at−1 = 0. Let xi (1 ≤ i ≤ t) be distinct elements of Fq as above.

Download PDF sample

Rated 4.16 of 5 – based on 16 votes