RDRicardo Dahab

Ricardo Dahab

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ricardo Dahab has a total of 93 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Minimal White-Box Dedicated Cipher Proposal Using Incompressible Lookup Tables: Space-Hard AES

    by Félix Carvalho Rodrigues, Ricardo Dahab, Julio López, Hayato Fujii, Ana Clara Zoppi Serpa

    In a white-box context, an attacker has full access to the execution environment and the implementation of cryptographic algorithms. Dedicated white-box ciphers, such as WEM and SPNbox, provide incompressibility and key extraction protections in this context, at the cost of increased memory usage and performance loss compared to standard ciphers. Even when a pure white-box threat model is not warranted, the use of incompressible lookup tables can be helpful in deterring side-channel attacks. In this paper we present a simple threat model for such scenarios and propose a dedicated cipher, Space-Hard AES, which provides minimal incompressibility guarantees while presenting better performance for ARMv8 implementations than other dedicated ciphers.


  • Detecting Cryptography Misuses With Machine Learning: Graph Embeddings, Transfer Learning and Data Augmentation in Source Code Related Tasks

    by Gustavo Eloi de Paula Rodrigues, Alexandre M. Braga, Ricardo Dahab

    Cryptography is a ubiquitous tool in secure software development in order to guarantee security requirements in general. However, software developers have scarce knowledge about cryptography and rely on limited support tools that cannot properly detect bad uses of cryptography, thus generating vulnerabilities in software. In this work, we extend the scarcely use of machine learning to detect cryptography misuse in source code by using a state of the art deep learning model (i.e., code2vec ) through transfer learning to generate features that feed machine learning models. In addition, we compare this approach to previous ones in different types of binary models. Also, we adapt code obfuscation to serve as data augmentation in machine learning source code related tasks. Finally, we show that through transfer learning code2vec can be a competitive feature generator for cryptography misuse detection and simple code obfuscation can be used to generate data to enhance machine learning models training in source code related tasks.


  • Evaluation of modular multiplication techniques for Supersingular Isogeny Schemes on ARMv8 cores

    by Vitor Satoru Machi Matsumine, Félix Carvalho Rodrigues, Décio Gazzoni Filho, Caio Teixeira, Julio López, Ricardo Dahab

    This paper focuses on the evaluation of different modular multiplication implementation techniques on 64-bit ARMv8 systems for the third-round NIST alternate candidate SIKE. The benchmarks were performed on four devices: an Orange Pi WinPlus featuring the Cortex-A53 processor, an NVIDIA Jetson Nano with a Cortex-A57, a Raspberry Pi 4 with a Cortex-A72 and a Macbook Air based on an Apple M1 chip. Throughout these platforms we observed that the two-level Karatsuba Comba method performs better on most Cortex-A processors but the Operand Scanning method presented a performance improvement ranging from 10% to 43% for the multiplication procedure and a 7% to 25% improvement for the modular reduction on the Apple M1 for all SIKE security levels, resulting in an overall improvement ranging from 8% to 28% for the SIKE KEM operations on this architecture.

  • Evaluation of CRYSTALS-Kyber and Saber on the ARMv8 architecture

    by Jheyne N. Ortiz, Félix Carvalho Rodrigues, Décio Gazzoni Filho, Caio Teixeira, Julio López, Ricardo Dahab

    This paper presents preliminary experimental results for the implementation of the third-round NIST finalists CRYSTALS-Kyber and Saber on the ARMv8 architecture. Our implementation uses NEON instructions to speed up key generation, encapsulation, and decapsulation of the reference codes. The benchmarks are performed on three devices: an Orange Pi WinPlus (Cortex-A53), a Raspberry Pi 4 (Cortex-A72), and a MacBook Air based on an Apple M1 chip. The experimental results show substantial improvements for Kyber and Saber, with speed-ups in the ranges 1.16-1.38x and 1.21-1.96x, respectively. We focused on the most time-consuming operations of each cryptosystem; however, similar works suggest that more expressive speed-ups can be obtained by extending the use of NEON instructions to other primary sub-routines.


  • Open Access

    The Ring-LWE Problem in Lattice-Based Cryptography: The Case of Twisted Embeddings

    by Jheyne N. Ortiz, Robson R. de Araujo, Diego F. Aranha, Sueli I. R. Costa, Ricardo Dahab

    Several works have characterized weak instances of the Ring-LWE problem by exploring vulnerabilities arising from the use of algebraic structures. Although these weak instances are not addressed by worst-case hardness theorems, enabling other ring instantiations enlarges the scope of possible applications and favors the diversification of security assumptions. In this work, we extend the Ring-LWE problem in lattice-based cryptography to include algebraic lattices, realized through twisted embeddings. We define the class of problems Twisted Ring-LWE, which replaces the canonical embedding by an extended form. By doing so, we allow the Ring-LWE problem to be used over maximal real subfields of cyclotomic number fields. We prove that Twisted Ring-LWE is secure by providing a security reduction from Ring-LWE to Twisted Ring-LWE in both search and decision forms. It is also shown that the twist factor does not affect the asymptotic approximation factors in the worst-case to average-case reductions. Thus, Twisted Ring-LWE maintains the consolidated hardness guarantee of Ring-LWE and increases the existing scope of algebraic lattices that can be considered for cryptographic applications. Additionally, we expand on the results of Ducas and Durmus (Public-Key Cryptography, 2012) on spherical Gaussian distributions to the proposed class of lattices under certain restrictions. As a result, sampling from a spherical Gaussian distribution can be done directly in the respective number field while maintaining its format and standard deviation when seen in Zn via twisted embeddings.


  • Open Access

    Isogeny formulas for Jacobi intersection and twisted hessian curves

    by João Paulo da Silva, Julio López, Ricardo Dahab

    The security of public-key systems is based on the difficulty of solving certain mathematical problems. With the possible emergence of large-scale quantum computers several of these problems, such as factoring and computing discrete logarithms, would be efficiently solved. Research on quantum-resistant public-key cryptography, also called post-quantum cryptography (PQC), has been productive in recent years. Public-key cryptosystems based on the problem of computing isogenies between supersingular elliptic curves appear to be good candidates for the next generation of public-key cryptography standards in the PQC scenario. In this work, motivated by a previous work by D. Moody and D. Shumow [17], we derived maps for elliptic curves represented in Jacobi Intersection and Twisted Hessian models. Our derivation follows a multiplicative strategy that contrasts with the additive idea presented in the Vélu formula. Finally, we present a comparison of computational cost to generate maps for isogenies of degree $ l $, where $ l = 2k + 1 $. In affine coordinates, our formulas require $ 46.8 \% $ less computation than the Huff model and $ 48\% $ less computation than the formulas given for the Extended Jacobi Quartic model when computing isogenies of degree $ 3 $. Considering higher degree isogenies as $ 101 $, our formulas require $ 23.4\% $ less computation than the Huff model and $ 24.7 \% $ less computation than the formula for the Extended Jacobi Quartic model.


  • Open Access

    Characterizing lattices for cryptography

    by Universidade Estadual de Campinas, Tomas Rodrigues e Silva, Ricardo Dahab

  • Open Access

    Choosing parameters for trellis-based encryption systems

    by Universidade Estadual de Campinas, Caio Teixeira, Ricardo Dahab

  • Open Access

    High-performance Implementation of Elliptic Curve Cryptography Using Vector Instructions

    by Armando Faz-Hernández, Julio López, Ricardo Dahab

    Elliptic curve cryptosystems are considered an efficient alternative to conventional systems such as DSA and RSA. Recently, Montgomery and Edwards elliptic curves have been used to implement cryptosystems. In particular, the elliptic curves Curve25519 and Curve448 were used for instantiating Diffie-Hellman protocols named X25519 and X448. Mapping these curves to twisted Edwards curves allowed deriving two new signature instances, called Ed25519 and Ed448, of the Edwards Digital Signature Algorithm. In this work, we focus on the secure and efficient software implementation of these algorithms using SIMD parallel processing. We present software techniques that target the Intel AVX2 vector instruction set for accelerating prime field arithmetic and elliptic curve operations. Our contributions result in a high-performance software library for AVX2-ready processors. For example, our library computes digital signatures 19% (for Ed25519) and 29% (for Ed448) faster than previous optimized implementations. Also, our library improves by 10% and 20% the execution time of X25519 and X448, respectively.