This collection combines attributed Wikipedia excerpts and original SciAtlas bilingual definitions under CC BY-SA 4.0. Excerpts were extracted and shortened; machine-assisted Chinese translations are labeled. Original entries provide further reading. Language versions may differ in emphasis and do not replace standards. Concepts can appear in several disciplines; consult standards and original literature for rigorous use.
contains 210 terms · This page displays 30 terms, you can enter keywords to query the complete range
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
Privacy amplification compresses partly exposed shared randomness into a shorter, nearly uniform secret key. Extractable length depends on adversarial knowledge and the desired security error bound.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
Domain separation adds explicit purpose identifiers to hash or derivation inputs to prevent confusion between protocol roles. Identifiers and their encodings must be unambiguous.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
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.
Sources, licensing and use
SciAtlas original bilingual definition · Edited2026-10-04 · CC BY-SA 4.0. Further-reading links provide context; the definition is original and does not assert that the linked page was retrieved or checked.For concept reference; consult the original standards for authoritative requirements.
Content license
How can this knowledge be incorporated into high-end products?
This collection combines attributed Wikipedia excerpts and original SciAtlas bilingual definitions under CC BY-SA 4.0. Excerpts were extracted and shortened; machine-assisted Chinese translations are labeled. Original entries provide further reading. Language versions may differ in emphasis and do not replace standards. Concepts can appear in several disciplines; consult standards and original literature for rigorous use.
Knowledge Snapshot: 2026-10-04. Category cross-inclusion is used for reading navigation, and the names of people, institutions and unexplained placeholders in the field are not included in the quantity.