VIP 👤
🏠 首页
基准测试
📊 所有基准测试 🦖 恐龙 v1 🦖 恐龙 v2 ✅ 待办事项应用 🎨 创意自由页面 🎯 FSACB - 终极展示 🌍 翻译基准测试
模型
🏆 前 10 名模型 🆓 免费模型 📋 所有模型 ⚙️ 🛠️ 千行代码模式
资源
💬 💬 提示库 📖 📖 AI 词汇表 🔗 🔗 有用链接 🔌 AI API 与路由器
advanced

Lattice-Based Cryptography Attack

#post-quantum #lattice-cryptography #learning-with-errors #cryptanalysis #security-proofs

Analyze the security reduction of a lattice-based key exchange protocol.

Analyze the security of a proposed Key Encapsulation Mechanism (KEM) based on the Learning with Errors (LWE) problem over a polynomial ring (RLWE). The scheme claims IND-CCA2 security. Your task is to: 1) Identify the specific hardness problem the security reduction relies on. 2) Critique the tightness of the security reduction—specifically, estimate the loss in the security parameter during the reduction from the scheme to the hardness problem. 3) Propose a potential side-channel attack vector related to the decoding process (e.g., failure probability analysis) and suggest a concrete countermeasure to mitigate it.