Open AccessON PERFECT IMITATION RESISTANT CIPHERS OF SUBSTITUTION WITH UNBOUNDED KEY
Author(s) -
С. М. Рацеев
Publication year - 2013
Publication title -
vestnik samarskogo universiteta. estestvennonaučnaâ seriâ
Language(s) - English
Resource type - Journals
eISSN - 2712-8954
pISSN - 2541-7525
DOI - 10.18287/2541-7525-2013-19-9.1-42-48
Subject(s) - cipher , transposition cipher , stream cipher , imitation , affine cipher , computer science , substitution (logic) , running key cipher , theoretical computer science , arithmetic , mathematics , algorithm , cryptography , encryption , computer security , psychology , programming language , social psychology
Constructions of perfect imitation resistant ciphers are investigated in the work. It is well known that Vernam cipher with equiprobable gamma is a perfect cipher but it is not imitation resistant. It is because in Vernam cipher equipotent alphabets for plaintexts and ciphertexts are used. On the basis of A.Yu. Zubov's mathematical model of substitution cipher with unbounded key a model of perfect and imitation resistant cipher is constructed. At that reference cypher of the given model is perfect and reaches lower boundaries for success probability of imitation and substitution of communication.