Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-mwx4w Total loading time: 0 Render date: 2024-06-15T19:22:18.231Z Has data issue: false hasContentIssue false

Combinatorial designs and cryptography

Published online by Cambridge University Press:  16 March 2010

K. Walker
Affiliation:
Keele University
Get access

Summary

Abstract

In this expository paper, we describe several applications of combinatorics (in particular, combinatorial designs) to cryptography. We look at four areas in cryptography: secrecy codes, authentication codes, secret sharing schemes, and resilient functions. In each of these areas, we find that combinatorial structures arise in a natural and essential way, and we present several examples of combinatorial characterizations of cryptographic objects.

Introduction

Recent years have seen numerous interesting applications of combinatorics to cryptography. In particular, combinatorial designs have played an important role in the study of such topics in cryptography as secrecy and authentication codes, secret sharing schemes, and resilient functions. The purpose of this paper is to elucidate some of these connections. This is not intended to be an exhaustive survey, but rather a sampling of some research topics in which I have a personal interest.

Some other related surveys include applications of error-correcting codes to cryptography (Sloane [60]), applications of finite geometry to crpytography (Beutelspacher [6]) and applications of combinatorial designs to computer science (Colbourn and Van Oorschot [16]).

In this introduction we will define the relevant concepts from design theory that we will have occasion to use. Beth, Jungnickel and Lenz [4] is a good general reference on design theory.

Let 1 ≤ tk < v. An Sλ(t, k, v) is defined to be a pair (X, β), where X is a v-set (of points) and β is a collection of κ-subsets of X (called blocks), such that every t-subset of points occurs in exactly λ blocks. An Sλ(t, k, v) is called simple if no block occurs more than once in β.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×