Generalized lexicographic multiobjective combinatorial optimization : application to cryptography

Zufiria Zatarain, Pedro Jose y Álvarez Cubero, José Antonio (2017). Generalized lexicographic multiobjective combinatorial optimization : application to cryptography. "Journal on Optimization", v. 27 (n. 4); pp. 2182-2201. ISSN 1052-6234. https://doi.org/10.1137/16M1107826.

Descripción

Título: Generalized lexicographic multiobjective combinatorial optimization : application to cryptography
Autor/es:
  • Zufiria Zatarain, Pedro Jose
  • Álvarez Cubero, José Antonio
Tipo de Documento: Artículo
Título de Revista/Publicación: Journal on Optimization
Fecha: 2017
Volumen: 27
Materias:
Palabras Clave Informales: Pareto efficiency; combinatorial optimization; block cipher; S-box; balancedness; nonlinearity; algebraic degree; algebraic immunity; absolute indicator; sums-of-squares indicator; correlation immunity order; propagation criterion degree
Escuela: E.T.S.I. Telecomunicación (UPM)
Departamento: Matemática Aplicada a las Tecnologías de la Información y las Comunicaciones
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (372kB) | Vista Previa

Resumen

This paper formalizes a family of prioritized multicriteria optimization problems and assesses the corresponding up-to-date known suboptimal solutions. The resulting framework is then employed to characterize and search for Boolean functions which are valuable for a robust symmetric (mainly block) cipher design. The proposed optimality definitions generalize the lexicographic method by establishing an ordered sequence of multiobjective combinatorial optimization problems, which, in turn, gathers the relative relevance of the criteria, so that the optimal solutions can be obtained from a sequential application of the Pareto efficiency. The relationship among the different formulable problems is characterized in terms of both their respective solutions sets and computing costs. Since, in practice, only a limited set of functions can be evaluated (i.e., are known), the best known Pareto efficient functions are also defined. Finally, this framework is employed to obtain new functions having known (Pareto) maximal robustness against linear, differential, randomness-based, interpolation, algebraic and correlation attacks.

Proyectos asociados

TipoCódigoAcrónimoResponsableTítulo
Gobierno de EspañaMTM2015-67396-PSin especificarSin especificarRedes complejas: modelado, dinámica y aplicaciones

Más información

ID de Registro: 50811
Identificador DC: http://oa.upm.es/50811/
Identificador OAI: oai:oa.upm.es:50811
Identificador DOI: 10.1137/16M1107826
URL Oficial: https://epubs.siam.org/doi/10.1137/16M1107826
Depositado por: Memoria Investigacion
Depositado el: 12 Sep 2018 15:51
Ultima Modificación: 12 Sep 2018 15:51
  • GEO_UP4
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • InvestigaM
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM