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
有条件披露秘密 (CDS) 是一种在信息论密码学中研究的原语,它允许分布式、非通信各方协调向第三方发布信息。 CDS 最初是为了在私人信息检索的背景下使用而引入的,并且与通信复杂性和非局部量子计算有关。它还与私有同时消息传递设置有关。有条件泄密设置涉及三名玩家;爱丽丝、鲍勃和裁判。 Alice 接收到一个输入 x ε { 0 , 1 } n {\displaystyle x\in \{0,1\}^{n}} 和一个秘密 z ε { 0 , 1 } {\displaystyle z\in \{0,1\}} ,Bob 接收到一个字符串 y ε { 0 , 1 } n {\displaystyle y\in \{0,1\}^{n}} 。
Conditional disclosure of secrets (CDS) is a primitive, studied in information-theoretic cryptography, that allows distributed, non-communicating parties to coordinate the release of information to a third party. CDS was initially introduced for use in the context of private information retrieval, and has been related to communication complexity and non-local quantum computation. It is also related to the private simultaneous message passing setting. The conditional disclosure of secrets setting involves three players; Alice, Bob and the referee. Alice receives an input x ∈ { 0 , 1 } n {\displaystyle x\in \{0,1\}^{n}} and a secret z ∈ { 0 , 1 } {\displaystyle z\in \{0,1\}} , and Bob receives a string y ∈ { 0 , 1 } n {\displaystyle y\in \{0,1\}^{n}} .
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements. The Chinese definition is a machine-assisted translation of the cited English introduction; check technical terminology against the original.
Conjugate coding is a cryptographic tool, introduced by Stephen Wiesner in the late 1960s. It is part of the two applications Wiesner described for quantum coding, along with a method for creating fraud-proof banking notes. The application that the concept was based on was a method of transmitting multiple messages in such a way that reading one destroys the others. This is called quantum multiplexing and it uses photons polarized in conjugate bases as "qubits" to pass information. Conjugate coding also is a simple extension of a random number generator. At the behest of Charles Bennett, Wiesner published the manuscript explaining the basic idea of conjugate coding with a number of examples but it was not embraced because it was significantly ahead of its time.
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements. The Chinese definition is a machine-assisted translation of the cited English introduction; check technical terminology against the original.
Convergent encryption, also known as content hash keying, is a cryptosystem that produces identical ciphertext from identical plaintext files. This has applications in cloud computing to remove duplicate files from storage without the provider having access to the encryption keys. The combination of deduplication and convergent encryption was described in a backup system patent filed by Stac Electronics in 1995. This combination has been used by Farsite, Permabit, Freenet, MojoNation, GNUnet, flud, and the Tahoe Least-Authority File Store. The system gained additional visibility in 2011 when cloud storage provider Bitcasa announced they were using convergent encryption to enable de-duplication of data in their cloud storage service.
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements. The Chinese definition is a machine-assisted translation of the cited English introduction; check technical terminology against the original.
在数学中,布尔函数的相关免疫度是对其输出与其输入的某些子集不相关程度的度量。具体来说,如果 x 1 , x 2 , … , x n {\displaystyle x_{1},x_{2},\ldots ,x_{n}} 中 m 个或更少变量的每个子集在统计上独立于 f ( x 1 , x 2 , … , x n ) {\displaystyle f(x_{1},x_{2},\ldots,x_{n})} 。
In mathematics, the correlation immunity of a Boolean function is a measure of the degree to which its outputs are uncorrelated with some subset of its inputs. Specifically, a Boolean function is said to be correlation-immune of order m if every subset of m or fewer variables in x 1 , x 2 , … , x n {\displaystyle x_{1},x_{2},\ldots ,x_{n}} is statistically independent of the value of f ( x 1 , x 2 , … , x n ) {\displaystyle f(x_{1},x_{2},\ldots ,x_{n})} .
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements. The Chinese definition is a machine-assisted translation of the cited English introduction; check technical terminology against the original.
In telecommunications and tradecraft, cover is the technique of concealing or altering the characteristics of communications patterns for the purpose of denying an unauthorized receiver information that would be of value. The purpose of cover is not to make the communication secure, but to make it look like noise, rendering it uninteresting and not worth analysis. Even if an attacker recognizes the communication as interesting, cover makes traffic analysis more difficult since he must crack the cover before he can find out to whom it is addressed. Usually, the covered communication is also encrypted. In this way, enemies have no idea you sent a message; friends know you sent a message, but don't know what you said; the intended recipient knows what you said.
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements. The Chinese definition is a machine-assisted translation of the cited English introduction; check technical terminology against the original.
覆盖编码是一种隐藏通过不安全链路传输的数据的技术,以降低窥探的风险。覆盖编码的一个示例是发送方使用发送方和接收方都知道的密码或随机数对原始数据执行按位 XOR(异或)。然后,生成的覆盖编码数据从发送方传输到接收方,接收方使用相同的密码或随机数对接收到的数据执行进一步的按位 XOR(异或)运算,从而揭开原始数据。 ISO 18000-6C(EPC 1 类第 2 代)RFID 标签通过覆盖码保护某些操作。阅读器向标签请求随机数,标签以新的随机数响应。然后,读取器使用按位异或对其发送的数据加密与该数字的未来通信。
Cover-coding is a technique for obscuring the data that is transmitted over an insecure link, to reduce the risks of snooping. An example of cover-coding would be for the sender to perform a bitwise XOR (exclusive OR) of the original data with a password or random number which is known to both sender and receiver. The resulting cover-coded data is then transmitted from sender to the receiver, who uncovers the original data by performing a further bitwise XOR (exclusive OR) operation on the received data using the same password or random number. ISO 18000-6C (EPC Class 1 Generation 2) RFID tags protect some operations with a cover code. The reader requests a random number from the tag, and the tag responds with a new random number. The reader then encrypts future communications with this number, using bitwise XOR, to the data it sends.
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements. The Chinese definition is a machine-assisted translation of the cited English introduction; check technical terminology against the original.
Probabilistic Signature Scheme (PSS) is a cryptographic signature scheme designed by Mihir Bellare and Phillip Rogaway. RSA-PSS is an adaptation of their work and is standardized as part of PKCS#1 v2.1. In general, RSA-PSS should be used as a replacement for RSA-PKCS#1 v1.5.
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements. The Chinese definition is a machine-assisted translation of the cited English introduction; check technical terminology against the original.
同态加密是一种加密形式,允许对加密数据执行计算,而无需先解密它。计算结果以加密形式保留,解密后产生的输出与对未加密数据执行的操作的输出相同。同态加密可用于保护隐私的外包存储和计算。这允许数据被加密并外包到商业云环境进行处理,同时加密。作为同态加密实际应用的一个例子:可以扫描照片中的感兴趣区域 (ROI),然后将其加密值与预先计算的(旅游)感兴趣点的 ROI 进行比较,而不会泄露照片的内容。
Homomorphic encryption is a form of encryption that allows computations to be performed on encrypted data without first having to decrypt it. The result of the computations are left in an encrypted form which, when decrypted, result in an output that is identical to that of the operations performed on the unencrypted data. Homomorphic encryption can be used for privacy-preserving outsourced storage and computation. This allows data to be encrypted and outsourced to commercial cloud environments for processing, all while encrypted. As an example of a practical application of homomorphic encryption: photographs can be scanned for regions of interest (ROI), the encrypted values of which are then compared to precomputed ROI of points of (touristical) interest, without revealing the contents of a photo.
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements. The Chinese definition is a machine-assisted translation of the cited English introduction; check technical terminology against the original.
Non-interactive zero-knowledge proofs are cryptographic primitives, where information between a prover and a verifier can be authenticated by the prover, without revealing any of the specific information beyond the validity of the statement itself. This makes direct communication between the prover and verifier unnecessary, effectively removing any intermediaries. The key advantage of non-interactive zero-knowledge proofs is that they can be used in situations where there is no possibility of interaction between the prover and verifier, such as in online transactions where the two parties are not able to communicate in real time. This makes non-interactive zero-knowledge proofs particularly useful in decentralized systems like blockchains, where transactions are verified by a network of nodes and there is no central authority to oversee the verification process.
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements. The Chinese definition is a machine-assisted translation of the cited English introduction; check technical terminology against the original.
Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (non-quantum) algorithms. However, beating classical computers may require quantum computers with millions of qubits due to the overhead caused by quantum error correction. Shor proposed multiple similar algorithms for solving the factoring problem, the discrete logarithm problem, and the period-finding problem. "Shor's algorithm" usually refers to the factoring algorithm, but may refer to any of the three algorithms.
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements. The Chinese definition is a machine-assisted translation of the cited English introduction; check technical terminology against the original.
在概率论和信息论中,两个随机变量的互信息(mutual Information,MI)度量了两个变量之间相互依赖的程度。具体来说,对于两个随机变量,MI是一个随机变量由于已知另一个随机变量而减少的“信息量”(单位通常为比特)。互信息的概念与随机变量的熵紧密相关,熵是信息论中的基本概念,它量化的是随机变量中所包含的“信息量”。 MI不仅仅是度量实值随机变量和线性相关性(如相关系数),它更为通用。互信息决定了随机变量 ( X , Y ) {\displaystyle {\displaystyle (X,Y)}} 的联合分布与 X {\displaystyle X} 和 Y {\displaystyle Y} 的边缘分布的乘积之间的差异。MI是点互信息(Pointwise Mutual Information,PMI)的期望。克劳德·香农在他的论文A Mathematical Theory of Communication中定义并分析了这个度量,但是当时他并没有将其称为“互信息”。这个词后来由罗伯特·法诺创造。互信息也称为信息增益。
In probability theory and information theory, the mutual information (MI) of two random variables is a measure of the mutual dependence between the two variables. More specifically, it quantifies the "amount of information" (in units such as shannons (bits), nats or hartleys) obtained about one random variable by observing the other random variable. The concept of mutual information is intimately linked to that of entropy of a random variable, a fundamental notion in information theory that quantifies the expected "amount of information" held in a random variable. Not limited to real-valued random variables and linear dependence like the correlation coefficient, MI is more general and determines how different the joint distribution of the pair ( X , Y ) {\displaystyle (X,Y)} is from the product of the marginal distributions of X {\displaystyle X} and Y {\displaystyle Y} .
Sources, licensing and use
Wikipedia contributors · Retrieved2026-10-04 · CC BY-SA 4.0. Introductions were extracted as plain text and shortened. Language versions may emphasize different aspects.For concept reference; consult the original standards for authoritative requirements.
AES is a symmetric block cipher with 128-bit blocks and 128-, 192- or 256-bit keys. Secure use also requires an appropriate mode, nonce handling and key management.
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.
DES 是使用 56 位有效密钥的历史分组密码。其密钥空间不足以抵抗现代穷举攻击,今天主要用于兼容性研究和密码教学。
DES is a historical block cipher with a 56-bit effective key. Its key space is too small against modern exhaustive search, so it is chiefly of historical and compatibility interest.
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.
三重 DES 通过多次 DES 运算处理同一分组,曾用于迁移旧系统;其较小分组和已退役的标准地位使它不适合新建安全系统。
Triple DES applies DES operations multiple times to each block. It supported legacy migrations, but its small block size and retired standards status make it unsuitable for new systems.
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.
RSA constructs a modulus from large primes and uses related modular exponentiations. Practical encryption and signatures require secure encoding schemes rather than textbook RSA.
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.
Elliptic-curve cryptography builds key exchange and signatures from point groups over finite fields. Security depends on the selected discrete-logarithm problem and correct point validation.
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.
ECDSA is a digital signature algorithm based on elliptic curves. Its per-signature scalar must be generated securely; disclosure or reuse can reveal the private signing 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.
EdDSA is a family of digital signatures using twisted Edwards curves, including Ed25519. Encoding, domain separation and validation rules are integral parts of the scheme.
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.
Curve25519 is a Montgomery curve over a particular large prime field. X25519 uses it for key agreement, but the curve alone does not provide a complete authenticated communication protocol.
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.
Curve448 is a Montgomery curve used by modern elliptic-curve schemes. X448 key agreement uses it with parameters, encodings and performance characteristics distinct from X25519.
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 Schnorr signature turns a proof of discrete-logarithm knowledge into a signature, typically using a commitment, a message-dependent challenge and a response bound to the public 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.
ElGamal is randomized public-key encryption over a discrete-logarithm group. It requires fresh randomness for encryption, and the basic malleable scheme does not authenticate ciphertexts.
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.
Paillier is randomized public-key encryption with an additive homomorphism: multiplying ciphertexts can represent adding plaintexts. This does not by itself support arbitrary computation.
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.
Rabin encryption centers on squaring modulo a composite integer. Decryption produces multiple candidate square roots, so complete constructions require unambiguous encoding and additional security 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.
DSA is a signature algorithm based on discrete logarithms in finite fields. Protecting per-signature randomness is critical, and deployments must check current standards and permitted uses.
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 Lamport signature uses public hash values and selectively revealed secret values to sign once. Reusing a key pair for different messages undermines its one-time security 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.
A Merkle signature scheme authenticates many one-time public keys using a hash tree. A root represents the collection, while each signature includes an authentication path and a one-time signature.
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.
Hash-based signature schemes rely primarily on properties of cryptographic hash functions. Some require nonrollback state, while others trade larger signatures for stateless operation.
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-time pad uses a uniformly random secret key as long as the message and never reuses it. Under these conditions it provides information-theoretic secrecy, but not authentication.
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 Caesar cipher replaces each letter by a fixed cyclic shift. Its tiny key space is easily searched, making it useful for teaching modular arithmetic but not for protecting data.
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.