Advertisement

Periodicity Examination

  • Friedrich L. Bauer

Abstract

Even if a multitude of independent alphabets is used, periodic polyalphabetic encryption contains one element which is difficult to hide: the number of keys in the period of the encryption. This is based on the following stationariness property of stochastic sources: If P is a plaintext (of length M) from a source Q, then P (s), the plaintext P shifted cyclically by any number s of positions, is from the same source.

Keywords

Great Common Divisor Kappa Test Encryption Step Accounting Machine Perforated Sheet 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Friedrich L. Bauer
    • 1
  1. 1.Department of Computer ScienceMunich Institute of TechnologyMünchenGermany

Personalised recommendations