<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05148645</id>
  <dt>a</dt>
  <an>05148645</an>
  <augroup>
    <au>Pieprzyk, Josef</au>
    <au>Zhang, Xian-Mo</au>
    <au>Goli\'c, Jovan Dj.</au>
  </augroup>
  <ti>Characterisations of extended resiliency and extended immunity of S-boxes.</ti>
  <so>Won, Dongho (ed.) et al., Information security and cryptology -- ICISC 2005. 8th international conference, Seoul, Korea, December 1--2, 2005. Revised selected papers. Berlin: Springer (ISBN 3-540-33354-1/pbk). Lecture Notes in Computer Science 3935, 210-228 (2006).</so>
  <py>2006</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Extended Resiliency</ut>
    <ut>Extended Immunity</ut>
    <ut>Divide-and- Conquer Algebraic Attacks</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/11734727</li>
  </ligroup>
  <abgroup>
    <ab>Summary: New criteria of extended resiliency and extended immunity of vectorial Boolean functions, such as S-boxes for stream or block ciphers, were recently introduced. They are related to a divide-and-conquer approach to algebraic attacks by conditional or unconditional equations. Classical resiliency turns out to be a special case of extended resiliency and as such requires more conditions to be satisfied. In particular, the algebraic degrees of classically resilient S-boxes are restricted to lower values. In this paper, extended immunity and extended resiliency of S-boxes are studied and many characterisations and properties of such S-boxes are established. The new criteria are shown to be necessary and sufficient for resistance against the divide-and-conquer algebraic attacks by conditional or unconditional equations.</ab>
    <rv></rv>
  </abgroup>
</item>