Pasar al contenido principal

CRIPTOGRAFIA PARA OPTIMIZAR LA PRIVACIDAD Y LA CIBERSEGURIDAD

TIN2017-84844-C2-1-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2017
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

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

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

Gaussian Pseudorandom Number Generator Using Linear Feedback Shift Registers in Extended Fields

  • Cotrina Cuenca, Guillermo
  • Peinado-Domínguez, Alberto
  • Ortiz-García, Andrés
A new proposal to generate pseudorandom numbers with Gaussian distribution is presented. The generator is a generalization to the extended field GF(2n) of the one using cyclic rotations of linear feedback shift registers (LFSRs) originally defined in GF(2). The rotations applied to LFSRs in the binary case are no longer needed in the extended field due to the implicit rotations found in the binary equivalent model of LFSRs in GF(2n). The new proposal is aligned with the current trend in cryptography of using extended fields as a way to speed up the bitrate of the pseudorandom generators. This proposal allows the use of LFSRs in cryptography to be taken further, from the generation of the classical uniformly distributed sequences to other areas, such as quantum key distribution schemes, in which sequences with Gaussian distribution are needed. The paper contains the statistical analysis of the numbers produced and a comparison with other Gaussian generators., Ministerio de Economía y Competividad
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Randomness Analysis for the Generalized Self-Shrinking Sequences

  • Cardell, Sara D.
  • Requena Arévalo, Verónica
  • Fúster Sabater, Amparo
  • Orúe López, Amalia
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
In cryptography, the property of randomness in pseudo-random generators is very important to avoid any pattern in output sequences, to provide security against attacks, privacy and anonymity. In this article, the randomness of the family of sequences obtained from the generalized self-shrinking generator is analyzed. Moreover, the characteristics, generalities and relationship between the t-modified self-shrinking generator and the generalized self-shrinking generator are presented. We find that the t-modified self-shrunken sequences can be generated from a generalized self-shrinking generator. Then, an in-depth analysis of randomness focused on the generalized sequences by means of complete and powerful batteries of statistical tests and graphical tools is done, providing a useful vision of the behaviour of these sequences and proving that they are suitable to be used in cryptography.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Representations of Generalized Self-Shrunken Sequences

  • Cardell, Sara D.
  • Climent, Joan-Josep
  • Fúster Sabater, Amparo
  • Requena Arévalo, Verónica
  • Climent, Joan-Josep|||/items/e5ad2c13-73d7-48cd-a8a0-c74efa487a1c
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
Output sequences of the cryptographic pseudo-random number generator, known as the generalized self-shrinking generator, are obtained self-decimating Pseudo-Noise (PN)-sequences with shifted versions of themselves. In this paper, we present three different representations of this family of sequences. Two of them, the p and G-representations, are based on the parameters p and G corresponding to shifts and binary vectors, respectively, used to compute the shifted versions of the original PN-sequence. In addition, such sequences can be also computed as the binary sum of diagonals of the Sierpinski’s triangle. This is called the B-representation. Characteristics and generalities of the three representations are analyzed in detail. Under such representations, we determine some properties of these cryptographic sequences. Furthermore, these sequences form a family that has a group structure with the bit-wise XOR operation.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Interleaving Shifted Versions of a PN-Sequence

  • Cardell, Sara D.
  • Fúster Sabater, Amparo
  • Requena Arévalo, Verónica
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
The output sequence of the shrinking generator can be considered as an interleaving of determined shifted versions of a single PN -sequence. In this paper, we present a study of the interleaving of a PN-sequence and shifted versions of itself. We analyze some important cryptographic properties as the period and the linear complexity in terms of the shifts. Furthermore, we determine the total number of the interleaving sequences that achieve each possible value of the linear complexity.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Randomness Analysis for the Generalized Self-Shrinking Sequences

  • Cardell, Sara D.
  • Requena, Verónica
  • Fúster Sabater, Amparo
  • Orúe, Amalia B.
© 2019 by the authors., In cryptography, the property of randomness in pseudo-random generators is very important to avoid any pattern in output sequences, to provide security against attacks, privacy and anonymity. In this article, the randomness of the family of sequences obtained from the generalized self-shrinking generator is analyzed. Moreover, the characteristics, generalities and relationship between the t-modified self-shrinking generator and the generalized self-shrinking generator are presented. We find that the t-modified self-shrunken sequences can be generated from a generalized self-shrinking generator. Then, an in-depth analysis of randomness focused on the generalized sequences by means of complete and powerful batteries of statistical tests and graphical tools is done, providing a useful vision of the behaviour of these sequences and proving that they are suitable to be used in cryptography., This research has been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS, reference TIN2017-84844-C2-1-R, and by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), also co-funded by FSE and European Union FEDER funds. The first author was supported by CAPES (Brazil). The second author was partially supported by Spanish grant VIGROB-287 of the Universitat d’Alacant., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A Virus Infected Your Laptop. Let’s Play an Escape Game

  • Queiruga Dios, Araceli
  • Santos Sánchez, María Jesús
  • Queiruga Dios, Marián
  • Gayoso Martínez, Víctor
  • Hernández Encinas, Ascensión
© 2020 by the authors., Have you ever thought what would happen if a ransomware infected your laptop? This type of virus kidnaps files and encrypts them, and the only way to recover the data is by paying in bitcoin or some other cryptocurrency. This situation is undoubtedly terrible. All of your work, projects, and personal files will not be available (unless you pay the ransom). The first time students watched a video that contextualizes this stressful situation, they thought that they had been attacked by a computer virus. Fortunately, the panic only lasted a few seconds. This is the way to start a game called breakout or escape room. The difference between these two words is that, in the first case, the goal is to open a padlocked box, while the objective of an escape room is to find the key that allows to get out of a room. Both games are similar, containing riddles, puzzles, problems and some clues that would help the players to find the solution. This study analyses the use of a breakout game for educational purposes, more specifically in a university context. The experiment conducted mixes game–based learning methodologies with engineering students learning Linear Algebra, Calculus or Cryptography, which has allowed us to obtain promising results about the usage of this methodology., This work has been supported in part by the Erasmus+ program of the European Union under grant 2017-1-ES01-KA203-038491 (RULES_MATH), in part by Ministerio de Ciencia, Innovación y Universidades (MCIU, Spain), Agencia Estatal de Investigación (AEI, Spain), and Fondo Europeo de Desarrollo Regional (FEDER, UE) under Project COPCIS (grant number TIN2017-84844-C2-1-R) and Project MAGERAN (grant number TIN2017-84844-C2-2-R)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

An Improved Bytewise Approximate Matching Algorithm Suitable for Files of Dissimilar Sizes

  • Gayoso Martínez, Víctor
  • Hernández Álvarez, Fernando
  • Hernández Encinas, Luis
© 2020 by the authors, The goal of digital forensics is to recover and investigate pieces of data found on digital devices, analysing in the process their relationship with other fragments of data from the same device or from different ones. Approximate matching functions, also called similarity preserving or fuzzy hashing functions, try to achieve that goal by comparing files and determining their resemblance. In this regard, ssdeep, sdhash, and LZJD are nowadays some of the best-known functions dealing with this problem. However, even though those applications are useful and trustworthy, they also have important limitations (mainly, the inability to compare files of very different sizes in the case of ssdeep and LZJD, the excessive size of sdhash and LZJD signatures, and the occasional scarce relationship between the comparison score obtained and the actual content of the files when using the three applications). In this article, we propose a new signature generation procedure and an algorithm for comparing two files through their digital signatures. Although our design is based on ssdeep, it improves some of its limitations and satisfies the requirements that approximate matching applications should fulfil. Through a set of ad-hoc and standard tests based on the FRASH framework, it is possible to state that the proposed algorithm presents remarkable overall detection strengths and is suitable for comparing files of very different sizes. A full description of the multi-thread implementation of the algorithm is included, along with all the tests employed for comparing this proposal with ssdeep, sdhash, and LZJD., This work was supported in part by the Ministerio de Economía, Industria y Competitividad (MINECO), in part by the Agencia Estatal de Investigación (AEI), in part by the Fondo Europeo de Desarrollo Regional (FEDER, UE) under Project COPCIS, Grant TIN2017-84844-C2-1-R, and in part by the Comunidad de Madrid (Spain) under Project reference P2018/TCS-4566-CM (CYNAMON), also cofunded by European Union FEDER funds. Víctor Gayoso Martínez would like to thank CSIC Project CASP2/201850E114 for its support., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A Group Law on the Projective Plane with Applications in Public Key Cryptography

  • Durán Díaz, Raúl
  • Hernández Encinas, Luis
  • Muñoz Masqué, Jaime
© 2020 by the authors., In the context of new threats to Public Key Cryptography arising from a growing computational power both in classic and in quantum worlds, we present a new group law defined on a subset of the projective plane FP2 over an arbitrary field F , which lends itself to applications in Public Key Cryptography and turns out to be more efficient in terms of computational resources. In particular, we give explicitly the number of base field operations needed to perform the mentioned group law. Based on it, we present a Diffie-Hellman-like key agreement protocol. We analyze the computational difficulty of solving the mathematical problem underlying the proposed Abelian group law and we prove that the security of our proposal is equivalent to the discrete logarithm problem in the multiplicative group of the cubic extension of the finite field considered. We present an experimental setup in order to show real computation times along a comparison with the group operation in the group of points of an elliptic curve. Based on current state-of-the-art algorithms, we provide parameter ranges suitable for real world applications. Finally, we present a promising variant of the proposed group law, by moving from the base field F to the ring Z/pqZ , and we explain how the security becomes enhanced, though at the cost of a longer key length., This research has been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and European Regional Development Fund (ERDF, EU), through project COPCIS, Grant No. TIN2017-84844-C2-1-R, and by Comunidad de Madrid (Spain) through project CYNAMON, Grant No. P2018/TCS-4566-CM, co-funded along with ERDF., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

NetVote: A Strict-Coercion Resistance Re-Voting Based Internet Voting Scheme with Linear Filtering

  • Querejeta-Azurmendi, Iñigo
  • Arroyo Guardeño, David
  • Hernández-Ardieta, Jorge L.
  • Hernández Encinas, Luis
© 2020 by the authors., This paper proposes NetVote, an internet voting protocol where usability and ease in deployment are a priority. We introduce the notion of strict coercion resistance, to distinguish between vote-buying and coercion resistance. We propose a protocol with ballot secrecy, practical everlasting privacy, verifiability and strict coercion resistance in the re-voting setting. Coercion is mitigated via a random dummy vote padding strategy to hide voting patterns and make re-voting deniable. This allows us to build a filtering phase with linear complexity, based on zero knowledge proofs to ensure correctness while maintaining privacy of the process. Voting tokens are formed by anonymous credentials and pseudorandom identifiers, achieving practical everlasting privacy, where even if dealing with a future computationally unbounded adversary, vote intention is still hidden. It is not assumed for voters to own cryptographic keys prior to the election, nor store cryptographic material during the election. This property allows voters not only to vote multiple times, but also from different devices each time, granting the voter a vote-from-anywhere experience. This paper builds on top of the paper published in CISIS’19. In this version, we modify the filtering. Moreover, we formally define the padding technique, which allows us to perform the linear filtering scheme. Similarly we provide more details on the protocol itself and include a section of the security analysis, where we include the formal definitions of strict coercion resistance and a game based definition of practical everlasting privacy. Finally, we prove that NetVote satisfies them all., This research has been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and European Regional Development Fund (ERDF, EU), through project COPCIS, grant number TIN2017-84844-C2-1-R, and by Comunidad de Madrid (Spain) through project CYNAMON, grant number P2018/TCS-4566-CM, co-funded along with ERDF., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Privacy-Preserving Sensor-Based Continuous Authentication and User Profiling: A Review

  • Hernández-Álvarez, Luis
  • Fuentes, José María de
  • González-Manzano, Lorena
  • Hernández Encinas, Luis
© 2020 by the authors., Ensuring the confidentiality of private data stored in our technological devices is a fundamental aspect for protecting our personal and professional information. Authentication procedures are among the main methods used to achieve this protection and, typically, are implemented only when accessing the device. Nevertheless, in many occasions it is necessary to carry out user authentication in a continuous manner to guarantee an allowed use of the device while protecting authentication data. In this work, we first review the state of the art of Continuous Authentication (CA), User Profiling (UP), and related biometric databases. Secondly, we summarize the privacy-preserving methods employed to protect the security of sensor-based data used to conduct user authentication, and some practical examples of their utilization. The analysis of the literature of these topics reveals the importance of sensor-based data to protect personal and professional information, as well as the need for exploring a combination of more biometric features with privacy-preserving approaches., L.H.-Á. and L.H.E. have been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI) and European Regional Development Fund (ERDF), through Project COPCIS, grant No. TIN2017-84844-C2-1-R, J.M.d.F. and L.G.-M. by CAVTIONS-CM-UC3M funded by UC3M and the Government of Madrid (CAM), and by Ministry of Science and Innovation of Spain by grant PID2019-111429RB-C21, and all authors by Comunidad de Madrid (Spain) through Project CYNAMON, grant No. P2018/TCS-4566-CM, co-funded with ERDF., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Using the Spanish national identity card in social networks

  • Gayoso Martínez, Víctor
  • Hernández Encinas, Ascensión
  • Martín Muñoz, Agustín
  • Durán Díaz, Raúl
12 páginas.- 4 figuras, The distinctive security features of the Spanish electronic national identity card, known as Documento Nacional de Identidad electrónico, allow us to propose the usage of this cryptographic smart card in an authentication framework that can be used during the registration and login phases of internet services where the validation of the user¿s age and real identity are key elements, as it is the case for example of the so-called social networks. Using this mechanism with NFC-capable devices, the identity and age of the potential user can be determined, allowing or denying the access to the service based on that information., This research has been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI) and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS, reference TIN2017-84844-C2-1-R, and by the European Union program ERASMUS+ under the project 2017-1-ESO1-KA203-038491 (Rules_Math).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Square-Zero Basis of Matrix Lie Algebras

  • Durán Díaz, Raúl
  • Hernández Encinas, Luis
  • Muñoz Masqué, Jaime
9 páginas, A method is presented that allows one to compute the maximum number of functionally-independent invariant functions under the action of a linear algebraic group as long as its Lie algebra admits a basis of square-zero matrices even on a field of positive characteristic. The class of such Lie algebras is studied in the framework of the classical Lie algebras of arbitrary characteristic. Some examples and applications are also given., This research has been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and European Regional Development Fund (ERDF, EU), through project COPCIS, grant number TIN2017-84844-C2-1-R, and by Comunidad de Madrid (Spain) through project CYNAMON, grant number P2018/TCS-4566-CM, co-funded along with ERDF.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Recovering decimation-based cryptographic sequences by means of linear CAs

  • Díaz Cardell, Sara
  • Aranha, Diego F.
  • Fúster Sabater, Amparo
13 páginas. 6 tablas., The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata. These sequences are composed of interleaved m-sequences produced by linear structures based on feedback shifts. This profitable characteristic can be used in the cryptanalysis of this generator. In this work, we propose an algorithm that takes advantage of the inherent linearity of these cellular automata and the interleaved m-sequences. Although irregularly decimated generators have been conceived and designed as non-linear sequence generators, in practice they can be easily analyzed in terms of simple linear structures., The first author was partially support by FAPESP with grant 2015/07246-0 and CAPES. This research has been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS, reference TIN2017-84844-C2- 1-R, and by Comunidad de Madrid (Spain) under project reference S2013/ICE-3095-CIBERDINE-CM, also co-funded by European Union FEDER funds.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Secure elliptic curves and their performance

  • Gayoso Martínez, Víctor
  • Hernández Encinas, Luis
  • Martín Muñoz, Agustín
  • Durán Díaz, Raúl
13 páginas, 2 tablas, Elliptic Curve Cryptography (ECC) is a branch of public-key cryptography based on the arithmetic of elliptic curves. In the short life of ECC, most standards have proposed curves defined over prime finite fields satisfying the curve equation in the short Weierstrass form. However, some researchers have started to propose as a securer alternative the use of Edwards and Montgomery elliptic curves, which could have an impact in current ECC deployments. This contribution evaluates the performance of the three types of elliptic curves using some of the examples provided by the initiative SafeCurves and a Java implementation developed by the authors, which allows us to offer some conclusions about this topic., This work has been partially supported by Ministerio de Econom´ıa, Industria y Competitividad (MINECO), Agencia Estatal de Investigaci´on (AEI), and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS, reference TIN2017-84844-C2-1-R, and by Comunidad de Madrid (Spain) under project CIBERDINE, reference S2013/ICE-3095-CM, also co-financed by European Union FEDER funds.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Comparing low and medium cost computer-based technologies suitable for cryptographic attacks

  • Gayoso Martínez, Víctor
  • Hernández Encinas, Luis
  • Martín Muñoz, Agustín
  • Martínez-Graullera, Óscar
14 páginas, 4 figuras, 10 tablas, Initially developed for tasks related to computer graphics, GPUs are increasingly being used for general purpose processing, including scientific and engineering applications. In this contribution, we have compared the performance of two graphics cards that belong to the parallel computing CUDA platform with two C++ and Java multi-threading implementations, using as an example of computation a brute-force attack on Hitag2, a well known remote keyless entry application. The results allow us to provide valuable information regarding the compared capabilities of the tested platforms and to confirm that such a weak encryption system could be broken in less than a day with medium cost equipment., This work has been partially supported by Ministerio de Econom´ıa, Industria y Competitividad (MINECO), Agencia Estatal de Investigaci´on (AEI), and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS, reference TIN2017-84844-C2-1-R, and by Comunidad de Madrid (Spain) under project CIBERDINE, reference S2013/ICE-3095-CM, also co-financed by European Union FEDER funds.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Interleaving Shifted Versions of a PN-Sequence

  • Díaz Cardell, Sara
  • Fúster Sabater, Amparo
  • Requena, Verónica
The output sequence of the shrinking generator can be considered as an interleaving of determined shifted versions of a single PN -sequence. In this paper, we present a study of the interleaving of a PN-sequence and shifted versions of itself. We analyze some important cryptographic properties as the period and the linear complexity in terms of the shifts. Furthermore, we determine the total number of the interleaving sequences that achieve each possible value of the linear complexity., This research is partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS, reference TIN2017-84844-C2-1-R. It is also supported by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), co-funded by FSE and European Union FEDER funds. Finally, the third author is partially supported by Spanish grant VIGROB-287 of the Universitat d’Alacant., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Quadratic Maps in Two Variables on Arbitrary Fields

  • Durán Díaz, Raúl
  • Hernández Encinas, Luis
  • Muñoz Masqué, Jaime
10 páginas, Let F be a field of characteristic different from 2 and 3, and let V be a vector space of dimension 2 over F. The generic classification of homogeneous quadratic maps f: V→V under the action of the linear group of V, is given and efficient computational criteria to recognize equivalence are provided., This research has been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and European Regional Development Fund of the European Union (ERDF, EU) under project COPCIS, reference TIN2017-84844-C2-1-R, and by Comunidad de Madrid (Spain) under project reference P2018/TCS-4566-CM (CYNAMON) also co-funded by ERDF.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Review of binomial decomposition-based algorithms for efficient linear complexity computation

  • Martín Navarro, José Luis
  • Fúster Sabater, Amparo
22 páginas; 6 figuras; 5 tablas, The ubiquity of smart devices and IoT are the main forces behind the development of cryptographic primitives that preserve the security of these devices, with the resource constraints they face. In this sense, the development of lightweight cryptographic algorithms, where PRNGs are an essential part of them, provides security to all these interconnected devices. In this work, a family of sequence generators with hard characteristics to be analyzed by standard methods is described. Moreover, we introduce an innovative technique for sequence decomposition that allows one to extract useful information on the sequences under study. In addition, diverse algorithms to evaluate the strength of such binary sequences have been introduced and analyzed to show which performs better., Research partially supported by Ministerio de Economía, Industria y Competitividad, Agencia Estatal de Investigación, and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS (MICIU/ICTI2017-2020/) and by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), also co-funded by European Union FEDER funds
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Review of the Lineal Complexity Calculation through Binomial Decomposition-Based Algorithms

  • Martín Navarro, José Luis
  • Fúster Sabater, Amparo
22 páginas; 6 figuras; 5 tablas, The ubiquity of smart devices and IoT are the main forces behind the development of cryptographic primitives that preserve the security of these devices, with the resource constraints they face. In this sense, the development of lightweight cryptographic algorithms, where PRNGs are an essential part of them, provides security to all these interconnected devices. In this work, a family of sequence generators with hard characteristics to be analyzed by standard methods is described. Moreover, we introduce an innovative technique for sequence decomposition that allows one to extract useful information on the sequences under study. In addition, diverse algorithms to evaluate the strength of such binary sequences have been introduced and analyzed to show which performs better., Research partially supported by Ministerio de Economía, Industria y Competitividad, Agencia Estatal de Investigación, and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS (MICIU/ICTI2017-2020/) and by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), also co-funded by European Union FEDER funds
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Building A blockchain-based decentralized digital asset management system for commercial aircraft leasing

  • Kuhle, Paul
  • Arroyo Guardeño, David
  • Schuster, Eric
21 páginas, 17 figuras, 6 tablas, The blockchain technology has the potential to drastically change the way record-keeping and asset management is done. While more and more aerospace companies are starting to adopt the new technology, commercial aircraft leasing can still be considered uncharted territory for blockchain applications. The present paper analyzes how the sector stands to benefit from such a solution and proposes a suitable blockchain application design, focusing both on the regulatory and business needs as well as the implementation from a technological perspective. Our proof-of-concept demonstrates that asset management in commercial aircraft leasing can realistically be handled by a blockchain solution such as the one proposed in this paper., This work has been supported by the Comunidad de Madrid (Spain) under the project CYNAMON (P2018/TCS-4566), co-financed with FSE and FEDEREU funds, by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and European Regional Development Fund (ERDF,EU), through project COPCIS, grant number TIN2017-84844-C2-1-R, and by the Consejo Superior de Investigaciones Científicas (CSIC) under the project LINKA20216 (“Advancing in cybersecurity technologies”, i-LINK+program) .We thank flightera.net for providing us with flight data for the simulation.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Representations of Generalized Self-Shrunken Sequences

  • Cardell, Sara D.
  • Climent, Joan Josep
  • Fúster Sabater, Amparo
  • Requena, Verónica
27 páginas, 8 tablas, 2 figuras, Output sequences of the cryptographic pseudo-random number generator, known as the generalized self-shrinking generator, are obtained as self-decimating Pseudo-Noise (PN)-sequences with shifted versions of themselves. In this paper, we present three different representations of this family of sequences. Two of them, the p and G-representations, are based on the parameters p and G corresponding to shifts and binary vectors, respectively, used to compute the shifted versions of the original PN-sequence. In addition, such sequences can be also computed as the binary sum of diagonals of the Sierpinski's triangle. This is called the $B$-representation. Characteristics and generalities of the three representations are analyzed in detail. Under such representations, we determine some properties of these cryptographic sequences. Furthermore, these sequences form a family that has a group structure with the bit-wise XOR operation., This research is partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS, reference TIN2017-84844-C2-1-R. 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 first author is supported by CAPES (Brazil). Finally, the second and fourth author are partially supported by Spanish grant VIGROB-287 of the Universitat d’Alacant.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Randomness Analysis for GSS-sequences Concatenated

  • Díaz Cardell, Sara
  • Fúster Sabater, Amparo
  • Orúe, Amalia B.
  • Requena, Verónica
Trabajo presentado en el 13th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2020) 10 páginas, 4 figuras, 2 tablas, Binary sequences produced by a generator should appear as random as possible, that is, have no logical pattern to be used in cryptographic applications. In this paper, we give a detailed analysis of the randomness of a family of binary sequences obtained from generalized self-shrinking generator, an element in the class of decimation-based sequence generators. We have applied the most important batteries of statistical tests to the sequence resulting from the concatenation of the family of generalized sequences obtained from a PN-sequence. This complete study provides good results and allow us to construct a new binary sequence with good cryptographic properties from a family of generalized self-shrunken sequences., This research has been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and Fondo Europeo de Desarrollo Regional (FEDER, UE) under project COPCIS, reference TIN2017-84844-C2-1-R, and by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), also co-funded by FSE and European Union FEDER funds. The first author was supported by CAPES (Brazil).The fourth author was partially supported by Spanish grant VIGROB-287 of the Universitat d’Alacant. Author Contributions: All the authors have equally contributed to the reportedresearch in conceptualization, methodology, software and manuscript revision
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

SmartCAMPP - Smartphone-based Continuous Authentication leveraging Motion sensors with Privacy Preservation

  • Hernández-Álvarez, Luis
  • De Fuentes, José María
  • González-Manzano, Lorena
  • Hernández Encinas, Luis
8 páginas, 8 tablas, 5 figuras, Continuous Authentication (CA) approaches are attracting attention due to the explosion of available sensors from IoT devices such as smartphones. However, a critical privacy concern arises when CA data is outsourced. Data from motion sensors may reveal users' private issues. Despite the need for CA in smartphones, no previous work has explored how to tackle this matter leveraging motion sensors in a privacy-preserving way. In this work, a mechanism dubbed SmartCAMPP is proposed to achieve CA based on gyroscope and accelerometer data. Format-preserving encryption techniques are applied to privately outsource them. Our results show the suitability of the proposed scheme, featuring $76.85\%$ of accuracy while taking 5.12 ms. of computation for authenticating each user. Interestingly, the use of cryptography does not lead to a significant impact as compared to a non-privacy-preserving mechanism., The authors would like to thank the anonymous reviewers for the irinsightful comments.This work was partially supported by Spanish MINECO , AEI and European Regional Development Fund (ERDF), through grantsTIN2017-84844-C2-1-R (COPCIS) and PID2019-111429RBC21 (ODIO); by Comunidad de Madrid (Spain) through grant P2018/TCS-4566-CM (CYNAMON), co-funded with ERDF, and also jointly with Univ. Carlos III de Madrid, grant CAVTIONS-CM-UC3M. Lorena González and José María de Fuentes would like to thank the Excellence Program for University Re-searchers .LuisHernández-Álvarez would like to thank CSIC Project 202050E304(CASDiM).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Criptoanálisis del esquema de dinero cuántico de clave pública de Aaronson y Christiano

  • Conde Pena, Marta
  • Hernández Encinas, Luis
  • Durán Díaz, Raúl
  • Faugère, Jean-Charles
  • Perret, Ludovic
XVI Reunión Española sobre Criptología y Seguridad de la Información (RECSI), Lleida 14-15-16 Abril 2021, editores Josep M. Miret y Francesc Sebé. 6 páginas, 2 figuras, En este trabajo se presenta un criptoanálisis del esquema de dinero cuántico propuesto por Aaronson y Christiano que se deriva de la existencia de algoritmos no cuánticos de tiempo polinómico probabilístico capaces de resolver los problemas de los subespacios ocultos con y sin ruido en que dicho esquema está basado, Este trabajo ha sido parcialmente financiado por el Ministerio de Economía, Industria y Competitividad (MINECO), la Agencia Estatal de Investigación (AEI) y el Fondo Europeo de Desarrollo Regional (FEDER, UE), a través del proyecto COPCIS, referencia TIN2017-84844-C2-1-R, y por la Comunidad de Madrid (Spain) a través del proyecto CYNAMON,referencia P2018/TCS-4566-CM, también cofinanciado con fondos FEDER de la Unión Europea
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Using Freeware Mathematical Software in Calculus Classes

  • Gayoso Martínez, Víctor
  • Hernández Encinas, Luis
  • Martín Muñoz, Agustín
  • Queiruga Dios, Araceli
International Conference on Mathematics and its Applications in Science and Engineering (ICMASE 2020), on-line conference. July 9-10, 2020. 10 páginas, 10 figuras., Due to the Bologna Accord, the teaching of mathematics has undergone importantchanges. Some of the most visible modifications have been the need to complementthe traditional teaching-learning process with practical, real-life cases and thepossibility to reinforce the introduction and usage of key concepts throughmathematical software.Nowadays, there exist many computational packagesdealing with mathematics, some of the best-known being Mathematica and Matlab.However, although they are very complete and powerful, they demand the use ofcommercial licences, which can be a problem for some education institutions orin the cases where students desire to use the software in an unlimited number ofdevices or to access from several of them simultaneously.In this article, we show how to apply GeoGebra and WolframAlpha to the processof teaching Calculus to first-year university students.While GeoGebra is aninteractive geometry, algebra, statistics, and calculus application available both asan online resource and a native application in Windows, macOS, and Linux systems,WolframAlpha is a computational knowledge engine developed by a subsidiaryof Wolfram Research, the company behind Mathematica. However, unlike thatproduct, WolframAlpha can be accessed by any individual as a web service free ofcharge. One of the key aspects of WolframAlpha is the possibility to use naturallanguage and Mathematica syntax for requesting computations, which allows usersto benefit from a large amount of Mathematica resources.Being able to use GeoGebra and WolframAlpha as web services withoutdownloading and installing software is another important advantage, as it avoidsthe need to have adminstrator rights to use those computational engines, whichtypically represents a problem in education centres where lab computers arelocked so students cannot inadvertently install malware that can compromise theuniversity’s network.As the best way to show a topic in mathematics is to provide examples,this contribution focuses on the main topics associated to a first-year Calculus class (limits, continuity, derivatives, curve interpolation and integrals), providingexamples with GeoGebra and WolframAlpha for the computations and concreteexamples used in actual Calculus classes., This work was supported in part by the Ministerio de Economía, Industria y Competitividad (MINECO), in part by the Agencia Estatal de Investigación (AEI), in part by the Fondo Europeo de Desarrollo Regional (FEDER, UE) under Project COPCIS, Grant TIN2017-84844-C2-1-R, and in part by the Erasmus+ program of the European Union under grant 2017-1-ES01-KA203-038491(RULES_MATH). Víctor Gayoso Martínez would like to thank CSIC Project CASP2/201850E114 for its support.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

An Innovative Linear Complexity Computation for Cryptographic Sequences

  • Martín-Navarro, José Luis
  • Fúster Sabater, Amparo
  • Cardell, Sara D.
13th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2020); 10 páginas, 3 tablas, 2 figuras, A simple algorithm to compute the linear complexity of binary sequences with period a power of 2 has been proposed. The algorithm exploits the fractal structure of the binomial representation in this kind of binary sequences. The application of the general algorithm to a particular family of cryptographic sequences (generalized sequences) improves its performance as decreases the amount of sequence to be processed., Research partially supported by Ministerio de Economía, Industria y Competitividad, Agencia Estatal de Investigación, and Fondo Europeo de Desarrollo Regional(FEDER, UE) under project COPCIS (TIN2017-84844-C2-1-R) and by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), also co-funded by European Union FEDER funds. The first author was supported by JAE INTRO’19.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Folding-BSD Algorithm for Binary Sequence Decomposition

  • Martín Navarro, José Luis
  • Fúster Sabater, Amparo
Computational Science and Its Applications – ICCSA 2020 20th International Conference, Cagliari, Italy, July 1–4, 2020, Proceedings, Part I. 14 páginas, 5 tablas, 2 figuras, The IoT revolution leads to a range of critical services which rely on IoT devices. Nevertheless, they often lack proper security, becom- ing the gateway to attack the whole system. IoT security protocols often rely on stream ciphers, where PRNGs are an essential part of them. In this article, a family of ciphers with strong characteristics that make them difficult to be analyzed by standard methods is described. In addition, we will discuss an innovative technique of sequence decomposition and present a novel algorithm to evaluate the strength of binary sequences, key part of the IoT security stack., Research partially supported by Ministerio de Economía, Industria y Competitividad, Agencia Estatal de Investigación, and Fondo Europeo de Desarrollo Regional(FEDER, UE) under project COPCIS (TIN2017-84844-C2-1-R) and by Comunidad de Madrid (Spain) under project CYNAMON (P2018/TCS-4566), also co-funded by European Union FEDER funds. The first author was supported by JAE ”Introduction to research scholarships for students” of the Spanish Ministry of Science and Innovation.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Linear complexity of generalized sequences by comparison of PN-sequences

  • Fúster Sabater, Amparo
  • Cardell, Sara D.
An earlier version of this paper was presented at the Conference “Linear Algebra, Matrix Analysis and Applications. ALAMA2018”, held in Sant Joan d’Alacant on May/June 2018. 18 páginas, 7 tablas, 2 figuras, Linear complexity is a much used metric of the security of any binary sequence with application in communication systems and cryptography. In this work, we propose a method of computing the linear complexity of a popular family of cryptographic sequences, the so-called generalized sequences. Such a family is generated by means of the irregular decimation of a single Pseudo Noise sequence (PN-sequence). The computation method is based on the comparison of the PN-sequence with shifted versions of itself. The concept of linear recurrence relationship and the rows of the Sierpinski triangle play a leading part in this computation., This research has been partially supported by Ministerio de Economía, Industria y Competitividad(MINECO), Agencia Estatal de Investigación (AEI), and Fondo Europeo de Desarrollo Regional (FEDER,UE) under project COPCIS, reference TIN2017-84844-C2-1-R, and by Comunidad de Madrid (Spain) underproject CYNAMON, reference P2018/TCS-4566, also co-funded by European Union FEDER funds. Sara D.Cardell was supported by CAPES (Coordenação de Aperfeiçoamento de Pessoal de Nível Superior), Brazil,and Sao Paulo Research Foundation (FAPESP), grant 2013/25977-7.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Chor-Rivest Knapsack Cryptosystem in a Post-quantum World

  • Durán Díaz, Raúl
  • Hernández-Álvarez, Luis
  • Hernández Encinas, Luis
  • Queiruga Dios, Araceli
The book presents the proceedings of four conferences: The 19th International Conference on Security & Management (SAM'20), The 19th International Conference on Wireless Networks (ICWN'20), The 21st International Conference on Internet Computing & Internet of Things (ICOMP'20), and The 18th International Conference on Embedded Systems, Cyber-physical Systems (ESCS'20). The conferences took place in Las Vegas, NV, USA, July 27-30, 2020. The conferences are part of the larger 2020 World Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE'20) Part of the Transactions on Computational Science and Computational Intelligence book series (TRACOSCI) 17 páginas, 2 figuras, 2 tablas, The threat posed to “classical” cryptography by the developing field of quantum computers and quantum algorithms running on them have set on fire researchers on their quest for new quantum-resistant problems that could come to the rescue, thus giving rise to the new field of post-quantum cryptography. In this work we present the state of the art of current post-quantum proposals, closely following the NIST Call for Candidates, and suggest a knapsack-problem-based one, not considered so far, whose key lengths and security could benefit from the development of quantum technology., This work has been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and European Regional Development Fund (ERDF), through project COPCIS, grant no. TIN2017-84844-C2-1-R, and by Comunidad de Madrid (Spain) through project CYNAMON, grant no. P2018/TCS-4566-CM, co-funded with ERDF.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Securing Blockchain with Quantum Safe Cryptography: When and How?

  • Fernández Mármol, Verónica
  • Orúe, Amalia B.
  • Arroyo Guardeño, David
13th International Conference on Computational Intelligence in Security for Information Systems (CISIS 2020) 10 páginas,, Blockchain and quantum computing are trending topics in nowadays scientific communication, and they increasingly attract the attention of academia, but also industry stakeholders and policymakers. In this communication, we address the conundrum related to the quantum menace and the deployment of blockchain solutions. As any cryptographic product, blockchain security is affected by the advent of universal quantum computers. Besides the more or less certainty about its immediacy, we underline that blockchain is not substantially different from other secure and resilient platforms in such regard. On this ground, we discuss the main points of the roadmap that the research community in cryptography is currently taking to tackle the quantum challenge, and we highlight how these points should be properly integrated in the design and implementation of the life- cycle of blockchain products., This research has been partially supported by Ministerio de Economía, Industria y Competitividad (MINECO), Agencia Estatal de Investigación (AEI), and Fondo Europeo de Desarrollo Regional (FEDER, EU) under project COPCIS, reference TIN2017-84844-C2-1-R, by the Comunidad de Madrid (Spain) under the project CYNAMON (P2018/TCS-4566), cofinanced with FSE and FEDER EU funds, and by the CSIC Research Platform on Quantum Technologies under Grant PTI-001
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

BSD: Algoritmos eficientes para la descomposición binomial de secuencias binarias

  • Martín Navarro, José Luis
  • Fúster Sabater, Amparo
Actas de la XVI Reunión Española sobre Criptología y Seguridad de la Información, RECSI XVI, 2021. Lleida, 14-16 Abril 2021. 5 páginas, 4 tablas, La revolución del Internet de las cosas deja paso a un amplio rango de servicios críticos que se fundamentan en dispositivos IoT. Estos dispositivos de bajo coste suelen carecer de la seguridad suficiente, convirtiéndose en la puerta de entrada para ataques sobre la totalidad del servicio. Los protocolos de seguridad de IoT a menudo se basan en cifradores en flujo, donde los generadores de números aleatorios (PRNG) son una parte esencial de estos sistemas. En este trabajo se analiza una técnica de descomposición de secuencias binarias (descomposición binomial) que permite analizar sus características y propiedades. Basados en dicha descomposición, se presentan dos algoritmos que evaluan la fortaleza de dichas secuencias, contribuyendo así al dominio de seguridad IoT., Este trabajo ha sido parcialmente financiado por el Minis- terio de Economía, Industria y Competitividad (MINECO), la Agencia Estatal de Investigación (AEI) y el Fondo Europeo de Desarrollo Regional (FEDER, UE), a través del proyecto COPCIS, referencia TIN2017-84844-C2-1-R, y por la Comu- nidad de Madrid (España) a través del proyecto CYNAMON, referencia P2018/TCS-4566, también co-financiado con fon- dos FEDER de la Unión Europea. El primer autor ha sido financiado con una beca JAE-Introducción del Ministerio de Ciencia e Innovación.