慣性聚合 高效追讀感興趣之博客、新聞、科技資訊
閱原文 以慣性聚合開啟

推薦訂閱源

博客园 - 司徒正美
V
V2EX
T
Tailwind CSS Blog
有赞技术团队
有赞技术团队
aimingoo的专栏
aimingoo的专栏
Apple Machine Learning Research
Apple Machine Learning Research
IT之家
IT之家
Blog — PlanetScale
Blog — PlanetScale
A
About on SuperTechFans
月光博客
月光博客
T
The Blog of Author Tim Ferriss
宝玉的分享
宝玉的分享
Martin Fowler
Martin Fowler
博客园 - 聂微东
The GitHub Blog
The GitHub Blog
V
Visual Studio Blog
WordPress大学
WordPress大学
酷 壳 – CoolShell
酷 壳 – CoolShell
Engineering at Meta
Engineering at Meta
GbyAI
GbyAI

Cryptology ePrint Archive

Dynamic Group Time-based One-time Passwords MBU: Scalable and Constant-Round Evaluation of Non-linear Functions in Standard MPC Setting CEDAR: A Compact and Efficient Decoder Architecture for RS-RM Code in HQC LEAH: Lightweight and Efficient Hardware Accelerator for Code-based PQC Scheme HQC The Sum-Check Protocol over the Monomial Basis, and Other Optimizations How to Authenticate a Non-Deterministic Computation Fully Adaptive Threshold Blind Signature Without AGM Additive FFTs for HQC on ARM Cortex-M4, Revisited SPoCK: Sequential Proofs of Complete Knowledge Blind Verifiable Delay Functions Compact Fully Asynchronous Updatable Public Key Encryption Scheme from Hamming Quasi-Cyclic Cryptosystem CLAASP-MP: An Automated MILP Framework for Monomial Prediction Assessing Geometric Security of AES Neural Realizations: Linear-Time Key Recovery via Neural Leakage Explicit Bounds on the Existence Probability of Random Multivariate Quadratic Systems over Finite Fields Faster Logical Operations from Discrete CKKS SecDTD: Dynamic Token Drop for Secure Transformers Inference Towards Zero Rotation and Beyond: Architecting Neural Networks for Fast Secure Inference with Homomorphic Encryption Code-based Scalable Collaborative SNARKs MAGNET: MAsked Gaussian Now Efficient and Table-less Automated formal analysis of Signal’s Double Ratchet: attacks, fixes and security proofs Bitsliced Segment-Based Search Technique for Low-Depth and Hardware-Efficient S-Box Circuits The Cost of Fluidity: Communication Complexity Trade-offs in Fluid MPC Decomposition of Large Look-Up Tables for Fast Homomorphic Evaluation Hint-Free Multi-Signatures (Mis)using the Lattice Isomorphism Problem. Cryptanalysis of the double-LIP and Construction of LIP-Based Blind Signatures Improving LatticeFold+ with ℓ2-norm Checks ABRA-CAPA-DABRA: Full break of CAPA Polynomial-Time Cryptanalytic Extraction of Graph Neural Networks in the Hard-Label Setting Zero-Knowledge Proof of Progress: Secure Multi-Phase Capture-the-Flag Competitions Scalable Registration-Based Encryption from Lattices ISE-supported erasure of residual shares Chorus: Secret Recovery with Ephemeral Client Committees $\mathsf{Veloz}$: Efficient and Flexible Distribution Framework for Code-Based Polynomial Commitment Scheme How to construct even faster and indifferentiable hash functions from random permutations Public Key Encryption from High-Corruption Constraint Satisfaction Problems Drop-In Masked Modular Reduction for ML-DSA: Cutting Side-Channel Cost in the Root-of-Trust Optimizing and Implementing Threshold MAYO Improved Cryptanalysis of the Permuted Kernel Problem with Applications to PERK v2.2.0, SUSHSYFISH and PKP-DSS Cross-Paradigm Models of Restricted Syndrome Decoding with Application to CROSS Fast Isogeny Evaluation on Binary Curves Quick Draw Queries: Lightweight Searchable Public-key Ciphertexts with Hidden Structures via Non-Interactive Key Exchange A Constructive Treatment of Authentication Boolean Arithmetic over $\mathbb{F}_2$ from Group Commutators HAWK with Hint: Algebraic Key Recovery from Side-Channel Leakage Post-Quantum Secure k-Times Traceable Ring Signature A Key Schedule Design and Evaluation under Boundary Round-Key Leakage 2G2T: Constant-Size, Statistically Sound MSM Outsourcing Proximity Signatures Breaking Optimized HQC: The First Cache-Timing Full Decryption Oracle Key-Recovery Attack in Post-Quantum Cryptography Efficient Partially Blind Signatures from Isogenies
多项式卷积之棘:相关、大偏差及其应用
Dongshu Cai · 2026-05-21 · via Cryptology ePrint Archive

文 2026/1022

多项式卷积之棘:关联、大偏差及其应用

,中国科学院信息工程研究所网络空间安全防御重点实验室,北京,中国,中国科学院大学网络安全学院,北京,中国

刘一坚,中国科学学院信息工程研究所网络空间安全防御重点实验室,北京,中国,中国科学学院大学网络安全学院,北京,中国

,王佳宝,中国科学学院信息工程研究所网络空间安全防御重点实验室,北京,中国中国科学院大学网络安全学院,北京,中国

仙惠路中国科学院信息工程研究所网络空间安全防御重点实验室,北京,中国中国科学院大学网络安全学院,北京,中国

摘要

估结构化格基密码之解密失败率(DFR),或有术者默许解密噪声之系数互不相关。然实践之中,解密噪声常含小多项式卷积之项,遂使系数间生关联。此关联遂致独立估量与实证失败率间存显著罅隙,致DFR低估、安全级高估,并生可乘之机。亦使纠错机制于结构化格基加密设计之效用隐晦不明。迄今,尚无实用之框架以刻画此等关联。 是篇中,吾辈首度系统刻画高斯系数卷积多项式系数间之关联,以典范嵌入为枢轴。立得所得多项式系数之大偏差之理。吾等之析示示,随范数增,卷积多项式渐近集中于有限数固定二维平面。此生n维联合概率密度之定向尾结构,吾辈谓之棘刺。 直接之应用,吾辈证得既有解密失败攻击,恰赖迫噪声落于此等棘刺。此现象赋噪声以极强关联,终致解密失败。复次,采典范嵌入之视角,吾辈得以全面阐明独立假说如何扭曲真实噪声分布。吾辈证得独立假说系统低估噪声范数,并导得解密噪声欧几里得范数概率密度函数之解析式。

BibTeX

@misc{cryptoeprint:2026/1022,
      author = {Dongshu Cai and Yijian Liu and Jiabo Wang and Xianhui Lu},
      title = {Thorns in Polynomial Convolution: Correlation, Large Deviations, and Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1022},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1022}
}