An automatic cryptanalysis of simple substitution ciphers using compression

Al-Kazaz, Noor R.; Irvine, Sean A.; Teahan, William J.

doi:10.1080/19393555.2018.1426799

Cited by 4 publications

(2 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Subsequently, two models with and without update exclusion were created using the BSK to see which one worked better in calculating the codelength (Sub-stage 2c). The results are presented below in Table 4: The results of these different experiments revealed that the language model without update exclusion performed better than the model with update exclusion, which is compatible with the findings of Al-kazaz for cryptanalysis [60].…”

Section: Sub-stage 2a: Statistical Stagesupporting

confidence: 83%

Automatic Correction of Arabic Dyslexic Text

Alamri

Teahan

2019

Computers

View full text Add to dashboard Cite

This paper proposes an automatic correction system that detects and corrects dyslexic errors in Arabic text. The system uses a language model based on the Prediction by Partial Matching (PPM) text compression scheme that generates possible alternatives for each misspelled word. Furthermore, the generated candidate list is based on edit operations (insertion, deletion, substitution and transposition), and the correct alternative for each misspelled word is chosen on the basis of the compression codelength of the trigram. The system is compared with widely-used Arabic word processing software and the Farasa tool. The system provided good results compared with the other tools, with a recall of 43%, precision 89%, F1 58% and accuracy 81%.

show abstract

Section: Sub-stage 2a: Statistical Stagesupporting

confidence: 83%

Automatic Correction of Arabic Dyslexic Text

Alamri

Teahan

2019

Computers

View full text Add to dashboard Cite

show abstract

“…viii. Playfair cipher is vulnerable to statistical analysis attack and several successful attacks such as [17]- [19] have been reported.…”

Section: Overview Of Playfair Ciphermentioning

confidence: 99%

Modified Playfair cryptosystem for improved data security

Oladipupo

Abikoye

2022

Comput Sci Inf Technol

View full text Add to dashboard Cite

Playfair is the earliest known classical block cipher which is capable of taking two characters as a unit in the process of encryption and decryption. However, the cipher is suffering from vulnerability to many cryptanalysis attacks due to a lack of confusion and diffusion properties, an inability to handle numbers and special characters in the process of encryption and decryption, and a host of other deficiencies. Although several modifications and improvements had been done by different researchers, the emphasis has been on the modification of the key matrix to accommodate more characters to increase the keyspace. No attention has been given to increment in the size of the block that the Playfair cipher can handle at a time. In this paper, a modified Playfair (MPF) cryptosystem that is capable of handling different block sizes with high diffusion and confusion properties is developed. cryptanalysis of the developed cryptosystem was carried out and the results show that the MPF cryptosystem is resistant to Known plaintext attack, chosen-plaintext attack, chosen ciphertext attack, frequency analysis attack, autocorrelation attack, differential cryptanalysis attacks, entropy attacks, brute force attack, and can handle variable block sizes.

show abstract