Show simple item record

dc.date.accessioned2023-12-08T10:25:07Z
dc.date.available2023-12-08T10:25:07Z
dc.date.issued2018
dc.identifierdoi:10.19211/KUP9783737604598
dc.identifier.isbn978-3-7376-0459-8 (e-book)
dc.identifier.uriurn:nbn:de:0002-404592
dc.identifier.urihttp://hdl.handle.net/123456789/15274
dc.descriptionZugleich: Dissertation, Universität Kassel, 2017
dc.language.isoeng
dc.publisherkassel university press
dc.rightsUrheberrechtlich geschützt
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/
dc.subject.ddc004
dc.subject.ddc510
dc.titleA Methodology for the Cryptanalysis of Classical Ciphers with Search Metaheuristicseng
dc.typeBuch
dcterms.abstractCryptography, the art and science of creating secret codes, and cryptanalysis, the art and science of breaking secret codes, underwent a similar and parallel course during history. Both fields evolved from manual encryption methods and manual codebreaking techniques, to cipher machines and codebreaking machines in the first half of the 20th century, and finally to computerbased encryption and cryptanalysis from the second half of the 20th century. However, despite the advent of modern computing technology, some of the more challenging classical cipher systems and machines have not yet been successfully cryptanalyzed. For others, cryptanalytic methods exist, but only for special and advantageous cases, such as when large amounts of ciphertext are available.Starting from the 1990s, local search metaheuristics such as hill climbing, genetic algorithms, and simulated annealing have been employed, and in some cases, successfully, for the cryptanalysis of several classical ciphers. In most cases, however, results were mixed, and the application of such methods rather limited in their scope and performance. In this work, a robust framework and methodology for the cryptanalysis of classical ciphers using local search metaheuristics, mainly hill climbing and simulated annealing, is described. In an extensive set of case studies conducted as part of this research, this new methodology has been validated and demonstrated as highly effective for the cryptanalysis of several challenging cipher systems and machines, which could not be effectively cryptanalyzed before, and with drastic improvements compared to previously published methods. This work also led to the decipherment of original encrypted messages from WWI, and to the solution, for the first time, of several public cryptographic challenges.eng
dcterms.accessRightsopen access
dcterms.creatorLasry, George
dcterms.dateAccepted2017-10-16
dcterms.extentxix, 227 Seiten
dc.contributor.corporatenameKassel, Universität Kassel, Fachbereich Elektrotechnik / Informatik
dc.contributor.refereeWacker, Arno (Prof. Dr.)
dc.contributor.refereeEsslinger, Bernhard (Prof.)
dc.publisher.placeKassel
dc.relation.isbnisbn:978-3-7376-0458-1 (print)
dc.subject.swdKryptoanalyseger
dc.subject.swdChiffreger
dc.subject.swdMetaheuristikger
dc.subject.swdLokales Suchverfahrenger
dc.subject.swdGenetischer Algorithmusger
dc.subject.swdAmeisenalgorithmusger
dc.subject.swdHill-Climbing-Algorithmusger
dc.subject.swdTabusucheger
dc.subject.swdSimulated annealingger
dc.subject.swdChiffriermaschinenger
dc.type.versionpublishedVersion
kup.iskuptrue
kup.price49,00
kup.subjectNaturwissenschaft, Technik, Informatik, Medizinger
kup.typDissertation
kup.institutionFB 16 Elektrotechnik / Informatik
ubks.nodoigentrue
kup.bindingSoftcover
kup.sizeDIN A5


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record