Rank-2 module-LIP with special matrices

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

Information Processing Letters Pub Date : 2025-06-11 DOI:10.1016/j.ipl.2025.106593

Manoj Gyawali

引用次数: 0

Abstract

Lattice isomorphism problem (LIP) has been studied since 1990s. In 2023, a post-quantum signature scheme known as HAWK was submitted in the NIST standardization of additional signature scheme, which is based on the module lattice isomorphism problem (module-LIP). Module-LIP was formally defined by Mureau et al. at Eurocrypt'24 and Luo et al. reduced the problem of solving module-LIP over CM number fields to a problem of finding the special type of symplectic automorphism.

In this paper, we extend this idea further by establishing a reduction of the module-LIP to a problem of finding special types of matrices.

查看原文本刊更多论文

具有特殊矩阵的秩2模lip

晶格同构问题（LIP）自20世纪90年代开始研究。2023年，在NIST附加签名方案标准化中提交了一个基于模块格同构问题（module- lip）的后量子签名方案HAWK。Module-LIP是由mueau et al.在Eurocrypt'24上正式定义的，Luo等人将求解CM数域上的Module-LIP问题简化为寻找特殊类型的辛自同构问题。在本文中，我们进一步扩展了这一思想，将模- lip简化为寻找特殊类型矩阵的问题。

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

求助全文

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

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.