affine cipher

The Affine cipher is a special case of the more general substitution cipher. It is monoalphabetic and symmetric. In affine ciphers the encryption function for a letter is

e(x)=ax+b\pmod{m}

where,

$a$ and $m$ are coprime (otherwise $a$ would have no multiplicative inverse modulo $m$ ).
$m$ is the size of the alphabet.

The decryption function is

d(x)=a^{-1}(x-b)\pmod{m}

where

a^{-1}

is the multiplicative inverse of

a

in the group

\mathbb{Z}_{m}

This cipher is less secure than a substitution cipher as it is vulnerable to all of the attacks that work against substitution ciphers as well as other attacks. The cipher's primary weakness comes from the fact that if the cryptanalyst can discover (by means of frequency analysis, brute force, guessing or otherwise) the plaintext of two ciphertext characters then the key can be obtained by solving a simultaneous equation. Since we know

a

and

m

are relatively prime this can be used to rapidly discard many "false" keys in an automated system. See also: topics in cryptography, affine functions.

<< Previous

Word Browser

Next >>

helcar
peter ham
james homer wright
rib mountain
pleasantville (movie)
quartzite
ringback
wojtek fibak
past tense
towns of japan
running key cipher

breuillet
rockoson
villages of japan
pizza box form factor
pinay sur orge
orange crowned warbler
performance ratio
villa clara
wimbledon champions (doubles)
brooklyn academy of fine arts
nguyen ngoc loan

henry cecil
kirtland's warbler
display device
john joachim zubly
cordillera de la costa
montreal locomotive works
chiplun
chunichi shimbun
duumvirate
20000 varuna
tom joyner

mita
sea breeze
new york city landmarks preservation commission
great plague (middle earth)
troy aikman
gongren ribao
buick invitational
bernard bailyn
idaho territory
leribe district
devizes