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”

Designing Correlation Immune Boolean Functions With Minimal Hamming Weight Using Various Genetic Programming Methods

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F19%3APU134946" target="_blank" >RIV/00216305:26230/19:PU134946 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.fit.vut.cz/research/publication/11919/" target="_blank" >https://www.fit.vut.cz/research/publication/11919/</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/3319619.3321925" target="_blank" >10.1145/3319619.3321925</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Designing Correlation Immune Boolean Functions With Minimal Hamming Weight Using Various Genetic Programming Methods

  • Original language description

    In this paper we search for Boolean functions with properties that make them useful in cryptography for preventing side-channel attacks. To find these functions we use three genetic programming methods, including linear genetic programming, which has not been used to design these functions before. Our results aim to provide a fair comparison between the methods, by searching for each method's best performing parameters, and provide an insight into how well they cope with growing number of function inputs and demand for higher correlation immunity.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA19-10137S" target="_blank" >GA19-10137S: Designing and exploiting libraries of approximate circuits</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2019

  • 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

    GECCO '19 Proceedings of the Genetic and Evolutionary Computation Conference Companion

  • ISBN

    978-1-4503-6748-6

  • ISSN

  • e-ISSN

  • Number of pages

    2

  • Pages from-to

    342-343

  • Publisher name

    Association for Computing Machinery

  • Place of publication

    Praha

  • Event location

    Praha

  • Event date

    Jul 13, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000538328100171