Message recovery attack in NTRU through VFK lattices

IF 0.5 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Acta Informatica Pub Date : 2026-01-08 DOI:10.1007/s00236-025-00512-z

Eirini D. Poimenidou, Marios Adamoudis, K. A. Draziotis, Kostas Tsichlas

引用次数: 0

Abstract

In the present paper, we introduce a message recovery attack applicable to NTRU cryptosystem. Our methodology uses a reduction from the NTRU-lattice to a Voronoi First Kind (VFK) lattice, enabling the use of a polynomial Closest Vector Problem (CVP) exact algorithm, which is vital for successful message recovery. This approach assumes knowledge of the Most Significant Bit of the coefficients of a polynomial that is a multiple of the nonce. Finally, extensive experimental results for the NTRU-HPS variants submitted to NIST are presented. The findings highlight the need to properly protect NTRU schemes against potential leakage.

查看原文本刊更多论文

通过VFK格的NTRU报文恢复攻击

本文介绍了一种适用于NTRU密码系统的消息恢复攻击方法。我们的方法使用从ntrui晶格到Voronoi第一类（VFK）晶格的简化，从而可以使用多项式最接近向量问题（CVP）精确算法，这对于成功的消息恢复至关重要。这种方法假定知道nonce的倍数多项式的系数的最高有效位。最后，介绍了提交给NIST的nru - hps变体的大量实验结果。研究结果强调了适当保护NTRU计划防止潜在泄漏的必要性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.