The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
As funções booleanas usadas em cifras de fluxo e cifras de bloco devem ter alta não linearidade de segunda ordem para resistir a vários ataques conhecidos e alguns ataques potenciais que podem existir, mas ainda não são eficientes e podem ser melhorados no futuro. A não linearidade de segunda ordem das funções booleanas também desempenha um papel importante na teoria da codificação, uma vez que seu valor máximo é igual ao raio de cobertura do código Reed-Muller de segunda ordem. Mas é uma tarefa extremamente difícil calcular e até mesmo limitar a não-linearidade de segunda ordem das funções booleanas. Neste artigo, apresentamos um limite inferior para a não linearidade de segunda ordem das funções booleanas generalizadas de Maiorana-McFarland. Como aplicações de nosso limite, fornecemos provas mais simples e diretas para dois limites inferiores conhecidos sobre a não-linearidade de segunda ordem de funções na classe de funções dobradas de Maiorana-McFarland. Também derivamos um limite inferior para a não-linearidade de segunda ordem das funções que foram conjecturadas por Canteaut e cuja curvatura foi provada por Leander, empregando ainda o nosso limite.
Qi GAO
Southwest Jiaotong University,Guangxi Key Laboratory of Cryptography and Information Security
Deng TANG
Southwest Jiaotong University,Guangxi Key Laboratory of Cryptography and Information Security
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Qi GAO, Deng TANG, "A Lower Bound on the Second-Order Nonlinearity of the Generalized Maiorana-McFarland Boolean Functions" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 12, pp. 2397-2401, December 2018, doi: 10.1587/transfun.E101.A.2397.
Abstract: Boolean functions used in stream ciphers and block ciphers should have high second-order nonlinearity to resist several known attacks and some potential attacks which may exist but are not yet efficient and might be improved in the future. The second-order nonlinearity of Boolean functions also plays an important role in coding theory, since its maximal value equals the covering radius of the second-order Reed-Muller code. But it is an extremely hard task to calculate and even to bound the second-order nonlinearity of Boolean functions. In this paper, we present a lower bound on the second-order nonlinearity of the generalized Maiorana-McFarland Boolean functions. As applications of our bound, we provide more simpler and direct proofs for two known lower bounds on the second-order nonlinearity of functions in the class of Maiorana-McFarland bent functions. We also derive a lower bound on the second-order nonlinearity of the functions which were conjectured bent by Canteaut and whose bentness was proved by Leander, by further employing our bound.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.2397/_p
Copiar
@ARTICLE{e101-a_12_2397,
author={Qi GAO, Deng TANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Lower Bound on the Second-Order Nonlinearity of the Generalized Maiorana-McFarland Boolean Functions},
year={2018},
volume={E101-A},
number={12},
pages={2397-2401},
abstract={Boolean functions used in stream ciphers and block ciphers should have high second-order nonlinearity to resist several known attacks and some potential attacks which may exist but are not yet efficient and might be improved in the future. The second-order nonlinearity of Boolean functions also plays an important role in coding theory, since its maximal value equals the covering radius of the second-order Reed-Muller code. But it is an extremely hard task to calculate and even to bound the second-order nonlinearity of Boolean functions. In this paper, we present a lower bound on the second-order nonlinearity of the generalized Maiorana-McFarland Boolean functions. As applications of our bound, we provide more simpler and direct proofs for two known lower bounds on the second-order nonlinearity of functions in the class of Maiorana-McFarland bent functions. We also derive a lower bound on the second-order nonlinearity of the functions which were conjectured bent by Canteaut and whose bentness was proved by Leander, by further employing our bound.},
keywords={},
doi={10.1587/transfun.E101.A.2397},
ISSN={1745-1337},
month={December},}
Copiar
TY - JOUR
TI - A Lower Bound on the Second-Order Nonlinearity of the Generalized Maiorana-McFarland Boolean Functions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2397
EP - 2401
AU - Qi GAO
AU - Deng TANG
PY - 2018
DO - 10.1587/transfun.E101.A.2397
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2018
AB - Boolean functions used in stream ciphers and block ciphers should have high second-order nonlinearity to resist several known attacks and some potential attacks which may exist but are not yet efficient and might be improved in the future. The second-order nonlinearity of Boolean functions also plays an important role in coding theory, since its maximal value equals the covering radius of the second-order Reed-Muller code. But it is an extremely hard task to calculate and even to bound the second-order nonlinearity of Boolean functions. In this paper, we present a lower bound on the second-order nonlinearity of the generalized Maiorana-McFarland Boolean functions. As applications of our bound, we provide more simpler and direct proofs for two known lower bounds on the second-order nonlinearity of functions in the class of Maiorana-McFarland bent functions. We also derive a lower bound on the second-order nonlinearity of the functions which were conjectured bent by Canteaut and whose bentness was proved by Leander, by further employing our bound.
ER -