Partially identified Babassu cipher and attack on it
In the present article, we consider a new class of one-pad ciphers. We define its encryption algorithm as a partial function with two arguments. The first argument is a key, which is a random and equiprobable sequence of natural language letters. The length of the key is N. The second argument is a...
Gespeichert in:
Veröffentlicht in: | Journal of Computer Virology and Hacking Techniques 2022, Vol.18 (3), p.271-274 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In the present article, we consider a new class of one-pad ciphers. We define its encryption algorithm as a partial function with two arguments. The first argument is a key, which is a random and equiprobable sequence of natural language letters. The length of the key is N. The second argument is a coherent (readable) text of length L, where L |
---|---|
ISSN: | 2263-8733 2263-8733 |
DOI: | 10.1007/s11416-022-00418-1 |