Authentication Codes and Combinatorial Designs

Dingyi Pei

$126

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Chapman & Hall/CRC
05 September 2019

Mathematical logic; Combinatorics & graph theory; Communications engineering & telecommunications

Series: Discrete Mathematics and Its Applications

Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems. Authentication Codes and Combinatorial Designs presents new findings and original work on perfect authentication codes characterized in terms of combinatorial designs, namely strong partially balanced designs (SPBD).

Beginning with examples illustrating the concepts of authentication schemes and combinatorial designs, the book considers the probability of successful deceptions followed by schemes involving three and four participants, respectively. From this point, the author constructs the perfect authentication schemes and explores encoding rules for such schemes in some special cases.

Using rational normal curves in projective spaces over finite fields, the author constructs a new family of SPBD. He then presents some established combinatorial designs that can be used to construct perfect schemes, such as t-designs, orthogonal arrays of index unity, and designs constructed by finite geometry. The book concludes by studying definitions of perfect secrecy, properties of perfectly secure schemes, and constructions of perfect secrecy schemes with and without authentication.

Supplying an appendix of construction schemes for authentication and secrecy schemes, Authentication Codes and Combinatorial Designs points to new applications of combinatorial designs in cryptography.

By: Dingyi Pei
Imprint: Chapman & Hall/CRC
Country of Publication: United Kingdom
Dimensions: Height: 234mm, Width: 156mm,
Weight: 340g
ISBN: 9780367391249
ISBN 10: 0367391244
Series: Discrete Mathematics and Its Applications
Pages: 256
Publication Date: 05 September 2019
Audience: College/higher education , General/trade , Primary , ELT Advanced
Format: Paperback
Publisher's Status: Active

Introduction. Authentication Schemes. Authentication Schemes with Three Participants. Authentication Schemes with Arbitration. A-Codes Based on Rational Normal Curves. t-Deisgns. Orthogonal Arrays of Index Unity. A-Codes from Finite Geometries. Authentication/Secrecy Schemes. Appendix A: A Survey of Constructions for A-Codes. References. Notations. Index.

Pei, Dingyi

LATEST DISCOUNTS & SALES: PROMOTIONS

Authentication Codes and Combinatorial Designs

Dingyi Pei

$126

Paperback

See Also

Contact Abbeys

Contact Galaxy

Contact Language

Contact Us

About ABBEY'S