Skip to main content

PROTOCOLOS, MECANISMOS Y TECNOLOGIAS PRE Y POSTCUANTICAS PARA LA CIBERSEGURIDAD Y LA PRIVACIDAD

PID2020-112586RB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2020
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

Resultados totales (Incluyendo duplicados): 9
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

About the FrodoKEM lattice-based algorithm

  • González de la Torre, Miguel Ángel
  • Hernández Encinas, Luis
  • Queiruga Dios, Araceli
Investigación en Ciberseguridad. Actas de las VII Jornadas Nacionales(JNIC 2022) 27-29 de junio de 2022 Palacio Euskalduna, Bilbao 4 páginas, 6 tablas, Lattice-based cryptography is one of the most promising areas in regards to public key cryptosystems and key encapsulation mechanisms in the post-quantum era. Once the National Institute of Standards and Technology establishes new post-quantum standards, it would be of interest to study if it is possible to define, propose, and implement new algorithms, based on such standards, to be applied in several specific environments. In this sense, we analyze lattice-based algorithms in order to modify some of them with this mentioned objective. In particular, in our ongoing research we pretend to study the FrodoKEM proposal as one of the most promising candidates from which to derive new lattice-based algorithms., This work was supported in part by ORACLE Project, with reference PCI2020-120691-2, funded by MCIN/AEI/10.13039/501100011033 and European Union “NextGenerationEU/PRTR”, in part by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MCIN), project P2QProMeTe (PID2020- 112586RB-I00/AEI/10.13039/501100011033), and in part by the EU Horizon 2020 research and innovation programme, project SPIRS (Grant Agreement No. 952622)
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

Biometrics and Artificial Intelligence: Attacks and Challenges

  • Hernández-Álvarez, Luis
  • González-Manzano, Lorena
  • De Fuentes, José María
  • Hernández Encinas, Luis
28 páginas, 4 figuras, In recent years, the development and design of reliable, secure, and usable user authentication systems have become increasingly important. One of the main reasons is the implementation and widespread use of online services, such as bank operations, online shopping, or access to personal and professional information. Since this information is sensitive and must be protected against non-authorized subjects, user authentication protocols are commonly applied. Artificial Intelligence (AI) algorithms and Biometrics are two tools usually combined to construct these protocols. While the first one allows extracting patterns and structures hidden in the data, the second one represents the characteristics that define how each person is. Therefore, these tools together can represent the manner in which a specific subject behaves and differentiate it from the rest of the users. In this chapter, we review the critical aspects of AI and Biometrics regarding user authentication protocols, so that the reader can get a general understanding of their combination. These aspects include the principal characteristics of both areas and how they can be joined in order to design reliable user authentication protocols. However, it should be considered that both fields, AI and Biometrics, present some limitations and risks that are inherent to them. Therefore, we also explain the potential attacks to which a user authentication system based on these tools is exposed. Finally, the principal limitations that are still unsolved are described., This work was supported in part by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MCIN), project P2QProMeTe (PID2020-112586RB-I00/AEI/10.13039/501100011033); Project ODIO/COW (PID2019-111429RB-C21) and by Comunidad de Madrid (Spain) through Project CYNAMON (P2018/TCS-4566-CM), all of them co-funded by the European Regional Development Fund (ESF and ERDF, EU); in part by ORACLE Project (PCI2020-120691-2), funded by MCIN/AEI/10.13039/501100011033, and European Union “NextGenerationEU/PRTR”; in part by Comunidad de Madrid (Spain) with Universidad Carlos III de Madrid (Spain) under Grant CAVTIONS-CM-UC3M; and by the Madrid Government (Comunidad de Madrid, Spain) under the Multiannual Agreement with UC3M (“Fostering Young Doctors Research,” DEPROFAKE-CM-UC3M), and in the context of the V PRICIT (Research and Technological Innovation Regional Programme). L.H.A. would like to thank CSIC Project CASDiM for its support.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

Comparative analysis of lattice-based post-quantum cryptosystems

  • González de la Torre, Miguel Ángel
  • Hernández Encinas, Luis
  • Sánchez García, José Ignacio
6 páginas, 3 figuras, 4 tablas, In recent times, lattice-based cryptographic schemes have been presented as the most promising encryption schemes against quantum computation attacks. Currently, the National Institute of Standards and Technology (NIST) is in the process of setting new post-quantum standards in two categories: key encapsulation mechanisms and digital signatures. During the different phases of the standardization process the proposals presented have been deeply studied in several ways. Their performance has been, after the security of the algorithms, an important feature to be taken into account during the evaluation process. Each submission to the NIST call includes a performance analysis and the NIST reported about the comparison among the candidates. In this communication, we focus our work on how the different lattice-based algorithms perform their implementations. Moreover, we compare each algorithm to the others by running some tests in the same device, to obtain a result as fair as possible., This work was supported in part by the R+D+i grant P2QProMeTe (PID2020-112586RB-I00), funded by MCIN/AEI/10.13039/501100011033, and in part by the R+D+i grant ORACLE (PCI2020-120691-2), funded by MCIN/AEI/10.1303 9/501100011033, and European Union “NextGenerationEU/PRTR”, and in part by the EU Horizon 2020 research and innovation programme, project SPIRS (Grant Agreement No. 952622)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

State of the Art of Cybersecurity in Cooperative, Connected and Automated Mobility

  • Castillo Campo, Óscar
  • Gayoso Martínez, Víctor
  • Hernández Encinas, Luis
  • Martín Muñoz, Agustín
  • Álvarez Fernández, Roberto
Lecture Notes in Networks and Systems (LNNS, volume 532), In recent years, mobility systems have been steadily improv- ing their performance in terms of connectivity, allowing road users to communicate among them and with the road infrastructure either directly or through internet cloud-based services. The aim of this contri- bution is to provide an overview of inter-vehicle communications cyberse- curity challenges in the cooperative, connected and automated mobility sector and make possible a further analysis of the cryptographic meth- ods and tools that can leverage their security in a world where quantum computers will be a practical menace at some point in the future., This work was supported in part by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MICINN), project P2QProMeTe (PID2020-112586RB-I00/AEI/10.13039/501100011033), and in part by ORACLE Project, with reference PCI2020-120691-2, funded by MCIN/AEI/10.13039/ 501100011033, and European Union “NextGenerationEU/PRTR”.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

Performance Analysis of NTT Algorithms

  • García Lleyda, David
  • Gayoso Martínez, Víctor
  • Hernández Encinas, Luis
  • Martín Muñoz, Agustín
  • Castillo Campo, Óscar
International Joint Conferences. ICEUTE CISIS 2024. Lecture Notes in Networks and Systems, vol 957. 11 páginas, 3 tablas., The Number Theoretic Transform is an important tool in Cryptography, as it can be used to multiply polynomials in the rings Zq [x]/〈xn − 1〉 and Zq [x]/〈xn + 1〉. In its plain version, the NTT is slower than the direct multiplication method for these rings. To over- come this disadvantage, some optimised variants of the NTT have been proposed in recent years. This contribution analyses one of these variants and presents an empirical comparison of the running time for the three methods considered in the study, which allows to determine the length of the polynomials for which each method is the fastest., This work was supported in part by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MICINN), project P2QProMeTe (PID2020-112586RB-I00/AEI/10.13039/501100011033).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

Performance Analysis of NTT Algorithms

  • David García Lleyda
  • Víctor Gayoso Martínez
  • Luis Hernández Encinas
  • Agustín Martín Muñoz
  • Óscar Castillo Campo
The Number Theoretic Transform is an important tool in Cryptography, as it can be used to multiply polynomials in the rings $\mathbb{Z_q}[x]/\langle x^n-1\rangle$ and $\mathbb{Z_q}[x]/\langle x^n+1\rangle$. In its plain version, the NTT is slower than the direct multiplication method for these rings. To overcome this disadvantage, some optimised variants of the NTT have been proposed in recent years. This contribution analyses one of these variants and presents an empirical comparison of the running time for the three methods considered in the study, which allows to determine the length of the polynomials for which each method is the fastest., This work was supported in part by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MICINN), project P2QProMeTe (PID2020-112586RB-I00/AEI/10.13039/501100011033)., Peer reviewed
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

A new algebraic approach to binary sequences and Boolean functions

  • Cardell, Sara D.
  • Fúster Sabater, Amparo
  • Requena Arévalo, Verónica
  • Beltrá, Miguel
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
  • Beltrá, Miguel|||/items/ddb05652-1531-4c02-b7bf-dcfa43c15e82
Boolean functions and binary sequences are fundamental tools in cryptography. In this work, we introduce a new bijection between the set of Boolean functions and the set of binary sequences whose period is a power of two. This correspondence enables the study of properties of Boolean functions through binary sequences and vice versa. Building on this connection, we propose a novel algebraic description, derived from the algebraic normal form of Boolean functions, which we call the reverse-ANF. Then, we explore how this formulation relates both to existing representations of Boolean functions and to binary sequences. Moreover, several cryptographic properties are examined through this new approach. Finally, we analyse generalized self-shrunken sequences from the perspective of Boolean functions, highlighting several properties that emerge under these different frameworks.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

An Efficient Algorithm to Compute the Linear Complexity of Binary Sequences

  • Fúster Sabater, Amparo
  • Requena Arévalo, Verónica
  • Cardell, Sara D.
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
Binary sequences are algebraic structures currently used as security elements in Internet of Things devices, sensor networks, e-commerce, and cryptography. In this work, a contribution to the evaluation of such sequences is introduced. In fact, we present a novel algorithm to compute a fundamental parameter for this kind of structure: the linear complexity, which is related to the predictability (or non-predictability) of the binary sequences. Our algorithm reduced the computation of the linear complexity to just the addition modulo two (XOR logic operation) of distinct terms of the sequence. The performance of this procedure was better than that of other algorithms found in the literature. In addition, the amount of required sequence to perform this computation was more realistic than in the rest of the algorithms analysed. Tables, figures, and numerical results complete the work.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Computational Analysis of Interleaving PN-Sequences with Different Polynomials

  • Cardell, Sara D.
  • Requena Arévalo, Verónica
  • Fúster Sabater, Amparo
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
Binary PN-sequences generated by LFSRs exhibit good statistical properties; however, due to their intrinsic linearity, they are not suitable for cryptographic applications. In order to break such a linearity, several approaches can be implemented. For example, one can interleave several PN-sequences to increase the linear complexity. In this work, we present a deep randomness study of the resultant sequences of interleaving binary PN-sequences coming from different characteristic polynomials with the same degree. We analyze the period and the linear complexity, as well as many other important cryptographic properties of such sequences.