Accession Number : AD0766155
Title : Vigenere Systems over a Finite Field.
Descriptive Note : Technical rept.,
Corporate Author : CLEMSON UNIV S C DEPT OF MATHEMATICAL SCIENCES
Personal Author(s) : Brawley,J. V. ; Levine,Jack
Report Date : 24 JUL 1973
Pagination or Media Count : 19
Abstract : The classical Vigenere system of encipherment is well-known in cryptography and is readily solved by cryptanalysts using such tools as probable words, repeated patterns, and frequency analysis. It is interesting, however, to study equivalence of Vigenere systems from a mathematical point of view. Such a study is the purpose of the paper. It has been known for some time that a Vigenere system equivalent to a given one can be obtained by a decimation of the alphabet. The practical significance of the present study is that in some cases there exist equivalent systems which cannot be obtained by decimations. In the study the authors base the Vigenere system on the finite field GF(q).
Descriptors : (*CRYPTOGRAPHY, THEOREMS), MATHEMATICAL LOGIC, MAPPING(TRANSFORMATIONS), VECTOR SPACES, PERMUTATIONS
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE