All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2011

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

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

  • ISBN

    978-1-4577-1122-0

  • ISSN

  • e-ISSN

  • Number of pages

    5

  • Pages from-to

    12-16

  • Publisher name

    IEEE

  • Place of publication

    New York

  • Event location

    Salamanca

  • Event date

    Oct 19, 2011

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article