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 Vigenère cipher uses a repeating keyword to choose letter shifts, producing polyalphabetic substitution. Its periodic structure leaks statistical patterns and is insecure for modern use.
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.
An affine cipher maps alphabet indices to ax+b modulo the alphabet size. The multiplier must be coprime to that size for reversibility, but the linear structure is not cryptographically secure.
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.
Atbash 将字母表的顺序反转,例如 A 对应 Z、B 对应 Y。它没有有效的秘密密钥,仅能作为字符映射和历史密码示例。
Atbash reverses an alphabet, pairing A with Z and B with Y in the Latin alphabet. It has no effective secret key and serves only as a historical substitution example.
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 rail fence cipher writes characters along a zigzag across rails and reads them rail by rail. It permutes positions rather than values and cannot resist modern cryptanalysis.
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.
Frequency analysis compares ciphertext symbol frequencies with known language statistics. It is useful against historical substitution ciphers, while modern secure ciphers avoid such direct correlations.
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 index of coincidence estimates the probability that two sampled symbols match. It can help analyze historical polyalphabetic ciphers, but estimates from short samples vary substantially.
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.
Kasiski examination studies distances between repeated ciphertext fragments to suggest periods of repeating keys. Common distance factors provide clues, not a complete determination of the key.
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 Feistel network splits a block into halves and combines round functions with swaps to obtain an invertible transform. Round functions need not be invertible; security depends on the design.
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 substitution–permutation network alternates nonlinear substitution and linear mixing to spread input influence across a block. Its security still depends on round counts and cryptanalytic resistance.
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 avalanche effect describes widespread output changes after a small input change. Observing about half the bits change in a single example is not sufficient evidence of cryptographic security.
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.
Confusion complicates relationships between keys and ciphertext, while diffusion spreads plaintext statistics over many output positions. These are design principles rather than complete security proofs.
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 block cipher mode specifies how a fixed-block cipher processes longer messages. Modes differ in nonce, padding, parallelism and authentication requirements and are not interchangeable.
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.
ECB encrypts blocks independently, so identical plaintext blocks produce identical ciphertext blocks under one key. This reveals repeated structure and makes it unsuitable for most messages.
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.
CBC XORs each plaintext block with the preceding ciphertext block, starting with an initialization vector. It does not authenticate messages, and unsafe padding errors can create oracle attacks.
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.
Counter mode encrypts a sequence of counters to form a keystream that is XORed with plaintext. Counter sequences must never repeat under one key, and the mode alone provides no integrity.
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.
GCM combines counter-mode encryption with finite-field authentication for ciphertext and optional associated data. Repeating a nonce under the same key can destroy confidentiality and integrity.
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.
Associated data is authenticated but not encrypted by an authenticated-encryption scheme, such as a protocol header. The receiver must supply the same data when verifying the authentication tag.
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.
An authentication tag is a short value computed from a secret key and protected data to detect unauthorized changes. Tag length, failure handling and key management all affect security.
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 cryptographic nonce is a value used once within a specified key or protocol scope. An algorithm may require uniqueness, randomness or unpredictability, and these requirements are not equivalent.
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 salt is public data combined with a password-derivation input to reduce shared outputs and the value of precomputation attacks. It need not be secret and cannot compensate for weak passwords alone.
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 cryptographic key selects a transformation and may be a symmetric secret, public key or private key. Generation, storage, purpose separation and revocation are integral to system security.
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 cryptographic hash maps arbitrary-length input to a fixed-length digest while seeking preimage, second-preimage and collision resistance. Ordinary hash-table functions need not provide these properties.
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.
HMAC combines a secret key with inner and outer applications of a hash function to produce a message authentication code. It authenticates data but does not encrypt the message.
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 MAC is computed from a shared secret and a message so key holders can detect alteration. Since both parties can generate valid codes, it does not provide public-signature nonrepudiation.
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.
SHA-3 is a family of standardized hashes based on the Keccak sponge construction. Its internal structure differs from SHA-2 and supports several digest sizes and related extensible-output functions.
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.
SHA-1 produces a 160-bit digest and has practical collision attacks. New systems relying on collision resistance, including signatures and certificates, should not select it as a secure hash.
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.
MD5 produces a 128-bit digest and has broken collision resistance. It may appear in legacy checksums but must not be treated as a secure basis for adversarial integrity or signatures.
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.
An extendable-output function absorbs a message and emits a requested number of output bytes. Increasing the output length does not increase security without bound; the construction limits its 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.
PBKDF2 derives key material from a password, salt, iteration count and pseudorandom function. Iterations raise guessing cost, and parameters must reflect current hardware and application requirements.
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.
Scrypt is a memory-hard password derivation algorithm whose parameters determine time and memory demand. Low settings weaken guessing resistance, while excessive settings can exhaust service resources.
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.