Security Analysis of Integer Learning with Errors with Rejection Sampling
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908699876917248 |
|---|---|
| author | Yates, Kyle Pierrottet, Antsa Mamun, Abdullah Al Cartor, Ryann Chowdhury, Mashrur Gao, Shuhong |
| author_facet | Yates, Kyle Pierrottet, Antsa Mamun, Abdullah Al Cartor, Ryann Chowdhury, Mashrur Gao, Shuhong |
| contents | At ASIACRYPT 2018, a digital attack based on linear least squares was introduced for a variant of the learning with errors (LWE) problem which omits modular reduction known as the integer learning with errors problem (ILWE). In this paper, we present a theoretical and experimental study of the effectiveness of the attack when applied directly to small parameter ILWE instances found in popular digital signature schemes such as CRYSTALS-Dilithium which utilize rejection sampling. Unlike other studies which form ILWE instances based on additional information obtained from side-channel attacks, we take a more direct approach to the problem by constructing our ILWE instance from only the obtained signatures. We outline and introduce novel techniques in our simulation designs such as modular polynomial arithmetic via matrices in $\mathbb{R}$, as well as algorithms for handling large sample sizes efficiently. Our experimental results reinforce the proclaimed security of signature schemes based on ILWE. We additionally discuss the implications of our work and digital signatures as a whole in regards to real-world applications such as in Intelligent Transportation Systems (ITS). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_08172 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Security Analysis of Integer Learning with Errors with Rejection Sampling Yates, Kyle Pierrottet, Antsa Mamun, Abdullah Al Cartor, Ryann Chowdhury, Mashrur Gao, Shuhong Cryptography and Security Information Theory 94A60 At ASIACRYPT 2018, a digital attack based on linear least squares was introduced for a variant of the learning with errors (LWE) problem which omits modular reduction known as the integer learning with errors problem (ILWE). In this paper, we present a theoretical and experimental study of the effectiveness of the attack when applied directly to small parameter ILWE instances found in popular digital signature schemes such as CRYSTALS-Dilithium which utilize rejection sampling. Unlike other studies which form ILWE instances based on additional information obtained from side-channel attacks, we take a more direct approach to the problem by constructing our ILWE instance from only the obtained signatures. We outline and introduce novel techniques in our simulation designs such as modular polynomial arithmetic via matrices in $\mathbb{R}$, as well as algorithms for handling large sample sizes efficiently. Our experimental results reinforce the proclaimed security of signature schemes based on ILWE. We additionally discuss the implications of our work and digital signatures as a whole in regards to real-world applications such as in Intelligent Transportation Systems (ITS). |
| title | Security Analysis of Integer Learning with Errors with Rejection Sampling |
| topic | Cryptography and Security Information Theory 94A60 |
| url | https://arxiv.org/abs/2512.08172 |