On the relation between a-codes and codes correcting independent errors

Thomas Johansson, Gregory Kabatianskii, Ben Smeets

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

33 Citations (Scopus)

Abstract

In this paper we show an explicit relation between authentication codes and codes correcting independent errors. This relation gives rise to several upper bounds on A-codes. We also show how to construct A-codes starting from error correcting codes. The latter is used to show that if PS exceeds PI by an arbitrarily small positive amount, then the number of source states grows exponentially with the number of keys but if PS = PI it will grow only linearly.

Original languageEnglish
Title of host publicationAdvances in Cryptology – EUROCRYPT 1993 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings
EditorsTor Helleseth
PublisherSpringer Verlag
Pages1-11
Number of pages11
ISBN (Print)9783540576006
DOIs
Publication statusPublished - 1994
Externally publishedYes
EventWorkshop on Theory and Application of Cryptographic Techniques, EUROCRYPT 1993 - Lofthus, Norway
Duration: 23 May 199327 May 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume765 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceWorkshop on Theory and Application of Cryptographic Techniques, EUROCRYPT 1993
Country/TerritoryNorway
CityLofthus
Period23/05/9327/05/93

Fingerprint

Dive into the research topics of 'On the relation between a-codes and codes correcting independent errors'. Together they form a unique fingerprint.

Cite this