Skip to main content

CRIPTOGRAFIA PARA OPTIMIZAR LA PRIVACIDAD Y LA CIBERSEGURIDAD

TIN2017-84844-C2-1-R

•
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 I+D+i Retos de Investigación
Call year 2017
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): 7
Encontrada(s) 1 página(s)

RUA. Repositorio Institucional de la Universidad de Alicante
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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