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): 19
Encontrada(s) 1 página(s)

RIUMA. Repositorio Institucional de la Universidad de Málaga
Publication Artículo científico (JournalArticle)

Security and Efficiency of Linear Feedback Shift Registers in GF(2n) Using n-Bit Grouped Operations

  • Espinosa García, Javier
  • Cotrina Cuenca, Guillermo
  • Peinado-Domínguez, Alberto
  • Ortiz-García, Andrés
Many stream ciphers employ linear feedback shift registers (LFSRs) to generate pseudoran- dom sequences. Many recent LFSRs are defined in GF(2n) to take advantage of the n-bit processors, instead of using the classic binary field. In this way, the bit generation rate increases at the expense of a higher complexity in computations. For this reason, only certain primitive polynomials in GF(2n) are used as feedback polynomials in real ciphers. In this article, we present an efficient implementa- tion of the LFSRs defined in GF(2n). The efficiency is achieved by using equivalent binary LFSRs in combination with binary n-bit grouped operations, n being the processor word’s length. This improvement affects the general considerations about the security of cryptographic systems that uses LFSR. The model also allows the development of a faster method to test the primitiveness of polynomials in GF(2n).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Security and Efficiency of Linear Feedback Shift Registers in GF(2n) Using n-Bit Grouped Operations

  • Espinosa García, Javier
  • Cotrina, Guillermo
  • Peinado, Alberto
  • Ortiz, Andrés
Many stream ciphers employ linear feedback shift registers (LFSRs) to generate pseudorandom sequences. Many recent LFSRs are defined in GF(2n) to take advantage of the n-bit processors, instead of using the classic binary field. In this way, the bit generation rate increases at the expense of a higher complexity in computations. For this reason, only certain primitive polynomials in GF(2n) are used as feedback polynomials in real ciphers. In this article, we present an efficient implementation of the LFSRs defined in GF(2n) . The efficiency is achieved by using equivalent binary LFSRs in combination with binary n-bit grouped operations, n being the processor word’s length. This improvement affects the general considerations about the security of cryptographic systems that uses LFSR. The model also allows the development of a faster method to test the primitiveness of polynomials in GF(2n) ., This work was supported in part by the research group BIOSIP (TIC-251) and by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MICINN), project P2QProMeTe (PID2020-112586RB-I00/AEI/10.13039/501100011033) co-funded by the European Regional Development Fund (ERDF, EU)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Security Threats and Cryptographic Protocols for Medical Wearables

  • Hernández-Álvarez, Luis
  • Bullón Pérez, Juan José
  • Batista, Kristel
  • Queiruga Dios, Araceli
17 páginas, 6 figuras, 1 tabla, In the past few years, the use of several medical devices is increasing. This paper will pay attention to a device developed to get measures of the temperature of diabetic foot. These wearables usually do not have cryptographic protocols to guarantee data security. This study analyzes the existing security in these devices, and simulate malware propagation taking into account the vulnerabilities and lack of security in these highly-constrained interconnected devices. A simulation of malware spreading in a network made by 10 and 15 individuals with 6 and 34 sensors each one, respectively, is included in this study. To avoid such attacks, a lightweight cryptographic protocol could be a satisfactory solution. Considering the quick development of quantum computers, several current cryptographic protocols have been compromised., This work was supported by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MICINN), project P2QProMeTe (PID2020-112586RB-I00/AEI/10.13039/501100011033), co-funded by the European Regional Development Fund (ERDF, EU)
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Analysis of the FO Transformation in the Lattice-Based Post-Quantum Algorithms

  • González de la Torre, Miguel Ángel
  • Hernández Encinas, Luis
  • Queiruga Dios, Araceli
20 páginas, 6 tablas, Newer variants of the Fujisaki¿Okamoto transformation are used in most candidates of the third round of the NIST Post-Quantum Cryptography standardization call in the category of public key encryption schemes. These transformations are applied to obtain a highly secure key encapsulation mechanism from a less secure public key encryption scheme. Furthermore, there are five candidates (three finalists and two alternatives) that passed to the third round of the process and whose security is based in lattice problems. This work analyzes the different ways in which the lattice-based candidates of the NIST call apply the Fujisaki¿Okamoto transformation and the particularities of each application. The study of such differences and their repercussion in the design of the proposals will allow a better understanding of the algorithms. Moreover, we propose a modification of the Kyber algorithm¿the only public key encryption candidate established as a PQC standard by NIST in its more recent publication¿in order to avoid the re-encryption in the decapsulation algorithm and, in this way, to reduce the side channel attacks vulnerability., 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” and 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 Artículo científico (JournalArticle)

