一种适合资源受限设备的Falcon实现  

A practical implementation of the signature scheme falcon suited for memory constrained device

作　　者：郭丽敏 刘丹 王立辉 李清 俞军[1,2] GUO Li-min;LIU Dan;WANG Li-hui;LI Qing;YU Jun(Shanghai Fudan Microelectronics Group Company Limited,Shanghai 200433,China;School of Microelectronics,Fudan University,Shanghai 200433,China)

机构地区：[1]上海复旦微电子集团股份有限公司,上海200433 [2]复旦大学微电子学院,上海200433

出　　处：《微电子学与计算机》2020年第9期50-55,61,共7页Microelectronics & Computer

摘　　要：Falcon是通过NIST第一轮筛选的唯一的基于NTRU格的签名方案.相较于其它的签名设计,Falcon的公钥长度和签名长度都较短,可有效降低通信的复杂度.它的劣势在于算法设计复杂,特别是其中的密钥生成算法和快速傅里叶采样算法难以理解且需要精细实现.本文分析了在内存资源受限的设备中实现Falcon签名方案的可行性,经过优化后,运行Falcon签名算法需要的动态内存降低到参考实现的37%.采用本文提出的实现方法,则签名需要334.7ms,签名验证需要6.16ms.Falcon is the only NTRU-based signature scheme submitted for the NIST standardization process of postquantum cryptography.Compared to other signature schemes,Falcon has achieve very small public keys and signatures.The signature generation and verification procedures are very fast.The limitations are that both the key generation procedure and the fast Fourier sampling are non-trivial to understand and delicate to implement.This work aims to present an optimized implementation of Falcon suited for memory constrained devices.We managed to reduce the dynamic memory consumption of Falcon by 37%in comparison to the reference implementation..Besides,our implementation requires only 334.7ms for signing and 6.16ms for verification.

关 键 词：FALCON签名算法 快速傅里叶采样 资源受限 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]