The shortest vector problem asks for a shortest nonzero lattice vector, often in Euclidean norm. Cryptographic hardness depends on dimension and approximation factors, not on every small lattice instance.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
The closest vector problem seeks a lattice vector nearest to a target point. It is related to but distinct from the shortest vector problem, with complexity affected by the norm and approximation requirement.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Lattice reduction finds a basis of the same lattice with shorter, more nearly orthogonal vectors. It supports integer-relation problems and cryptanalysis but need not produce the shortest vector.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
LLL is a polynomial-time lattice basis reduction algorithm using size reduction and swaps. It provides approximation guarantees rather than serving as a general exact shortest-vector solver.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Ring-LWE places learning with errors in a polynomial quotient ring to improve efficiency. Ring structure, error distribution and parameter choices jointly determine the applicable security arguments.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Code-based cryptography builds public-key schemes from hard decoding problems. Code families, hidden structure and parameters require analysis; generic decoding hardness alone is not a complete guarantee.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Quantum key distribution uses quantum states and classical communication to establish keys and estimate eavesdropping effects. It still requires authenticated classical channels and secure endpoint implementations.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
BB84 encodes and measures quantum states in two incompatible bases, then sifts, corrects and privacy-amplifies data. Real devices must address losses and nonideal sources.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Collision resistance makes it hard to find two distinct inputs with the same digest. It differs from preimage resistance; generic birthday attacks on an ideal n-bit hash take about 2^(n/2) work.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A second-preimage attack starts from a specified input and seeks a different input with the same digest. This goal differs from a collision attack, where the attacker may choose both inputs.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A chosen-plaintext attack lets an adversary obtain encryptions of selected messages and attempt to learn protected messages or keys. Modern encryption definitions typically account for this capability.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A chosen-ciphertext attack gives an adversary restricted access to decryption responses. Secure schemes prevent that feedback from exposing a target ciphertext; authenticated encryption is a common component.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A known-plaintext attack uses plaintexts and matching ciphertexts to infer keys or other messages. Cipher design should assume that an adversary may know parts of legitimate communications.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A man-in-the-middle attacker intercepts, substitutes or relays messages between parties, potentially creating two separate sessions. Unauthenticated key exchange alone does not prevent the attack.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A meet-in-the-middle attack splits layered computations, stores intermediate results and searches for matches to reduce brute-force cost. It is distinct from a communication man-in-the-middle attack.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Some iterative hashes permit computing the digest of appended data from an existing digest and message length. Naive secret-prefix authentication can be vulnerable; use an analyzed MAC construction.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A downgrade attack induces parties to select older or weaker versions or algorithms. Defenses include authenticating negotiation, disabling unsafe choices and carefully controlling compatibility fallbacks.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A dictionary attack tries likely words, common passwords and transformations rather than all possible strings. It exploits human selection patterns and can be much cheaper than exhaustive search.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Rainbow tables trade storage for lookup time using precomputed hash chains to recover candidate passwords from unsalted digests. Independent random salts reduce reuse of this precomputation across accounts.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Semantic security requires that ciphertext not give an efficient adversary useful plaintext knowledge beyond permitted leakage. Precise definitions specify the attack model and randomization assumptions.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Provable security reduces breaking a scheme to solving an assumed hard problem. The proof depends on its model and assumptions and does not automatically cover implementation flaws or side channels.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A one-way function is easy to evaluate but hard to invert on typical outputs. Its existence is a foundational computational assumption, not a proven property of every proposed candidate.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A trapdoor function is hard to invert without secret auxiliary information but easy to invert with it. It is a building block for some public-key schemes, which still need suitable encoding and randomization.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A pseudorandom function family uses a secret key to select a deterministic function whose query behavior is difficult to distinguish from a random function under the specified oracle model.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A security parameter controls scheme size and attack cost, often through key length, modulus size or lattice dimension. Equal bit lengths in different algorithms do not imply equal security strength.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Min-entropy is the negative base-two logarithm of the largest outcome probability. It measures the difficulty of an optimal single guess, unlike Shannon entropy's average-information interpretation.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
A randomness extractor converts a weak random source with sufficient entropy into nearly uniform bits. Seed requirements, independence assumptions and entropy bounds depend on the construction.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Domain separation adds explicit purpose identifiers to hash or derivation inputs to prevent confusion between protocol roles. Identifiers and their encodings must be unambiguous.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。
Key confirmation verifies that another party obtained the same session key, often through an authentication tag. It differs from authenticating a long-term identity, and a protocol may require both.
来源、授权与使用说明
SciAtlas 原创双语释义 · 编辑日期 2026-10-04 · CC BY-SA 4.0。延伸阅读链接用于查阅相关概念,不表示引用该页面原文或已经验证该页面可访问。用于概念速查,不替代标准原文。