Ring-LWE: Applications to Cryptography and Their Efficient Realization

Roy, Sujoy Sinha; Karmakar, Angshuman; Verbauwhede, Ingrid

doi:10.1007/978-3-319-49445-6_18

“…The cryptographic community is searching for new quantumresistant primitives because the main asymmetric cryptosystems such as RSA 1 , (EC)DLP 2 are insecure against a quantum computer. Hence, the National Institute of Standards and Technology (NIST) initiated a process to search new public key cryptographic algorithms which are post-quantum secure [Roy et al, 2016]. Some proposals submitted to NIST process are based on the Ring-Learning-with-Errors (Ring-LWE) problem because its implementation in software and hardware is efficient.…”

Section: Introductionmentioning

confidence: 99%

Recovery of the secret on Binary Ring-LWE problem using random known bits - Extended Version

Villena,

Terada

2024

JISA

0

View full text Add to dashboard Cite

There are cryptographic systems that are secure against attacks by both quantum and classical computers. Some of these systems are based on the Binary Ring-LWE problem which is presumed to be difficult to solve even on a quantum computer. This problem is considered secure for IoT (Internet of things) devices with limited resources. In Binary Ring-LWE, a polynomial a is selected randomly and a polynomial b is calculated as b = a.s + e where the secret s and the noise e are polynomials with binary coefficients. The polynomials b and a are public and the secret s is hard to find. However, there are Side Channel Attacks that can be applied to retrieve some coefficients (random known bits) of s and e. In this work, we analyze that the secret s can be retrieved successfully having at least 50% of random known bits of s and e.

show abstract

“…The cryptographic community is searching for new quantum-resistant primitives because the main asymmetric cryptosystems such as RSA 1 , (EC)DLP 2 are insecure against a quantum computer. Hence, the National Institute of Standards and Technology (NIST) initiated a process to search new public key cryptographic algorithms which are postquantum secure [Roy et al 2016]. Some proposals submitted to NIST process are based on Ring-Learning-with-Errors (Ring-LWE) problem because its implementation in software and hardware is efficient.…”

Section: Introductionmentioning

confidence: 99%

Recovering the Secret on Binary Ring-LWE problem with Random Known bits

Villena,

Terada

2023

Anais Do XXIII Simpósio Brasileiro De Segurança Da Informação E De Sistemas Computacionais (SBSeg 2023)

1

0

View full text Add to dashboard Cite

There are cryptographic systems that are secure against attacks by both quantum and classical computers. Some of these systems are based on the Binary Ring-LWE problem which is presumed to be difficult to solve even on a quantum computer. This problem is considered secure for IoT (Internet of things) devices with limited resources. In Binary Ring-LWE, a polynomial a is selected randomly and a polynomial b is calculated as b = a.s + e where the secret s and the noise e are polynomials with binary coefficients. The polynomials b and a are public and the secret s is hard to find. However, there are Side Channel Attacks that can be applied to retrieve some coefficients (random known bits) of s and e. In this work, we analyze that the secret s can be retrieved successfully having at least 50 % of random known bits of s and e.

show abstract