An efficient algorithm to compute the linear complexity of binary sequences

  • Fúster Sabater, Amparo
  • Requena, Verónica
  • Cardell, Sara D.
24 páginas, 11 tablas, 4 figuras, 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., 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), co-funded by the European Regional Development Fund (ERDF, EU). It is also supported by Comunidad de Madrid (Spain) under Project CYNAMON (P2018/TCS-4566), co-funded by FSE and European Union FEDER funds. The work of the second author was partially supported by Spanish Grant VIGROB-287 of the University of Alicante
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A Hadamard matrix-based algorithm to evaluate the strength of binary sequences

  • Fúster Sabater, Amparo
  • Requena, Verónica
  • Cardell, Sara D.
Computational Science – ICCS 2022. 22nd International Conference, London, UK, June 21–23, 2022, Proceedings, Part II 14 páginas, 7 tablas, Nowadays, a wide range of critical services relies on Internet of Things (IoT) devices. Nevertheless, they often lack proper security, becoming the gateway to attack the whole system. IoT security protocols are often based on stream ciphers, where pseudo-random number generators (PRNGs) are an essential part of them. In this work, a family of strong ciphers difficult to be analyzed by standard methods is described. In addition, we will discuss an innovative technique of sequence decomposition (binomial representation) and present a novel algorithm based on Hadamard matrices to evaluate the strength (unpredictability) of binary sequences, a key part of the IoT security stack., 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), co-funded by the European Regional Development Fund (ERDF, EU). The work of the second author was partially sup- ported by Spanish grant VIGROB-287 of the University of Alacant
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Computational Analysis of Interleaving PN-Sequences with Different Polynomials

  • Cardell, Sara D.
  • Requena, Verónica
  • Fúster Sabater, Amparo
22 páginas, 6 figuras, 4 tablas, 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., 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). It was also supported by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), co-funded by FSE and European Union FEDER funds. The work of the second author was partially supported by Spanish grant VIGROB-287 of the University of Alicante.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Analysis of Cyber-Intelligence Frameworks for AI Data Processing

  • Sánchez del Monte, Alberto
  • Hernández-Álvarez, Luis
This paper deals with the concept of cyber intelligence and its components as a fundamental tool for the protection of information today. After that, the main cyber-intelligence frameworks that are currently applied worldwide (Diamond Model, Cyberkill Chain, and Mitre Att&ck) are described to subsequently analyse them through their practical application in a real critical cyber incident, as well as analyse the strengths and weaknesses of each one of them according to the comparison of seventeen variables of interest. From this analysis and considering the two actions mentioned, it is concluded that Mitre Att&ck is the most suitable framework due to its flexibility, permanent updating, and the existence of a powerful database. Finally, an explanation is given for how Mitre Att&ck can be integrated with the research and application of artificial intelligence in the achievement of the objectives set and the development of tools that can serve as support for the detection of the patterns and authorship of cyberattacks., This work was supported by the Spanish State Research Agency (AEI) of the Ministry of Science and Innovation (MCIN), project P2QProMeTe (PID2020-112586RBI00/ AEI/10.13039/501100011033). L.H.A. would like to thank CSIC Project CASDiM for its support., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

KeyEncoder: A secure and usable EEG-based cryptographic key generation mechanism

  • Hernández-Álvarez, Luis
  • Barbierato, Elena
  • Caputo, Stefano
  • Fuentes, José María de
  • González-Manzano, Lorena
  • Hernández Encinas, Luis
  • Mucchi, Lorenzo
9 páginas, 5 figuras, 3 tablas, Nowadays, a rapid, easy, and convenient access to our private information is essential to carry out both personal and professional activities. In most cases, this information is sensitive and can be stolen due to its importance and the lack of security protocols. In this study we propose a time–invariant cryptographic key generation mechanism based on electroencephalogram (EEG) signals. We employed Discrete Wavelet Transform and autoencoders to extract the biometric features from the EEG signals. Using these features, we construct a scheme to generate secure seeds that can be used as inputs for secure hash functions and obtain cryptographic keys. The mechanism proposed preserves the privacy of the user, as the cryptographic key is generated for each new EEG signal received, avoiding the need of storing the key, previous EEG signals or any other information. Results show that the proposed mechanism is secure against random attacks, as a 0% of False Acceptance Rate is reported, while generating seeds with an entropy of 0.968 in less than 500 ms., This work was supported in part by the R&D&I project P2QProMeTe, Grant PID2020-112586RBI00 funded by MCIN/AEI/10.13039/ 501100011033; in part by the Madrid (Spain) Government under the multianual agreement with UC3M (“fostering young doctor research”, DEPROFAKE-CM-UC3M) and in the context of the V PRICIT research and technological innovation regional program; in part by the European Telecommunications Standards Institute (ETSI) SmartBAN; in part by the European Union’s Horizon 2020 Research and Innovation Pro- gramme under Grants 872752 and 101017331. L.H.A. thanks CSIC Project CASDiM for its support, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Security Analysis of the Symmetric Cryptosystem TinyJambu

  • Fúster Sabater, Amparo
  • Pazo-Robles, M. E.
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/)., Symmetric cryptography provides the best examples of cryptosystems to be applied in lightweight environments (e.g., IoT). A representative example is the cryptosystem TinyJambu, one of the ten finalists in the NIST Lightweight Cryptography Standardization Project. It is an authentication encryption with associated data scheme that is extremely lightweight and fast. In this work, we analyze the security of TinyJambu from two distinct and non-symmetric points of view: (1) the improvement of the best cryptanalytical attack found in the literature and (2) a randomness analysis of the generated sequences. Concerning item (1), we launched a differential forgery attack with probability 2−65.9487, which was improved considerably compared with previous numerical results. Concerning item (2), we analyzed the degree of randomness of the TinyJambu keystream sequences with a complete and powerful battery of statistical tests. This non-symmetric study shows the weakness of TinyJambu against cryptanalytic attacks as well as the strength of TinyJambu against statistical analysis., This work is part of the R+D+i grant P2QProMeTe (PID2020-112586RB-I00), funded by MCIU/AEI/10.13039/501100011033. The authors are also supported by the University of Málaga (Spain) through “Red temática BIOMED-SEC”, reference D5-2022-04., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Cybersecurity trends in Cooperative, Connected and Automated Mobility

  • Castillo Campo, O.
  • Gayoso Martínez, Victor
  • Hernández Encinas, Luis
  • Martín Muñoz, Agustín
  • Álvarez Fernández, R.
12 páginas., Cooperative, connected and automated mobility technologies have the potential to revolutionize transportation systems and enhance safety, efficiency and sustainability. However, the increasing reliance on digital technologies also introduces new cybersecurity risks that can compromise the safety and privacy of passengers and the integrity of transportation systems. The purpose of this article is to examine the most important threats, vulnerabilities, risks and challenges related to automated mobility and to review the status of the most promising standardization initiatives on cryptography in a world where quantum computers will soon represent an actual threat., 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’., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Security in advanced metering infrastructures: Lightweight cryptography

  • Hernández-Álvarez, Luis
  • Bullón Pérez, Juan José
  • Queiruga-Dios, Araceli
7 páginas, 1 figura., Smart grids are designed to revolutionize the energy sector by creating a smarter, more efficient and reliable power supply network. The rise of smart grids is a response to the need for a more comprehensive and sophisticated energy system that caters to the needs of homes and businesses. Key features of smart grids include the integration of renewable energy sources, decentralized generation and advanced distribution networks. At the heart of smart grids is a sophisticated metering system, consisting of intelligent electronic devices that measure energy consumption and enable two-way communication between the utility company and the consumer. The information exchanged via these devices is critical, as it includes sensitive data such as energy consumption patterns and billing information. With the rise of the Internet of Things (IoT) and Industry 4.0, the security of this information is of utmost importance. This paper delves into the security challenges faced by advanced metering infrastructure (AMI) and highlights the crucial role played by cryptography in ensuring the secure exchange of sensitive information. Cryptographic protocols such as encryption, authentication and digital signatures are essential components of a secure smart grid infrastructure. These protocols work together to ensure the confidentiality, integrity and authenticity of the information exchanged between the utility company and the consumer., This work is part of the R+D+i grant P2QProMeTe (PID2020-112586RB-I00), funded by MCIN/ AEI/10.13039/501100011033. Luis Hernández-Álvarez thanks CSIC Project 202050E304 (CAS- DiM) for its support, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Structural analysis of code-based algorithms of the NIST post-quantum call

  • González de la Torre, Miguel Ángel
  • Hernández Encinas, Luis
  • Sánchez García, José Ignacio
12 páginas, 4 figuras, 3 tablas., Code-based cryptography is currently the second most promising post-quantum mathematical tool for quantum-resistant algorithms. Since in 2022 the first post-quantum standard Key Encapsulation Mechanism, Kyber (a latticed-based algorithm), was selected to be established as standard, and after that the National Institute of Standards and Technology post-quantum standardization call focused in code-based cryptosystems. Three of the four candidates that remain in the fourth round are code-based algorithms. In fact, the only non-code-based algorithm (SIKE) is now considered vulnerable. Due to this landscape, it is crucial to update previous results about these algorithms and their functioning. The Fujisaki-Okamoto transformation is a key part of the study of post-quantum algorithms and in this work we focus our analysis on Classic McEliece, BIKE and HQC proposals, and how they apply this transformation to obtain IND-CCA semantic security. Since after security the most important parameter in the evaluation of the algorithms is performance, we have compared the performance of the code-based algorithms of the NIST call considering the same architecture for all of them., This work was supported in part by project ORACLE, PCI2020-120691-2, funded by MCIN/AEI/ 10.13039/501100011033, in part by QURSA project TED2021-130369B-C33 funded by MCIN/AEI/10.13039/501100011033, both of them co-funded by the European Union ‘NextGenerationEU’/PRTR, in part by P2QProMeTe (PID2020-112586RB-I00), funded by MCIN/AEI/10.13039/501100011033, 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 Artículo científico (JournalArticle)

Study About the Performance of Ascon in Arduino Devices

  • Sarasa Laborda, Ventura
  • Hernández-Álvarez, Luis
  • Hernández Encinas, Luis
  • Sánchez García, José Ignacio
  • Queiruga-Dios, Araceli
34 páginas, 8 figuras, 18 tablas, In 2023, the Ascon cipher suite was selected as the winner of the National Institute of Standards and Technology (NIST) standardization process for lightweight cryptography, and has emerged as the leading candidate for cryptographic algorithms in resource-constrained environments. This cipher suite provides authenticated encryption with associated data and hash functionality. NIST’s Ascon proposal consists of two symmet- ric ciphers, Ascon-128 and Ascon-128a, a hash function, Ascon-HASH, an extendible output function, Ascon-XOF, and a new cipher variant, Ascon-80pq, with increased resistance to quantum attacks. This study presents an overview of the mathematical background, security principles and key properties of the Ascon cipher suite. In addition, a compre- hensive performance evaluation of Ascon on various Arduino platforms, such as Arduino DUE, Arduino Mega2560, Arduino Nano Every and Arduino Nano ESP32, is performed. A detailed comparative analysis of these implementations is also provided., This research was funded by MCIN/AEI/10.13039/501100011033 and by the European Union “NextGenerationEU”/PRTR, under QURSA project (TED2021-130369B-C33), and also was funded by MCIN/AEI/10.13039/501100011033, under P2QProMeTe project (PID2020-112586RB-I00)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Security Threats and Cryptographic Protocols for Medical Wearables

  • Luis Hernández-Álvarez
  • Juan José Bullón Pérez
  • Farrah Kristel Batista
  • Araceli Queiruga-Dios
In the past few years, the use of several medical devices is increasing. This paper will pay attention to a device developed to get measures of the temperature of diabetic foot. These wearables usually do not have cryptographic protocols to guarantee data security. This study analyzes the existing security in these devices, and simulate malware propagation taking into account the vulnerabilities and lack of security in these highly-constrained interconnected devices. A simulation of malware spreading in a network made by 10 and 15 individuals with 6 and 34 sensors each one, respectively, is included in this study. To avoid such attacks, a lightweight cryptographic protocol could be a satisfactory solution. Considering the quick development of quantum computers, several current cryptographic protocols have been compromised., This work was supported by the Spanish State Research Agency (AEI) of theMinistry of Science and Innovation (MICINN), project P2QProMeTe (PID2020-112586RB-I00/AEI/10.13039/501100011033), Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Security in advanced metering infrastructures: Lightweight cryptography

  • Luis Hernández-Álvarez
  • Juan José Bullón Pérez
  • Araceli Queiruga-Dios
