The vulnerability of geometric sequences based on fields of odd characteristic |
| |
Authors: | Andrew Klapper |
| |
Affiliation: | (1) Department of Computer Science, University of Manitoba, R3T 2N2 Winnipeg, Manitoba, Canada |
| |
Abstract: | A new method of cryptologic attack on binary sequences is given, using their linear complexities relative to odd prime numbers. We show that, relative to a particular prime number p, the linear complexity of a binary geometric sequence is low. It is also shown that the prime p can be determined with high probability by a randomized algorithm if a number of bits much smaller than the linear complexity is known. This determination is made by exploiting the imbalance in the number of zeros and ones in the sequences in question, and uses a new statistical measure, the partial imbalance.This project was sponsored by the National Security Agency under Grant No. MDA904-91-H-0012. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation hereon. |
| |
Keywords: | Cryptanalysis Binary sequence Geometric sequence Linear complexity Galois field |
本文献已被 SpringerLink 等数据库收录! |
|