Lattice-based RLWE key generation using ECC
Abstract
The rapid advancement of quantum computing poses a significant threat to modern cryptographic systems, with algorithms such as Shor's, which can break RSA and ECC, and Grover's, which can weaken symmetric-key systems. In response, post-quantum cryptography aims to develop secure protocols resilient to quantum attacks. This paper introduces a lattice-based key generation mechanism that combines the Ring Learning With Errors (RLWE) problem with ECC. Using the secp256r1 curve, ECC keys are transformed into polynomials suitable for RLWE-based cryptographic schemes via KECCAK hash functions. The performance of this hybrid approach is assessed through key generation time and CPU cycle analysis, demonstrating its efficiency and potential for post-quantum cryptography.
Document Type
Conference Proceeding
Date of Publication
1-1-2024
School
School of Science
Copyright
subscription content
Publisher
IEEE
Identifier
Mohammad Al-Fawa'reh: https://orcid.org/0000-0002-5621-4126
Recommended Citation
Homsi, A., Al-Fayoumi, M., & Al-Fawa'reh, M. (2024). Lattice-based RLWE key generation using ECC. DOI: https://doi.org/10.1109/IJCC64742.2024.10847283
Comments
Homsi, A., Al-Fayoumi, M., & Al-Fawa'reh, M. (2024, December). Lattice-based RLWE key generation using ECC. In 2024 International Jordanian Cybersecurity Conference (IJCC) (pp. 82-86). IEEE. https://doi.org/10.1109/IJCC64742.2024.10847283