Smart grids are designed to revolutionize the energy sector by creating a smarter, more efficient and reliable power supply network. The rise of smart grids is a response to the need for a more comprehensive and sophisticated energy system that caters to the needs of homes and businesses. Key features of smart grids include the integration of renewable energy sources, decentralized generation and advanced distribution networks. At the heart of smart grids is a sophisticated metering system, consisting of intelligent electronic devices that measure energy consumption and enable two-way communication between the utility company and the consumer. The information exchanged via these devices is critical, as it includes sensitive data such as energy consumption patterns and billing information. With the rise of the Internet of Things (IoT) and Industry 4.0, the security of this information is of utmost importance. This paper delves into the security challenges faced by advanced metering infrastructure (AMI) and highlights the crucial role played by cryptography in ensuring the secure exchange of sensitive information. Cryptographic protocols such as encryption, authentication and digital signatures are essential components of a secure smart grid infrastructure. These protocols work together to ensure the confidentiality, integrity and authenticity of the information exchanged between the utility company and the consumer., This work is part of the R+D+i grant P2QProMeTe (PID2020-112586RB-I00), funded by MCIN/ AEI/10.13039/501100011033. Luis Hernández-Álvarez thanks CSIC Project 202050E304 (CASDiM) for its support., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

The lightweight cryptosystem TinyJambu: security and applications in IoT environments

  • Fúster Sabater, Amparo
  • Pazo-Robles, M. E.
12 páginas, 4 figuras, 6 tablas, The Internet of Things (IoT) is one of the keywords in information technologies and computer science. In the near future, IoT technology will be deployed more and more to connect devices of very different types. Some of them use powerful processors and can perform the same cryptographic algorithms as those of standard PCs. However, many other devices use extremely low power microcontrollers that can hardly devote a small fraction of their computational power to security features. It is inside this kind of hardware that we intend to introduce our cryptography. In lightweight cryptography, the concern is not only the security but also the performance. Dealing with small hardware, e.g. 2000–2500 Gate Equivalent (GE), performance is an issue not only in terms of throughput but also to stand up against hackers with a potentially enormous computational power. In brief, these small IoT devices should jointly stand against hackers as well as against cryptographic security issues., This work is part of the R+D+i grant P2QProMeTe (PID2020-112586RB-I00) funded by MICI- U/AEI/10.13039/501100011033 (Spain) and by University of Malaga (Spain) through ‘Red temática BIOMED-Sec’, reference D5-2022-04, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A new algebraic approach to binary sequences and Boolean functions

  • Cardell, Sara D.
  • Fúster Sabater, Amparo
  • Requena, Verónica
  • Beltrá, Miguel
33 páginas, 3 figuras, 4 tablas, 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 repre- sentations of Boolean functions and to binary sequences. Moreover, several cryp- tographic 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., This work is part of the R+D+i grant P2QProMeTe (PID2020-112586RB-I00) funded by MICIU/AEI/10.13039/501100011033 (Spain). The work of the first author was supported by Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), Brazil, project 405842/2023-6 and Fapesp with process 2024/05051-7. The work of the third and fourth authors was partially supported by the Spanish I+D+i project PID2022-142159OB-I00 of the Ministerio de Ciencia e Innovación, I+D+i project CIAICO/2022/167 of the Generalitat Valenciana, and the I+D+i project VIGROB23-287 and UADIF23-132 of the Universitat d’Alacant., Peer reviewed
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Trace-based cryptanalysis of cyclotomic R_{q,0}xR_q-PLWE for the non-split case

  • Blanco Chacón, Iván|||0000-0002-4666-019X
  • Barbero Lucas, Beatriz
  • Durán Díaz, José Raúl|||0000-0001-6217-4768
  • Njah Epouse Nchiwo, Rahinatou Yuh
We describe a decisional attack against a version of the PLWE problem in which the samples are taken from a certain proper subring of large dimension of the cyclotomic ring Fq[x]/(Φp k (x)) with k > 1 in the case where q ≡ 1 (mod p) but Φp k (x) is not totally split over Fq. Our attack uses the fact that the roots of Φp k (x) over suitable extensions of Fq have zero-trace and has overwhelming success probability as a function of the number of input samples. An implementation in Maple and some examples of our attack are also provided., Agencia Estatal de Investigación, Universidad de Alcalá