A shift register construction of unconditionally secure authentication codes
Johansson, Thomas LU
(1994)
In Designs, Codes and Cryptography
4(1).
p.69-81
- Abstract
- We consider the authentication problem, using the model described by Simmons. Several codes have been constructed using combinatorial designs and finite geometries. We introduce a new way of constructing authentication codes using LFSR-sequences. A central part of the construction is an encoding matrix derived from these LFSR-sequences. Necessary criteria for this matrix in order to give authentication codes that provides protection aginst impersonation and substitution attacks will be given. These codes also provide perfect secrecy if the source states have a uniform distribution. Moreover, the codes give a natural splitting of the key into two parts, one part used aginst impersonation attacks and a second part used against substitution... (More)
- We consider the authentication problem, using the model described by Simmons. Several codes have been constructed using combinatorial designs and finite geometries. We introduce a new way of constructing authentication codes using LFSR-sequences. A central part of the construction is an encoding matrix derived from these LFSR-sequences. Necessary criteria for this matrix in order to give authentication codes that provides protection aginst impersonation and substitution attacks will be given. These codes also provide perfect secrecy if the source states have a uniform distribution. Moreover, the codes give a natural splitting of the key into two parts, one part used aginst impersonation attacks and a second part used against substitution attacks and for secrecy simultaneously. Since the construction is based on the theory of LFSR-sequences it is very suitable for implementation and a simple implementation of the construction is given. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1157107
- author
- Johansson, Thomas
LU
- organization
- publishing date
- 1994
- type
- Contribution to journal
- publication status
- published
- subject
- in
- Designs, Codes and Cryptography
- volume
- 4
- issue
- 1
- pages
- 69 - 81
- publisher
- Springer
- external identifiers
-
- scopus:12944287001
- ISSN
- 1573-7586
- DOI
- 10.1007/BF01388561
- language
- English
- LU publication?
- yes
- id
- b8690e5b-bb6b-4208-bf45-83886678ec53 (old id 1157107)
- alternative location
- http://www.springerlink.com/content/p1mu793271074336/fulltext.pdf
- date added to LUP
- 2016-04-04 08:21:39
- date last changed
- 2023-09-05 15:04:10
@article{b8690e5b-bb6b-4208-bf45-83886678ec53,
abstract = {{We consider the authentication problem, using the model described by Simmons. Several codes have been constructed using combinatorial designs and finite geometries. We introduce a new way of constructing authentication codes using LFSR-sequences. A central part of the construction is an encoding matrix derived from these LFSR-sequences. Necessary criteria for this matrix in order to give authentication codes that provides protection aginst impersonation and substitution attacks will be given. These codes also provide perfect secrecy if the source states have a uniform distribution. Moreover, the codes give a natural splitting of the key into two parts, one part used aginst impersonation attacks and a second part used against substitution attacks and for secrecy simultaneously. Since the construction is based on the theory of LFSR-sequences it is very suitable for implementation and a simple implementation of the construction is given.}},
author = {{Johansson, Thomas}},
issn = {{1573-7586}},
language = {{eng}},
number = {{1}},
pages = {{69--81}},
publisher = {{Springer}},
series = {{Designs, Codes and Cryptography}},
title = {{A shift register construction of unconditionally secure authentication codes}},
url = {{http://dx.doi.org/10.1007/BF01388561}},
doi = {{10.1007/BF01388561}},
volume = {{4}},
year = {{1994}},
}