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

推薦訂閱源

博客园 - 司徒正美
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
系数至槽位与槽位至系数转换加速,适用于稀疏打包密文,应用于CKKS自举
Xiaopeng Zhe · 2026-05-22 · via Cryptology ePrint Archive

论文 2026/1023

更速之系数至槽与槽至系数于稀疏打包之密文应用CKKS自举

摘要

CKKS之自举,乃复恢近似密文可用模数预算之要器,遂使同态运算逾乎定阶电路。其要者,乃线性变换之对——CoeffToSlot与SlotToCoeff,用以移数据于槽表示,俾行同态模数约减,复返系数表示。于Cheon等(EUROCRYPT 2018)之稀疏打包设,有用数据据居短效槽向量,复现于全槽空间。今法于此,主用较小效维,而我法则利用其重复模式,得简且廉之变换。 是篇用重复槽模式,以增CoeffToSlot与SlotToCoeff之效率。每变换恒保乘积深\(1\),而用同态算子较少。令\(N\)为环维,打包向量长\(n/2\),书\(r=N/n\)为重复因子。每变换,当\(n\le r/2\)时,其费为一明文密文乘法及\(O(\log n)\)回转。当\(nr/2\),其成本为\(2n/r\)明文密文乘法,及\(O(\sqrt{2n/r}+\log r)\)回转。吾亦析新式\textsf{CoeffToSlot}布局所生辅格,证其合乎所求系数格之亚高斯界。是故\textsf{EvalMod}近似界仅需并集界之常量对数余量。 吾于OpenFHE中实此变换,并作为CKKS自举流程之一部而评之。设\(N=2^{16}\),且所试稀疏维度\(n/2\le 1024\),吾之变换较OpenFHE之深度1稀疏线性变换于稀疏密钥设置中速\(3.53\times\)至\(7.95\times\)。此使全自举流程速增\(1.71\times\)至\(5.28\times\)。均质密钥设置中亦见相似增益。增益最巨者,当\(n/2\le 512\),吾法亦与深度3之OpenFHE基线竞,而减格四级。综观之,其示格重可减CKKS自举于稀疏打包设置中之实用成本。

BibTeX

@misc{cryptoeprint:2026/1023,
      author = {Xiaopeng Zheng},
      title = {Faster {CoeffToSlot} and {SlotToCoeff} for Sparsely Packed Ciphertexts with Application to {CKKS} Bootstrapping},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/1023},
      year = {2026},
      url = {https://eprint.iacr.org/2026/1023}
}