2016
DOI: 10.4018/978-1-4666-9426-2.ch002
|View full text |Cite
|
Sign up to set email alerts
|

Computational Intelligence in Cryptology

Abstract: Computational intelligence (CI) has attracted the attention of many researchers for its effectiveness in solving different kinds of problems. It has been applied to solve problems in a wide area of applications. The aim of this chapter is to present an overview of existing literature about the applications of CI in cryptology. It demonstrates and studies the applicability of CI in cryptology. The problems examined in this chapter are the automated design of cipher systems, and the automated cryptanalysis of ci… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 43 publications
0
1
0
Order By: Relevance
“…Fordeterminingsecretkey,theautomatedattackstrategymayusejusttheknownciphertexts (i.e.,encryptedplaintexts),someplaintexts,andintelligentalgorithms.Iftheattacker(orcryptanalyst) recoverthesecretkeybyusingthe"knownciphertexts"only,thenthiskindofattackisreferredas aciphertext-onlyattack (Menezesetal.,1996;Stinson,2005;Holden,2017).Thistypeofattack is most demanding and challenging, therefore, in this work, we demonstrate such attacks using metaheuristic techniques. For a systematic demonstration of automated attacks, the well-known classicalsubstitutioncipherisconsidered.Onecanaskwhymodernciphersarenotconsideredto demonstratemetaheuristicattacks.Thefactisthatmetaheuristicscannotbeappliedtoattackmodern ciphers such as DES (data encryption standard), AES (advanced encryption standard), and RSA (Rivest-Shamir-Adleman),becauseunsuitabilityindesigningthefitnessfunctionformodernciphers (Castro and Viñuela, 2005;Danziger and Henriques, 2012;Awad and El-Alfy, 2015). However, cryptanalysisofclassicalciphers(anNP-completeproblem)canbecarriedoutusingmetaheuristics becausethefitnessfunctioncanbewell-designedbyusingexpectedandobservedn-gramstatistics ofthelanguage (CastroandViñuela,2005;DanzigerandHenriques,2012;AwadandEl-Alfy,2015).…”
Section: Introductionmentioning
confidence: 99%
“…Fordeterminingsecretkey,theautomatedattackstrategymayusejusttheknownciphertexts (i.e.,encryptedplaintexts),someplaintexts,andintelligentalgorithms.Iftheattacker(orcryptanalyst) recoverthesecretkeybyusingthe"knownciphertexts"only,thenthiskindofattackisreferredas aciphertext-onlyattack (Menezesetal.,1996;Stinson,2005;Holden,2017).Thistypeofattack is most demanding and challenging, therefore, in this work, we demonstrate such attacks using metaheuristic techniques. For a systematic demonstration of automated attacks, the well-known classicalsubstitutioncipherisconsidered.Onecanaskwhymodernciphersarenotconsideredto demonstratemetaheuristicattacks.Thefactisthatmetaheuristicscannotbeappliedtoattackmodern ciphers such as DES (data encryption standard), AES (advanced encryption standard), and RSA (Rivest-Shamir-Adleman),becauseunsuitabilityindesigningthefitnessfunctionformodernciphers (Castro and Viñuela, 2005;Danziger and Henriques, 2012;Awad and El-Alfy, 2015). However, cryptanalysisofclassicalciphers(anNP-completeproblem)canbecarriedoutusingmetaheuristics becausethefitnessfunctioncanbewell-designedbyusingexpectedandobservedn-gramstatistics ofthelanguage (CastroandViñuela,2005;DanzigerandHenriques,2012;AwadandEl-Alfy,2015).…”
Section: Introductionmentioning
confidence: 99%