Known-plaintext attack of DES-16 using particle swarm optimization

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F11%3A86092962" target="_blank" >RIV/61989100:27240/11:86092962 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/NaBIC.2011.6089410" target="_blank" >http://dx.doi.org/10.1109/NaBIC.2011.6089410</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/NaBIC.2011.6089410" target="_blank" >10.1109/NaBIC.2011.6089410</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Known-plaintext attack of DES-16 using particle swarm optimization

Popis výsledku v původním jazyce

Discovering the root key bits in the cryptanalysis of 16-rounded Data Encryption Standard (DES-160 is considered to be a hard problem. In this paper we present an approach for cryptanalysis of DES-16 based on Particle Swarm Optimization (PSO) using Known-plaintext attack and some equations that deduced from the relationship between sub-key differences and root key information. In Known-plaintext attack the cryptanalyst possesses one or more plaintext/cipher text pairs formed with the secret key and attempts to deduce the root key that used to produce this cipher text. In our approach, PSO is used as optimization technique to collect the optimal effective plaintexts from a plaintext search space according to the proposed fitness function then the set ofcollected plaintexts and the corresponding cipher texts used to extract the best eight sub-key differences from which most bits of the root key are discovered. 2011 IEEE.

Název v anglickém jazyce

Known-plaintext attack of DES-16 using particle swarm optimization

Popis výsledku anglicky

Discovering the root key bits in the cryptanalysis of 16-rounded Data Encryption Standard (DES-160 is considered to be a hard problem. In this paper we present an approach for cryptanalysis of DES-16 based on Particle Swarm Optimization (PSO) using Known-plaintext attack and some equations that deduced from the relationship between sub-key differences and root key information. In Known-plaintext attack the cryptanalyst possesses one or more plaintext/cipher text pairs formed with the secret key and attempts to deduce the root key that used to produce this cipher text. In our approach, PSO is used as optimization technique to collect the optimal effective plaintexts from a plaintext search space according to the proposed fitness function then the set ofcollected plaintexts and the corresponding cipher texts used to extract the best eight sub-key differences from which most bits of the root key are discovered. 2011 IEEE.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of the 2011 Third World Congress on Nature and Biologically Inspired Computing

ISBN

978-1-4577-1122-0

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

12-16

Název nakladatele

IEEE

Místo vydání

New York

Místo konání akce

Salamanca

Datum konání akce

19. 10. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—