IEICE TRANSACTIONS on Information
Permutation Cipher Scheme Using Polynomials over a Field
Summary :
A permutation cipher scheme using polynomials over a field is presented. A permutation as well as substitution plays a major role in almost all conventional cryptosystems. But the security of the permutation depends on how symbols are permuted. This paper proposes the use of polynomials for the permutation and show that the scheme satisfies the following security criteria. (1) There are enough encryption keys to defend exhaustive attacks. (2) The permutation moves almost all samples into places which are different from the original places. (3) Most samples are shifted differently by different permutations. The permutation cipher scheme could be regarded as a scheme based on Reed-Solomon codes. The information symbols of the codes compose a key of the permutation cipher scheme.
- Publication
- IEICE TRANSACTIONS on Information Vol.E78-D No.2 pp.138-142
- Publication Date
- 1995/02/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Eiji OKAMOTO, Tomohiko UYEMATSU, Masahiro MAMBO, "Permutation Cipher Scheme Using Polynomials over a Field" in IEICE TRANSACTIONS on Information,
vol. E78-D, no. 2, pp. 138-142, February 1995, doi: .
Abstract: A permutation cipher scheme using polynomials over a field is presented. A permutation as well as substitution plays a major role in almost all conventional cryptosystems. But the security of the permutation depends on how symbols are permuted. This paper proposes the use of polynomials for the permutation and show that the scheme satisfies the following security criteria. (1) There are enough encryption keys to defend exhaustive attacks. (2) The permutation moves almost all samples into places which are different from the original places. (3) Most samples are shifted differently by different permutations. The permutation cipher scheme could be regarded as a scheme based on Reed-Solomon codes. The information symbols of the codes compose a key of the permutation cipher scheme.
URL: https://global.ieice.org/en_transactions/information/10.1587/e78-d_2_138/_p
Copy
@ARTICLE{e78-d_2_138,
author={Eiji OKAMOTO, Tomohiko UYEMATSU, Masahiro MAMBO, },
journal={IEICE TRANSACTIONS on Information},
title={Permutation Cipher Scheme Using Polynomials over a Field},
year={1995},
volume={E78-D},
number={2},
pages={138-142},
abstract={A permutation cipher scheme using polynomials over a field is presented. A permutation as well as substitution plays a major role in almost all conventional cryptosystems. But the security of the permutation depends on how symbols are permuted. This paper proposes the use of polynomials for the permutation and show that the scheme satisfies the following security criteria. (1) There are enough encryption keys to defend exhaustive attacks. (2) The permutation moves almost all samples into places which are different from the original places. (3) Most samples are shifted differently by different permutations. The permutation cipher scheme could be regarded as a scheme based on Reed-Solomon codes. The information symbols of the codes compose a key of the permutation cipher scheme.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Permutation Cipher Scheme Using Polynomials over a Field
T2 - IEICE TRANSACTIONS on Information
SP - 138
EP - 142
AU - Eiji OKAMOTO
AU - Tomohiko UYEMATSU
AU - Masahiro MAMBO
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E78-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 1995
AB - A permutation cipher scheme using polynomials over a field is presented. A permutation as well as substitution plays a major role in almost all conventional cryptosystems. But the security of the permutation depends on how symbols are permuted. This paper proposes the use of polynomials for the permutation and show that the scheme satisfies the following security criteria. (1) There are enough encryption keys to defend exhaustive attacks. (2) The permutation moves almost all samples into places which are different from the original places. (3) Most samples are shifted differently by different permutations. The permutation cipher scheme could be regarded as a scheme based on Reed-Solomon codes. The information symbols of the codes compose a key of the permutation cipher scheme.
ER -
English
