A hash function is any function that can be used to map data of arbitrary size to fixed-size values, though there are some hash functions that support variable-length output. The values returned by a hash function are called hash values, hash codes, (hash/message) digests, or simply hashes. The values are usually used to index a fixed-size table called a hash table. Use of a hash function to index a hash table is called hashing or scatter-storage addressing. Hash functions and their associated hash tables are used in data storage and retrieval applications to access data in a small and nearly constant time per retrieval. They require an amount of storage space only fractionally greater than the total space required for the data or records themselves. Hashing is a way to access data quickly and efficiently. Unlike lists or trees, it provides near-constant access time.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
SHA-2 (Secure Hash Algorithm 2) is a set of cryptographic hash functions designed by the United States National Security Agency (NSA) and first published in 2001. They are built using the Merkle–Damgård construction, from a one-way compression function itself built using the Davies–Meyer structure from a specialized block cipher. SHA-2 includes significant changes from its predecessor, SHA-1. The SHA-2 family consists of six hash functions with digests (hash values) that are 224, 256, 384 or 512 bits: SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, SHA-512/256. SHA-256 and SHA-512 are hash functions whose digests are eight 32-bit and 64-bit words, respectively. They use different shift amounts and additive constants, but their structures are otherwise virtually identical, differing only in the number of rounds.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
In cryptography, a preimage attack on cryptographic hash functions tries to find a message that has a specific hash value. A cryptographic hash function should resist attacks on its preimage (set of possible inputs). These can be compared with a collision resistance, in which it is computationally infeasible to find any two distinct inputs x, x′ that hash to the same output; i.e., such that h(x) = h(x′). Collision resistance implies second-preimage resistance, but does not guarantee preimage resistance. However, under certain assumptions of the range of the hash function, collision resistance does imply preimage resistance (by a provisional implication). Conversely, a second-preimage attack implies a collision attack (trivially, since, in addition to x′, x is already known right from the start).
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
HKDF is a multi-purpose key derivation function (KDF) based on the HMAC message authentication code. HKDF follows "extract-then-expand" paradigm, where the KDF logically consists of two modules: the first stage takes the input keying material and "extracts" from it a fixed-length pseudorandom key, and then the second stage "expands" this key into several additional, independent pseudorandom keys as the output of the KDF.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
A digital signature is a mathematical scheme for verifying the authenticity of digital messages or documents. A valid digital signature on a message gives any recipient confidence that the message came from a sender known to the recipient. In contrast, a message authentication code only gives confidence to a specific recipient that the message came from a known sender. Digital signatures are a type of public-key cryptography, and are commonly used for software distribution, financial transactions, contract management software, and in other cases where it is important to detect forgery or tampering.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
在数学中,椭圆曲线是平滑的投影代数曲线,其上有一个指定点 O。椭圆曲线在域 K 上定义,并描述 K 中的点(K 与其自身的笛卡尔积)。如果场的特性与2和3不同,则该曲线可以被描述为平面代数曲线,其由以下解(x,y)组成:对于K中的某些系数a和b。该曲线要求是非奇异的,这意味着该曲线没有尖点或自相交。 (这相当于条件 4a + 27b ≠ 0,即 x 中无平方。)通常理解,曲线嵌入在射影平面中,点 O 是无穷远处的唯一点。
In mathematics, an elliptic curve is a smooth, projective, algebraic curve of genus one, on which there is a specified point O. An elliptic curve is defined over a field K and describes points in K, the Cartesian product of K with itself. If the field's characteristic is different from 2 and 3, then the curve can be described as a plane algebraic curve which consists of solutions (x, y) for: for some coefficients a and b in K. The curve is required to be non-singular, which means that the curve has no cusps or self-intersections. (This is equivalent to the condition 4a + 27b ≠ 0, that is, being square-free in x.) It is usually understood that the curve is embedded in the projective plane, with the point O being the unique point at infinity.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
在数学中,对于给定的实数 a {\displaystyle a} 和 b {\displaystyle b} ,对数 log b ( a ) {\displaystyle \log _{b}(a)} 是一个数 x {\displaystyle x} ,使得 b x = a {\displaystyle b^{x}=a} 。离散对数是群论中的一个类似概念。在任何群 G {\displaystyle G} 中,可以为所有整数 k {\displaystyle k} 定义幂 b k {\displaystyle b^{k}} ,并且离散对数 log b ( a ) {\displaystyle \log _{b}(a)} 是整数 k {\displaystyle k} ,使得 b k = a {\displaystyle b^{k}=a} 。在算术模整数 m {\displaystyle m} 的特殊情况下,更常用的术语是索引:当 b k ≡ a ( mod m ) {\displaystyle b^{k}\equiv 时,可以写 k = ind b a ( mod m ) {\displaystyle k=\operatorname {ind} _{b}a\!\!\!\!{\pmod {m}}} a\!\!\!\!{\pmod {m}}} 。
In mathematics, for given real numbers a {\displaystyle a} and b {\displaystyle b} , the logarithm log b ( a ) {\displaystyle \log _{b}(a)} is a number x {\displaystyle x} such that b x = a {\displaystyle b^{x}=a} . The discrete logarithm is an analogous concept in group theory. In any group G {\displaystyle G} , powers b k {\displaystyle b^{k}} can be defined for all integers k {\displaystyle k} , and the discrete logarithm log b ( a ) {\displaystyle \log _{b}(a)} is an integer k {\displaystyle k} such that b k = a {\displaystyle b^{k}=a} . In the special case of arithmetic modulo an integer m {\displaystyle m} , the more commonly used term is index: One can write k = ind b a ( mod m ) {\displaystyle k=\operatorname {ind} _{b}a\!\!\!\!{\pmod {m}}} when b k ≡ a ( mod m ) {\displaystyle b^{k}\equiv a\!\!\!\!{\pmod {m}}} .
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
在数学中,有限域或伽罗瓦域(为纪念埃瓦里斯特·伽罗瓦而得名)是具有有限数量元素的域。与任何域一样,有限域是定义了乘法、加法、减法和除法运算并满足某些基本规则的集合。有限域最常见的例子是当 p {\displaystyle p} 是素数时的整数 mod p {\displaystyle p} 。有限域的阶是它的元素数量,元素要么是素数,要么是素数幂。对于每个素数 p {\displaystyle p} 和每个正整数 k {\displaystyle k} ,都有 p k {\displaystyle p^{k}} 阶的域。给定阶数的所有有限域都是同构的。
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that has a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are the integers mod p {\displaystyle p} when p {\displaystyle p} is a prime number. The order of a finite field is its number of elements, which is either a prime number or a prime power. For every prime number p {\displaystyle p} and every positive integer k {\displaystyle k} there are fields of order p k {\displaystyle p^{k}} . All finite fields of a given order are isomorphic.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
在数学中,域是定义加法、减法、乘法和除法的集合,其行为与有理数的相应运算相同。域是基本的代数结构,广泛应用于代数、数论和许多其他数学领域。最著名的领域是有理数领域、实数领域和复数领域。许多其他领域,例如有理函数域、代数函数域、代数数域、有限域和 p 进数域,在数学中,特别是在数论和代数几何中,也被广泛使用和研究。场论是证明仅用圆规和直尺无法完成角度三等分和化圆为方的证明的关键要素。
In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational numbers do. Fields are fundamental algebraic structures that are widely used in algebra, number theory, and many other areas of mathematics. The best known fields are the field of rational numbers, the field of real numbers, and the field of complex numbers. Many other fields, such as fields of rational functions, algebraic function fields, algebraic number fields, finite fields, and p-adic fields are commonly used and studied in mathematics, particularly in number theory and algebraic geometry. The theory of fields is a crucial ingredient in the proofs that angle trisection and squaring the circle cannot be done with a compass and straightedge alone.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
在数学中,模算术是一种整数算术运算系统,与通常的算术运算不同,当达到或超过某个值(称为模)时,数字会“环绕”。使用模算术的现代数论方法由卡尔·弗里德里希·高斯 (Carl Friedrich Gauss) 在其 1801 年出版的《算术研究》一书中提出。模算术以 m 为模,系统地用除以 m 的余数替换加法、乘法和减法的结果。模运算的一个显着特性是,计算的结果并不取决于是否在每次运算后除以 m,而是只在计算结束时执行一次,或者在计算结束时和一些中间结果之后执行(通常是在中间结果变得太大时)。
In mathematics, modular arithmetic is a system of arithmetic operations for integers, differing from the usual ones in that numbers "wrap around" when reaching or exceeding a certain value, called the modulus. The modern approach to number theory using modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801. Modular arithmetic modulo m consists of systematically replacing the results of additions, multiplications, and subtractions by the remainder of the division by m. A remarkable property of modular arithmetic is that the result of a computation does not depend on whether the division by m is performed after each operation, only once at the end of the computation, or at the end of the computation and after some intermediate results—typically when an intermediate result becomes too large.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
在数学中,特别是在算术领域中,整数 a 的模乘逆是整数 x,使得乘积 ax 对于模 m 等于 1。在模算术的标准表示法中,该同余被写为 m 除(均)量 ax − 1 的语句的简写方式,或者换句话说,ax 除以整数 m 后的余数为 1。如果 a 确实有模 m 的逆,则该同余有无限多个解,它们形成关于该模的同余类。此外,任何与 a 同余的整数(即,在 a 的同余类中)都具有 x 的同余类的任何元素作为模乘逆。
In mathematics, particularly in the area of arithmetic, a modular multiplicative inverse of an integer a is an integer x such that the product ax is congruent to 1 with respect to the modulus m. In the standard notation of modular arithmetic this congruence is written as which is the shorthand way of writing the statement that m divides (evenly) the quantity ax − 1, or, put another way, the remainder after dividing ax by the integer m is 1. If a does have an inverse modulo m, then there is an infinite number of solutions of this congruence, which form a congruence class with respect to this modulus. Furthermore, any integer that is congruent to a (i.e., in a's congruence class) has any element of x's congruence class as a modular multiplicative inverse.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
在算术和计算机编程中,扩展欧几里得算法是欧几里得算法的扩展,除了计算整数 a 和 b 的最大公约数 (gcd) 之外,还计算 Bézout 恒等式的系数,它们是整数 x 和 y,使得 a x + b y = gcd ( a , b ) {\displaystyle ax+by=\gcd(a,b)} ;它通常表示为 xgcd ( a , b ) {\displaystyle \operatorname {xgcd} (a,b)} 。这是一个证明算法,因为 gcd 是唯一可以同时满足该方程并除以输入的数字。它还允许人们计算 a 和 b 除以其最大公约数的商,几乎不需要额外的成本。扩展欧几里得算法还指用于计算多项式最大公约数和两个单变量多项式的 Bézout 恒等式系数的非常相似的算法。
In arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, and computes, in addition to the greatest common divisor (gcd) of integers a and b, also the coefficients of Bézout's identity, which are integers x and y such that a x + b y = gcd ( a , b ) {\displaystyle ax+by=\gcd(a,b)} ; it is generally denoted as xgcd ( a , b ) {\displaystyle \operatorname {xgcd} (a,b)} . This is a certifying algorithm, because the gcd is the only number that can simultaneously satisfy this equation and divide the inputs. It allows one to compute also, with almost no extra cost, the quotients of a and b by their greatest common divisor. Extended Euclidean algorithm also refers to a very similar algorithm for computing the polynomial greatest common divisor and the coefficients of Bézout's identity of two univariate polynomials.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
在数论中,欧拉定理(也称为费马-欧拉定理或欧拉 totient 定理)指出,如果 n 和 a 是互质正整数,则 a φ ( n ) {\displaystyle a^{\varphi (n)}} 与 1 {\displaystyle 1} modulo n 全等,其中 φ {\displaystyle \varphi } 表示欧拉 totient功能;即1736年,莱昂哈德·欧拉发表了费马小定理的证明(由费马无证明地陈述),即欧拉定理对n为素数的情况的限制。随后,欧拉提出了该定理的其他证明,并在 1763 年的论文中达到了顶峰,其中他证明了 n 不是素数情况的推广。欧拉定理的逆命题也成立:如果上述同余成立,则 a {\displaystyle a} 和 n {\displaystyle n} 必定互质。
In number theory, Euler's theorem (also known as the Fermat–Euler theorem or Euler's totient theorem) states that, if n and a are coprime positive integers, then a φ ( n ) {\displaystyle a^{\varphi (n)}} is congruent to 1 {\displaystyle 1} modulo n, where φ {\displaystyle \varphi } denotes Euler's totient function; that is In 1736, Leonhard Euler published a proof of Fermat's little theorem (stated by Fermat without proof), which is the restriction of Euler's theorem to the case where n is a prime number. Subsequently, Euler presented other proofs of the theorem, culminating with his paper of 1763, in which he proved a generalization to the case where n is not prime. The converse of Euler's theorem is also true: if the above congruence is true, then a {\displaystyle a} and n {\displaystyle n} must be coprime.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
In cryptography, a zero-knowledge proof (also known as a ZK proof or ZKP) is a protocol in which one party (the prover) can convince another party (the verifier) that some given statement is true, without conveying to the verifier any information beyond the mere fact of that statement's truth. The intuition behind the nontriviality of zero-knowledge proofs is that it is trivial to prove possession of the relevant information simply by revealing it; the hard part is to prove this possession without revealing this information (or any aspect of it whatsoever).
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
在密码学中,随机预言机是一种预言机(理论上的黑匣子),它使用从其输出域中统一选择的(真正)随机响应来响应每个唯一的查询。如果重复查询,则每次提交该查询时它都会以相同的方式响应。换句话说,随机预言是随机均匀选择的数学函数,即将每个可能的查询映射到来自其输出域的(固定)随机响应的函数。随机预言首先出现在复杂性理论的背景下,其中它们被用来论证复杂性类分离可能面临相对化障碍,最突出的例子是 P vs NP 问题,1981 年显示的两个类几乎肯定与随机预言不同。
In cryptography, a random oracle is an oracle (a theoretical black box) that responds to every unique query with a (truly) random response chosen uniformly from its output domain. If a query is repeated, it responds the same way every time that query is submitted. Stated differently, a random oracle is a mathematical function chosen uniformly at random, that is, a function mapping each possible query to a (fixed) random response from its output domain. Random oracles first appeared in the context of complexity theory, in which they were used to argue that complexity class separations may face relativization barriers, with the most prominent case being the P vs NP problem, two classes shown in 1981 to be distinct relative to a random oracle almost surely.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
Threat modeling is a process by which potential threats, such as structural vulnerabilities or the absence of appropriate safeguards, can be identified and enumerated, and countermeasures prioritized. The purpose of threat modeling is to provide defenders with a systematic analysis of what controls or defenses need to be included, given the nature of the system, the probable attacker's profile, the most likely attack vectors, and the assets most desired by an attacker. Threat modeling answers questions like "Where am I most vulnerable to attack?", "What are the most relevant threats?", and "What do I need to do to safeguard against these threats?". Conceptually, most people incorporate some form of threat modeling in their daily life and don't even realize it.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
In computer security, a side-channel attack is a type of security exploit that uses information inadvertently leaked by a system—such as timing, power consumption, or electromagnetic or acoustic emissions—to gain unauthorized access to sensitive information. These attacks differ from those targeting flaws in the design of cryptographic protocols or algorithms (notwithstanding the fact that cryptanalysis may identify vulnerabilities relevant to both types of attacks). Some side-channel attacks require technical knowledge of the internal operation of the system, others such as differential power analysis are effective as black-box attacks.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
In cryptography, a timing attack is a side-channel attack in which the attacker attempts to compromise a cryptosystem by analyzing the time taken to execute cryptographic algorithms. Every logical operation in a computer takes time to execute, and the time can differ based on the input; with precise measurements of the time for each operation, an attacker may be able to work backwards to the input. Information can leak from a system through measurement of the time it takes to respond to certain queries. How much this information can help an attacker depends on many variables such as cryptographic system design, the CPU running the system, the algorithms used, assorted implementation details, timing attack countermeasures, and accuracy of the timing measurements. Any algorithm that has data-dependent timing variation is vulnerable to timing attacks.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
In computer science, fault injection is a testing technique for understanding how computing systems behave when stressed in unusual ways. This can be achieved using physical- or software-based means, or using a hybrid approach. Widely studied physical fault injections include the application of high voltages, extreme temperatures and electromagnetic pulses on electronic components, such as computer memory and central processing units. By exposing components to conditions beyond their intended operating limits, computing systems can be coerced into mis-executing instructions and corrupting critical data. In software testing, fault injection is a technique for improving the coverage of a test by introducing faults to test code paths; in particular error handling code paths, that might otherwise rarely be followed.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
In cryptography, a padding oracle attack is an attack which uses the padding validation of a cryptographic message to decrypt the ciphertext. In cryptography, variable-length plaintext messages often have to be padded (expanded) to be compatible with the underlying cryptographic primitive. The attack relies on having a "padding oracle" which freely responds to queries about whether a message is correctly padded or not. The information could be directly given, or leaked through a side-channel. The earliest well-known attack that uses a padding oracle is Bleichenbacher's attack of 1998, which attacks RSA with PKCS #1 v1.5 padding. The term "padding oracle" appeared in literature in 2002, after Serge Vaudenay's attack on the CBC mode decryption used within symmetric block ciphers. Variants of both attacks continue to find success more than one decade after their original publication.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
重放攻击(也称为重复攻击或回放攻击)是一种网络攻击形式,其中有效数据传输被恶意或欺诈性地重复或延迟。这是由发起者或拦截数据并重新传输数据的对手执行的,可能是通过 IP 数据包替换进行欺骗攻击的一部分。这是中间人攻击的低层版本之一。重放攻击本质上通常是被动的。描述此类攻击的另一种方式是:“对安全协议的攻击,使用从不同上下文到预期(或原始和预期)上下文的消息重播,从而欺骗诚实的参与者,让他们认为他们已经成功完成了协议运行。”假设爱丽丝想向鲍勃证明她的身份。
A replay attack (also known as a repeat attack or playback attack) is a form of network attack in which valid data transmission is maliciously or fraudulently repeated or delayed. This is carried out either by the originator or by an adversary who intercepts the data and re-transmits it, possibly as part of a spoofing attack by IP packet substitution. This is one of the lower-tier versions of a man-in-the-middle attack. Replay attacks are usually passive in nature. Another way of describing such an attack is: "an attack on a security protocol using a replay of messages from a different context into the intended (or original and expected) context, thereby fooling the honest participant(s) into thinking they have successfully completed the protocol run." Suppose Alice wants to prove her identity to Bob.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
生日攻击是一种暴力碰撞攻击,利用概率论中生日问题背后的数学原理。此攻击可用于滥用两方或多方之间的通信。攻击取决于随机攻击尝试和固定排列程度(鸽洞)之间发现的较高碰撞可能性。令 H {\textstyle H} 为哈希函数的可能值的数量,其中 H = 2 l {\textstyle H=2^{l}} 。通过生日攻击,可以在 2 l = 2 l / 2 , {\textstyle {\sqrt {2^{l}}}=2^{l/2},} 中找到哈希函数的冲突,概率为 50 % {\textstyle 50\%},其中 l {\textstyle l} 是哈希输出的位长度,而 2 l − 1 {\textstyle 2^{l-1}} 是经典的原像抵抗具有相同概率的安全性。
A birthday attack is a brute-force collision attack that exploits the mathematics behind the birthday problem in probability theory. This attack can be used to abuse communication between two or more parties. The attack depends on the higher likelihood of collisions found between random attack attempts and a fixed degree of permutations (pigeonholes). Let H {\textstyle H} be the number of possible values of a hash function, with H = 2 l {\textstyle H=2^{l}} . With a birthday attack, it is possible to find a collision of a hash function with 50 % {\textstyle 50\%} chance in 2 l = 2 l / 2 , {\textstyle {\sqrt {2^{l}}}=2^{l/2},} where l {\textstyle l} is the bit length of the hash output, and with 2 l − 1 {\textstyle 2^{l-1}} being the classical preimage resistance security with the same probability.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
In common usage, randomness is the apparent or actual lack of definite patterns or predictability in information. A random sequence of events, symbols or steps often has no order and does not follow an intelligible pattern or combination. Individual random events are, by definition, unpredictable, but if there is a known probability distribution, the frequency of different outcomes over repeated events (or "trials") is predictable. For example, when throwing two dice, the outcome of any particular roll is unpredictable, but a sum of 7 will tend to occur twice as often as 4. In this view, randomness is not haphazardness; it is a measure of uncertainty of an outcome. Randomness applies to concepts of chance, probability, and information entropy.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
A cryptographically secure pseudorandom number generator (CSPRNG) or cryptographic pseudorandom number generator (CPRNG) is a pseudorandom number generator (PRNG) with properties that make it suitable for use in cryptography. It is also referred to as a cryptographic random number generator (CRNG). The "quality" of the randomness required for these applications varies. For example, creating a nonce in some protocols needs only uniqueness. On the other hand, the generation of a master key requires a higher quality, such as more entropy. And in the case of one-time pads, the information-theoretic guarantee of perfect secrecy only holds if the key material comes from a true random source with high entropy, and thus just any kind of pseudorandom number generator is insufficient.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
In cryptography, a key derivation function (KDF) is an algorithm that derives one or more secret keys from a secret value, such as a master key, a password, or a passphrase using a pseudorandom function (which typically uses a cryptographic hash function or block cipher). KDFs can be used to stretch keys into longer keys or to obtain keys of a required format, such as converting a group element that is the result of a Diffie–Hellman key exchange into a symmetric key for use with AES. Keyed cryptographic hash functions are popular examples of pseudorandom functions used for key derivation. The original use for a KDF is key derivation, the generation of keys from secret passwords or passphrases.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
Argon2 is a key derivation function that was selected as the winner of the 2015 Password Hashing Competition. It was designed by Alex Biryukov, Daniel Dinu, and Dmitry Khovratovich from the University of Luxembourg. The reference implementation of Argon2 is released under a Creative Commons CC0 license (i.e. public domain) or the Apache License 2.0. The Argon2 function uses a large, fixed-size memory region (often called the 'memory array' in documentation) to make brute-force attacks computationally expensive. The three variants differ in how they access this memory: While there is no public cryptanalysis applicable to Argon2d, there are two published attacks on the Argon2i function. The first attack is applicable only to the old version of Argon2i, while the second has been extended to the latest version (1.3).
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
In cryptography, X.509 is an International Telecommunication Union (ITU) standard defining the format of public key certificates. X.509 certificates are used in many Internet protocols, including TLS/SSL, which is the basis for HTTPS, the secure protocol for browsing the web. They are also used in offline applications, like electronic signatures. An X.509 certificate binds an identity to a public key using a digital signature. A certificate contains an identity (a hostname, or an organization, or an individual) and a public key (RSA, DSA, ECDSA, ed25519, etc.), and is either signed by a certificate authority (CA) or is self-signed.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
In cryptography, forward secrecy (FS), also known as perfect forward secrecy (PFS), is a feature of specific key-agreement protocols that gives assurances that session keys will not be compromised even if long-term secrets used in the session key exchange are compromised, limiting damage. For TLS, the long-term secret is typically the private key of the server. Forward secrecy protects past sessions against future compromises of keys or passwords. By generating a unique session key for every session a user initiates, the compromise of a single session key will not affect any data other than that exchanged in the specific session protected by that particular key. This by itself is not sufficient for forward secrecy, which additionally requires that a long-term secret compromise does not affect the security of past session keys.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
秘密共享(也称为秘密分裂)是指在群体中分配秘密的方法,这样任何人都无法掌握有关秘密的任何可理解的信息,但是当足够数量的个人结合他们的“份额”时,秘密就可以被重建。不安全的秘密共享允许攻击者通过每次共享获得更多信息,而安全的秘密共享是“全部或全部”(其中“全部”表示必要的共享数量)。在一种类型的秘密共享方案中,有 1 个庄家和 n 个玩家。庄家将秘密的一部分交给玩家,但只有满足特定条件,玩家才能从他们的份额中重建秘密。
Secret sharing (also called secret splitting) refers to methods for distributing a secret among a group, in such a way that no individual holds any intelligible information about the secret, but when a sufficient number of individuals combine their 'shares', the secret may be reconstructed. Whereas insecure secret sharing allows an attacker to gain more information with each share, secure secret sharing is 'all or nothing' (where 'all' means the necessary number of shares). In one type of secret sharing scheme there is one dealer and n players. The dealer gives a share of the secret to the players, but only when specific conditions are fulfilled will the players be able to reconstruct the secret from their shares.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。