Automated Cryptanalysis of Transposition Ciphers | Zendy

Jonathan Giddy | Zendy; Reihaneh Safavi–Naini | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Automated Cryptanalysis of Transposition Ciphers

Author(s) -

Jonathan Giddy,

Reihaneh Safavi–Naini

Publication year - 1994

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/37.5.429

Subject(s) - linear cryptanalysis , transposition cipher , differential cryptanalysis , key schedule , computer science , impossible differential cryptanalysis , boomerang attack , plaintext , ciphertext , cryptanalysis , higher order differential cryptanalysis , block cipher , block size , algorithm , cipher , mathematics , theoretical computer science , cryptography , running key cipher , encryption , key (lock) , computer security

In this paper we use simulated annealing for automatic cryptanalysis of transposition ciphers. Transposition ciphers are a class of ciphers that in conjunction with substitution ciphers form the basis of all modern symmetric algorithms. In transposition ciphers, a plaintext block is encrypted into a ciphertext block using a fixed permutation. We formulate cryptanalysis of the transposition cipher as a combinatorial optimization problem, and use simulated annealing to find the global minimum of a cost function which is a distance measure between a possible decipherment of the given ciphertext and a sample of plaintext language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research