## Abstract

The advent of computer systems gave rise to increasing the interest in cryptographic methods of keeping secret data transmitted from one system to another. The paper presents a generalized Vigener cipher which cannot be broken before the (N-1) observations are made. It has been shown the cryptographic function can be constructed in the form of a polynomial over finite field determined by the cipher parameters. Using this conclusion a basic ciphering module for four messages was designed. An algorithm for constructing an arbitrary generalized Vigener cipher has been proposed. However, in the case of several messages the algorithm proposed fails. To overcome this difficulty, a method of constructing a sufficiently large ciphering device using the basic module has been worked out.

Translated title of the contribution | Generalization of Vigener ciphers |
---|---|

Original language | Polish |

Pages (from-to) | 453-466 |

Number of pages | 14 |

Journal | Archiwum Automatyki i Telemechaniki |

Volume | 24 |

Issue number | 4 |

Publication status | Published - 1979 |