密码学Threshold cryptosystem门限密码系统是门限密码学领域的基础,它是一种将密钥分割成多个部分并提供给不同各方的密码系统。然后,多方(超过某个阈值数量)可以合作使用密码系统。更准确地说,令 n {\displaystyle n} 为参与方的数量。如果至少 t 个参与方可以合作执行所需的操作(通常签署消息或解密密文),而少于 t 个参与方的任何子集则不能合作,则密码系统称为 (t,n) 阈值。阈值加密允许将秘密存储在多个位置,以防止秘密被捕获以及该系统的后续密码分析。除了存储方面的安全性之外,这使得该方法成为主要的信任共享机制。
A threshold cryptosystem, the basis for the field of threshold cryptography, is a cryptosystem in which the secret key is split into a number of pieces that are given to different parties. Several parties (more than some threshold number) can then cooperate to use the cryptosystem. More precisely, let n {\displaystyle n} be the number of parties. A cryptosystem is called (t,n)-threshold, if at least t of these parties can cooperate to perform the desired operation (usually sign a message or decrypt a ciphertext), while any subset of fewer than t parties cannot. Threshold cryptography allows to store secrets in multiple locations to prevent the capture of the secret and the subsequent cryptanalysis of that system. This makes the method a primary trust sharing mechanism, besides its safety of storage aspects.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Secure multi-party computation安全多方计算(也称为安全计算、多方计算 (MPC) 或隐私保护计算)是密码学的一个子领域,其目标是为各方创建方法来共同计算其输入的函数,同时保持这些输入的私密性。与传统的密码学任务不同,在传统的密码学任务中,密码学确保通信或存储的安全性和完整性,并且对手位于参与者系统之外(发送者和接收者的窃听者),而该模型中的密码学可以保护参与者彼此的隐私。安全多方计算的基础始于 20 世纪 70 年代末期的心理扑克工作,以及无需可信第三方即可远距离模拟游戏/计算任务的加密工作。
Secure multi-party computation (also known as secure computation, multi-party computation (MPC) or privacy-preserving computation) is a subfield of cryptography with the goal of creating methods for parties to jointly compute a function over their inputs while keeping those inputs private. Unlike traditional cryptographic tasks, where cryptography assures security and integrity of communication or storage and the adversary is outside the system of participants (an eavesdropper on the sender and receiver), the cryptography in this model protects participants' privacy from each other. The foundation for secure multi-party computation started in the late 1970s with the work on mental poker, cryptographic work that simulates game playing/computational tasks over distances without requiring a trusted third party.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Oblivious transfer在密码学中,不经意传输 (OT) 协议是一种协议,其中发送者将潜在的多条信息中的一条信息传输给接收者,但仍然不知道已传输的信息(如果有)。第一种形式的不经意转移是由 Michael O. Rabin 于 1981 年提出的。在这种形式中,发送者以 1/2 的概率向接收者发送消息,而发送者则不知道接收者是否收到了该消息。 Rabin 的不经意传输方案基于 RSA 密码系统。 Shimon Even、Oded Goldreich 和 Abraham Lempel 后来开发了一种更有用的不经意转移形式,称为 1-2 不经意转移或“1 of 2 不经意转移”,以便构建安全多方计算的协议。
In cryptography, an oblivious transfer (OT) protocol is a type of protocol in which a sender transfers one of potentially many pieces of information to a receiver, but remains oblivious as to what piece (if any) has been transferred. The first form of oblivious transfer was introduced in 1981 by Michael O. Rabin. In this form, the sender sends a message to the receiver with probability 1/2, while the sender remains oblivious as to whether or not the receiver received the message. Rabin's oblivious transfer scheme is based on the RSA cryptosystem. A more useful form of oblivious transfer called 1–2 oblivious transfer or "1 out of 2 oblivious transfer", was developed later by Shimon Even, Oded Goldreich, and Abraham Lempel, in order to build protocols for secure multiparty computation.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Test vector在计算机科学和工程中,测试向量是提供给系统以测试该系统的一组输入。在软件开发中,测试向量是一种软件测试以及软件验证和确认的方法。在计算机科学和工程中,系统充当可计算函数。特定函数的一个例子是 y = f ( x ) {\displaystyle y=f(x)},其中 y {\displaystyle y} 是系统的输出,x {\displaystyle x} 是输入;然而,大多数系统的输入都不是一维的。
In computer science and engineering, a test vector is a set of inputs provided to a system in order to test that system. In software development, test vectors are a methodology of software testing and software verification and validation. In computer science and engineering, a system acts as a computable function. An example of a specific function could be y = f ( x ) {\displaystyle y=f(x)} where y {\displaystyle y} is the output of the system and x {\displaystyle x} is the input; however, most systems' inputs are not one-dimensional.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Confidentiality保密涉及一组规则或承诺,有时通过保密协议执行,限制某些类型信息的访问或分发。根据法律,律师通常需要对委托人代理的任何内容保密。保密义务比律师与委托人的证据特权广泛得多,后者仅涵盖律师与委托人之间的通信。特权和义务都是为了鼓励客户坦诚地谈论他们的案件。这样,律师就可以履行为客户提供热心代理的职责。否则,对方可能会在法庭上用他不了解委托人的事情让律师感到惊讶,这可能会削弱委托人的立场。
Confidentiality involves a set of rules or a promise sometimes executed through confidentiality agreements that limits the access to or places restrictions on the distribution of certain types of information. By law, lawyers are often required to keep confidential anything on the representation of a client. The duty of confidentiality is much broader than the attorney–client evidentiary privilege, which only covers communications between the attorney and the client. Both the privilege and the duty serve the purpose of encouraging clients to speak frankly about their cases. This way, lawyers can carry out their duty to provide clients with zealous representation. Otherwise, the opposing side may be able to surprise the lawyer in court with something he did not know about his client, which may weaken the client's position.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Cryptanalysis密码分析(来自希腊语 kryptós“隐藏”和 analýein“分析”)是指分析信息系统以了解系统隐藏方面的过程。密码分析用于破坏加密安全系统并访问加密消息的内容,即使加密密钥未知。除了密码算法的数学分析之外,密码分析还包括侧信道攻击的研究,这些攻击不针对密码算法本身的弱点,而是利用其实现中的弱点。
Cryptanalysis (from Greek kryptós 'hidden' and analýein 'to analyze') refers to the process of analyzing information systems in order to understand hidden aspects of the systems. Cryptanalysis is used to breach cryptographic security systems and gain access to the contents of encrypted messages, even if the cryptographic key is unknown. In addition to mathematical analysis of cryptographic algorithms, cryptanalysis includes the study of side-channel attacks that do not target weaknesses in the cryptographic algorithms themselves, but instead exploit weaknesses in their implementation.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Linear cryptanalysis在密码学中,线性密码分析是基于寻找密码行为的仿射近似的密码分析的一般形式。已经针对分组密码和流密码开发了攻击。线性密码分析是针对分组密码的两种最广泛使用的攻击之一;另一个是差分密码分析。这一发现归功于 Mitsuru Matsui,他首先将该技术应用于 FEAL 密码(Matsui 和 Yamagishi,1992)。随后,Matsui 发表了对数据加密标准 (DES) 的攻击,最终导致了开放社区中报告的第一个密码实验密码分析(Matsui,1993;1994)。对 DES 的攻击一般不实用,需要 2 个已知的明文。
In cryptography, linear cryptanalysis is a general form of cryptanalysis based on finding affine approximations to the action of a cipher. Attacks have been developed for block ciphers and stream ciphers. Linear cryptanalysis is one of the two most widely used attacks on block ciphers; the other being differential cryptanalysis. The discovery is attributed to Mitsuru Matsui, who first applied the technique to the FEAL cipher (Matsui and Yamagishi, 1992). Subsequently, Matsui published an attack on the Data Encryption Standard (DES), eventually leading to the first experimental cryptanalysis of the cipher reported in the open community (Matsui, 1993; 1994). The attack on DES is not generally practical, requiring 2 known plaintexts.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Differential cryptanalysis差分密码分析是密码分析的一般形式,主要适用于分组密码,但也适用于流密码和密码散列函数。从最广泛的意义上来说,它是研究信息输入的差异如何影响输出的结果差异。就分组密码而言,它是指通过转换网络追踪差异、发现密码在何处表现出非随机行为并利用这些属性来恢复秘密密钥(加密密钥)的一组技术。差分密码分析的公开发现和披露通常归功于 20 世纪 80 年代末期的 Eli Biham 和 Adi Shamir,他们发表了许多针对各种分组密码和哈希函数的攻击,其中包括数据加密标准 (DES) 中的理论弱点。
Differential cryptanalysis is a general form of cryptanalysis applicable primarily to block ciphers, but also to stream ciphers and cryptographic hash functions. In the broadest sense, it is the study of how differences in information input can affect the resultant difference at the output. In the case of a block cipher, it refers to a set of techniques for tracing differences through the network of transformation, discovering where the cipher exhibits non-random behavior, and exploiting such properties to recover the secret key (cryptography key). The public discovery and disclosure of differential cryptanalysis is generally attributed to Eli Biham and Adi Shamir in the late 1980s, who published a number of attacks against various block ciphers and hash functions, including a theoretical weakness in the Data Encryption Standard (DES).
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Accumulator (cryptography)在密码学中,累加器是一种单向成员哈希函数。它允许用户证明潜在候选人是某个集合的成员,而无需透露该集合的各个成员。这个概念由 Josh Benaloh 和 Michael de Mare 于 1993 年正式提出。文献中提出了几种正式的定义。本节按提议者大致按时间顺序列出了它们。 Benaloh 和 de Mare 将单向哈希函数定义为一系列函数 h ℓ : X ℓ × Y ℓ → Z ℓ {\displaystyle h_{\ell }:X_{\ell }\times Y_{\ell }\to Z_{\ell }} 满足以下三个属性:
In cryptography, an accumulator is a one way membership hash function. It allows users to certify that potential candidates are a member of a certain set without revealing the individual members of the set. This concept was formally introduced by Josh Benaloh and Michael de Mare in 1993. There are several formal definitions which have been proposed in the literature. This section lists them by proposer, in roughly chronological order. Benaloh and de Mare define a one-way hash function as a family of functions h ℓ : X ℓ × Y ℓ → Z ℓ {\displaystyle h_{\ell }:X_{\ell }\times Y_{\ell }\to Z_{\ell }} which satisfy the following three properties:
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Alice and Bob爱丽丝和鲍勃是虚构的人物,通常在有关密码系统和协议的讨论以及其他科学和工程文献中用作占位符,其中思想实验中有多个参与者。 Alice 和 Bob 角色是由 Ron Rivest、Adi Shamir 和 Leonard Adleman 在他们 1978 年的论文“获取数字签名和公钥密码系统的方法”中创建的。随后,它们已成为许多科学和工程领域的常见原型,例如量子密码学、博弈论和物理学。随着爱丽丝和鲍勃的使用变得更加广泛,添加了额外的字符,有时具有特定的含义。这些字符不一定是指人,而是指人。它们指的是通用代理,可能是不同的计算机,甚至是在一台计算机上运行的不同程序。
Alice and Bob are fictional characters commonly used as placeholders in discussions about cryptographic systems and protocols, and in other science and engineering literature where there are several participants in a thought experiment. The Alice and Bob characters were created by Ron Rivest, Adi Shamir, and Leonard Adleman in their 1978 paper "A Method for Obtaining Digital Signatures and Public-key Cryptosystems". Subsequently, they have become common archetypes in many scientific and engineering fields, such as quantum cryptography, game theory and physics. As the use of Alice and Bob became more widespread, additional characters were added, sometimes with particular meanings. These characters do not have to refer to people; they refer to generic agents which might be different computers or even different programs running on a single computer.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Backdoor (computing)后门是一种典型的隐蔽方法,用于绕过计算机、产品、嵌入式设备(例如家庭路由器)或其实施例(例如密码系统、算法、芯片组,甚至“小人计算机”——计算机中的微型计算机,例如英特尔 AMT 技术中的计算机)中的正常身份验证或加密。后门最常用于保护对计算机的远程访问,或获取对密码系统中的明文的访问。从那里它可能被用来访问特权信息,例如密码,损坏或删除硬盘驱动器上的数据,或者在受感染的网络中传输信息。在美国,1994 年《执法通信援助法》强制互联网提供商为政府当局提供后门。
A backdoor is a typically covert method of bypassing normal authentication or encryption in a computer, product, embedded device (e.g. a home router), or its embodiment (e.g. part of a cryptosystem, algorithm, chipset, or even a "homunculus computer"—a tiny computer-within-a-computer such as that found in Intel's AMT technology). Backdoors are most often used for securing remote access to a computer, or obtaining access to plaintext in cryptosystems. From there it may be used to gain access to privileged information like passwords, corrupt or delete data on hard drives, or transfer information within compromised networks. In the United States, the 1994 Communications Assistance for Law Enforcement Act forces internet providers to provide backdoors for government authorities.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Blacker (security)Blacker(风格为 BLACKER)是美国国防部计算机网络安全项目,旨在实现可信计算机系统评估标准 (TCSEC) 的 A1 级评级(极高保证)。第一个 Blacker 项目于 20 世纪 70 年代末开始,后续项目最终在 1980 年代末生产出现场设备。它是美国国防数据网络上第一个具有可信端到端加密的安全系统。该项目由 SDC(软件)和 Burroughs(硬件)实施,合并后由新成立的 Unisys 公司实施。
Blacker (styled BLACKER) is a U.S. Department of Defense computer network security project designed to achieve A1 class ratings (very high assurance) of the Trusted Computer System Evaluation Criteria (TCSEC). The first Blacker program began in the late 1970s, with a follow-on eventually producing fielded devices in the late 1980s. It was the first secure system with trusted end-to-end encryption on the United States' Defense Data Network. The project was implemented by SDC (software), and Burroughs (hardware), and after their merger, by the resultant company Unisys.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Blinding (cryptography)在密码学中,致盲首先在盲签名的背景下为人所知,其中消息作者使用随机致盲因子对消息进行致盲,然后签名者对其进行签名,消息作者对其进行“解除致盲”;签名者和消息作者是不同的一方。自20世纪90年代末以来,盲法主要指针对加密设备的旁路攻击的对策,即随机盲法和“揭盲”发生在加密设备上。用于致盲签名的技术经过调整,可以防止攻击者知道 Diffie-Hellman 或 RSA 模幂函数的输入。盲法必须谨慎应用,例如拉宾-威廉姆斯签名。如果对格式化消息应用盲法,但随机值不满足 p 和 q 上的雅可比要求,则可能导致私钥恢复。
In cryptography, blinding first became known in the context of blind signatures, where the message author blinds the message with a random blinding factor, the signer then signs it and the message author "unblinds" it; signer and message author are different parties. Since the late 1990s, blinding mostly refers to countermeasures against side-channel attacks on encryption devices, where the random blinding and the "unblinding" happen on the encryption devices. The techniques used for blinding signatures were adapted to prevent attackers from knowing the input to the modular exponentiation function for Diffie-Hellman or RSA. Blinding must be applied with care, for example Rabin–Williams signatures. If blinding is applied to the formatted message but the random value does not honor Jacobi requirements on p and q, then it could lead to private key recovery.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Blocknots块符号是一本书中包含的随机数字序列,按编号的行和列进行组织,在第二次世界大战期间被用作苏联密码译码的添加剂。 Blocknot 包含一本小册子,里面有 50 张 5 位数的随机添加剂,每张纸有 100 个添加剂组。没有一张纸被使用超过一次,因此这些块实际上是一次性垫的一种形式。苏联在东方使用的最高等级密码是用 Blocknot 书加密的 5 位密码本,通常被认为是牢不可破的。 Blocknot 是从莫斯科的一个办公室集中分发的。每个 Blocknot 在多张纸中包含 5 位数字组,用于加密 5 位数字消息。加密是通过使用从垫上取出的添加剂来实现的,其中出现了 50-100 个 5 位数组。
Blocknots were random sequences of numbers contained in a book and organized by numbered rows and columns and were used as additives in the reciphering of Soviet Union codes, during World War II. The Blocknot consisted of a booklet of fifty sheets of 5-figure random additive, 100 additive groups to a sheet. No sheet was used more than once, thus the blocknots were in effect a form of one-time pad. The Soviet Unions highest grade ciphers that were used in the East, were the 5-figure codebook enciphered with the Blocknot book, and were generally considered unbreakable. Blocknots were distributed centrally from an office in Moscow. Every Blocknot contained 5-figure groups in a number of sheets, for the enciphering of 5-figure messages. The encipherment was effected by applying additives taken from the pad, of which 50-100 5-figure groups appeared.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Branch number在密码学中,分支数是一个数值,表征向量布尔函数 F 引入的扩散量,该函数将输入向量 a 映射到输出向量 F ( a ) {\displaystyle F(a)} 。对于线性 F 的(通常)情况,微分分支数的值由以下公式产生: 如果 a 和 F ( a ) {\displaystyle F(a)} 都有 s 分量,则结果显然会受到值 s + 1 {\displaystyle s+1} 的上限限制(当 a 中的任何单个非零分量使得 F ( a ) {\displaystyle F(a)} 的所有分量都非零时,就会实现这种“完美”结果)。高分支数表明对差分密码分析的抵抗力较高:输入的微小变化将在输出上产生较大的变化,并且为了获得输出的较小变化,将需要输入值的较大变化。
In cryptography, the branch number is a numerical value that characterizes the amount of diffusion introduced by a vectorial Boolean function F that maps an input vector a to output vector F ( a ) {\displaystyle F(a)} . For the (usual) case of a linear F the value of the differential branch number is produced by: If both a and F ( a ) {\displaystyle F(a)} have s components, the result is obviously limited on the high side by the value s + 1 {\displaystyle s+1} (this "perfect" result is achieved when any single nonzero component in a makes all components of F ( a ) {\displaystyle F(a)} to be non-zero). A high branch number suggests higher resistance to the differential cryptanalysis: the small variations of input will produce large changes on the output and in order to obtain small variations of the output, large changes of the input value will be required.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学BREACHBREACH(反义词:通过超文本自适应压缩进行浏览器侦察和渗透)是使用 HTTP 压缩时针对 HTTPS 的安全漏洞。 BREACH 是基于 CRIME 安全漏洞构建的。安全研究人员 Angelo Prado、Neal Harris 和 Yoel Gluck 在 2013 年 8 月举行的 Black Hat USA 会议上宣布了 BREACH。虽然 CRIME 攻击被认为是一种可以有效对抗大量协议的一般攻击,但仅针对 SPDY 请求压缩和 TLS 压缩的利用在浏览器和服务器中得到了演示并在很大程度上得到了缓解。针对 HTTP 压缩的 CRIME 漏洞根本没有得到缓解,尽管 CRIME 的作者警告说,该漏洞可能比 SPDY 和 TLS 压缩的总和还要广泛。
BREACH (a backronym: Browser Reconnaissance and Exfiltration via Adaptive Compression of Hypertext) is a security vulnerability against HTTPS when using HTTP compression. BREACH is built based on the CRIME security exploit. BREACH was announced at the August 2013 Black Hat USA conference by security researchers Angelo Prado, Neal Harris and Yoel Gluck. While the CRIME attack was presented as a general attack that could work effectively against a large number of protocols, only exploits against SPDY request compression and TLS compression were demonstrated and largely mitigated in browsers and servers. The CRIME exploits against HTTP compression has not been mitigated at all, even though the authors of CRIME have warned that this vulnerability might be even more widespread than SPDY and TLS compression combined.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Bring your own encryption自带加密(BYOE)也称为自带密钥(BYOK),是一种云计算安全模型,允许云服务客户使用自己的加密软件并管理自己的加密密钥。 BYOE 使云服务客户能够利用其加密软件的虚拟实例以及云托管的业务应用程序来加密其数据。在此模型中,托管业务应用程序配置为通过加密软件处理所有数据。然后,该软件将数据的密文版本写入云服务提供商的物理数据存储,并根据检索请求解密密文数据。这种方法使企业能够控制其密钥,并能够使用内部硬件安全模块 (HSM) 生成自己的主密钥,然后将其传输到云提供商的 HSM。
Bring your own encryption (BYOE), also known as bring your own key (BYOK), is a cloud computing security model that allows cloud service customers to use their own encryption software and manage their own encryption keys. BYOE enables cloud service customers to utilize a virtual instance of their encryption software alongside their cloud-hosted business applications to encrypt their data. In this model, hosted business applications are configured to process all data through the encryption software. This software then writes the ciphertext version of the data to the cloud service provider's physical data store and decrypts ciphertext data upon retrieval requests. This approach provides enterprises with control over their keys and the ability to generate their own master key using internal hardware security modules (HSM), which are then transmitted to the cloud provider's HSM.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Bus encryption总线加密是在计算机中的数据总线上使用加密的程序指令,该计算机包括用于执行加密指令的安全加密处理器。总线加密主要用于需要高安全性的电子系统,例如自动柜员机、电视机顶盒以及双向数字收音机等安全数据通信设备。总线加密还可以意味着数据总线上从一个处理器到另一处理器的加密数据传输。例如,从CPU到GPU不需要输入加密指令。 Windows Vista 和较新的 Microsoft 操作系统使用此类总线加密来保护证书、BIOS、密码和程序的真实性。
Bus encryption is the use of encrypted program instructions on a data bus in a computer that includes a secure cryptoprocessor for executing the encrypted instructions. Bus encryption is used primarily in electronic systems that require high security, such as automated teller machines, TV set-top boxes, and secure data communication devices such as two-way digital radios. Bus encryption can also mean encrypted data transmission on a data bus from one processor to another processor. For example, from the CPU to a GPU which does not require input of encrypted instructions. Such bus encryption is used by Windows Vista and newer Microsoft operating systems to protect certificates, BIOS, passwords, and program authenticity.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Chaffing and winnowing干扰和风选是一种加密技术,用于在通过不安全通道发送数据时不使用加密来实现机密性。该名称源自农业:谷物收获并脱粒后,仍与不可食用的纤维状谷壳混合在一起。然后通过风选将谷壳和谷物分离,然后丢弃谷壳。该加密技术由 Ron Rivest 构思并于 1998 年 3 月 18 日发表在一篇在线文章中。尽管它与传统加密和隐写术有相似之处,但它不能归入任一类别。该技术允许发送者否认对其消息进行加密的责任。当使用干扰和筛选时,发送者以明文形式传输未加密的消息。尽管发送者和接收者共享密钥,但他们仅将其用于身份验证。
Chaffing and winnowing is a cryptographic technique to achieve confidentiality without using encryption when sending data over an insecure channel. The name is derived from agriculture: after grain has been harvested and threshed, it remains mixed together with inedible fibrous chaff. The chaff and grain are then separated by winnowing, and the chaff is discarded. The cryptographic technique was conceived by Ron Rivest and published in an on-line article on 18 March 1998. Although it bears similarities to both traditional encryption and steganography, it cannot be classified under either category. This technique allows the sender to deny responsibility for encrypting their message. When using chaffing and winnowing, the sender transmits the message unencrypted, in clear text. Although the sender and the receiver share a secret key, they use it only for authentication.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Chaotic cryptology混沌密码学是数学混沌理论在密码学实践中的应用,密码学是用于在第三方或对手存在的情况下私密且安全地传输信息的研究或技术。自 1989 年 Robert Matthews 首次研究以来,混沌在密码学中的应用引起了人们的广泛兴趣。然而,长期以来对其安全性和实施速度的担忧继续限制其实施。混沌密码学由两个相反的过程组成:混沌密码学和混沌密码分析。密码学是指对信息进行加密以进行安全传输,而密码分析是指对编码的加密消息进行解密和破译。
Chaotic cryptology is the application of mathematical chaos theory to the practice of cryptography, the study or techniques used to privately and securely transmit information with the presence of a third-party or adversary. Since first being investigated by Robert Matthews in 1989, the use of chaos in cryptography has attracted much interest. However, long-standing concerns about its security and implementation speed continue to limit its implementation. Chaotic cryptology consists of two opposite processes: Chaotic cryptography and Chaotic cryptanalysis. Cryptography refers to encrypting information for secure transmission, whereas cryptanalysis refers to decrypting and deciphering encoded encrypted messages.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Cipher在密码学中,密码(或密码)是一种用于执行加密或解密的算法 - 一系列可以作为过程遵循的明确定义的步骤。另一种不太常见的术语是加密。加密或编码是将信息转换为密码或代码。一般来说,“密码”与“代码”同义,因为它们都是加密消息的一组步骤;然而,这些概念在密码学中是不同的,尤其是经典密码学。代码通常替换输出中不同长度的字符串,而密码通常替换与输入相同数量的字符。代码将一种含义映射到另一种含义。单词和短语可以编码为字母或数字。代码通常具有从输入到按键的直接含义。代码的主要作用是节省时间。密码是算法性的。
In cryptography, a cipher (or cypher) is an algorithm for performing encryption or decryption—a series of well-defined steps that can be followed as a procedure. An alternative, less common term is encipherment. To encipher or encode is to convert information into cipher or code. In common parlance, "cipher" is synonymous with "code", as they are both a set of steps that encrypt a message; however, the concepts are distinct in cryptography, especially classical cryptography. Codes generally substitute different length strings of characters in the output, while ciphers generally substitute the same number of characters as are input. A code maps one meaning with another. Words and phrases can be coded as letters or numbers. Codes typically have direct meaning from input to key. Codes primarily function to save time. Ciphers are algorithmic.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Cipher device密码设备是美国军方在20世纪上半叶使用的一个术语,用来描述一种手动操作的密码设备,可以将明文转换为密文,反之亦然。类似的术语“密码机”用于描述需要外部电源才能运行的密码设备。密码盒或加密盒是一种物理加密设备,用于加密和解密明文(未加密)和密文(加密或秘密)形式之间的消息。密文适合通过信道(例如无线电)传输,通信双方希望隐藏明文的对手可能会观察到该信道。这篇与密码学相关的文章是一个小作品。您可以通过添加缺失的信息来帮助维基百科。这篇与军事相关的文章是一个小作品。您可以通过添加缺失的信息来帮助维基百科。
A cipher device was a term used by the US military in the first half of the 20th century to describe a manually operated cipher equipment that converted the plaintext into ciphertext or vice versa. A similar term, cipher machine, was used to describe the cipher equipment that required external power for operation. Cipher box or crypto box is a physical cryptographic device used to encrypt and decrypt messages between plaintext (unencrypted) and ciphertext (encrypted or secret) forms. The ciphertext is suitable for transmission over a channel, such as radio, that might be observed by an adversary the communicating parties wish to conceal the plaintext from. This cryptography-related article is a stub. You can help Wikipedia by adding missing information. This military-related article is a stub. You can help Wikipedia by adding missing information.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Ciphertext expansion在密码学中,术语“密文扩展”是指加密时消息的长度增加。许多现代密码系统在加密过程中会导致某种程度的扩展,例如当生成的密文必须包含消息唯一的初始化向量(IV)时。概率加密方案会导致密文扩展,因为可能的密文集合必然大于输入明文集合。某些方案,例如 Cocks 基于身份的加密或 Goldwasser-Micali 密码系统,会导致密文比明文长数百或数千倍。密文扩展可以通过压缩或扩展消息的其他过程来抵消或增加,例如数据压缩或纠错编码。
In cryptography, the term ciphertext expansion refers to the length increase of a message when it is encrypted. Many modern cryptosystems cause some degree of expansion during the encryption process, for instance when the resulting ciphertext must include a message-unique Initialization Vector (IV). Probabilistic encryption schemes cause ciphertext expansion, as the set of possible ciphertexts is necessarily greater than the set of input plaintexts. Certain schemes, such as Cocks Identity Based Encryption, or the Goldwasser-Micali cryptosystem result in ciphertexts hundreds or thousands of times longer than the plaintext. Ciphertext expansion may be offset or increased by other processes which compress or expand the message, e.g., data compression or error correction coding.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Client-side encryption客户端加密是在发送方将数据传输到云存储服务等服务器之前对数据进行加密的加密技术。客户端加密具有服务提供商无法使用的加密密钥,这使得服务提供商很难或不可能解密托管数据。客户端加密允许创建其提供商无法访问其用户存储的数据的应用程序,从而提供高级别的隐私。利用客户端加密的应用程序有时会以误导性或不正确的术语“零知识”进行销售,但这是用词不当,因为术语“零知识”描述了密码学背景下完全不同的东西。
Client-side encryption is the cryptographic technique of encrypting data on the sender's side, before it is transmitted to a server such as a cloud storage service. Client-side encryption features an encryption key that is not available to the service provider, making it difficult or impossible for service providers to decrypt hosted data. Client-side encryption allows for the creation of applications whose providers cannot access the data its users have stored, thus offering a high level of privacy. Applications utilizing client-side encryption are sometimes marketed under the misleading or incorrect term "zero-knowledge", but this is a misnomer, as the term zero-knowledge describes something entirely different in the context of cryptography.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Code (cryptography)在密码学中,代码是一种用于加密在含义层面上运行的消息的方法;也就是说,单词或短语被转换成其他东西。代码可能会将“change”转换为“CVGDK”或“cocktail Lounge”。美国国家安全局将代码定义为“一种替代密码系统,其中明文元素主要是单词、短语或句子,而代码等效项(称为“代码组”)通常由字母或数字(或两者)以相同长度的无意义组合组成。”需要密码本来加密和解密短语或单词。相比之下,密码在单个字母或小组字母的级别上加密消息,甚至在现代密码中,在单个位的级别上加密消息。消息可以首先通过代码进行转换,然后通过密码进行转换。
In cryptology, a code is a method used to encrypt a message that operates at the level of meaning; that is, words or phrases are converted into something else. A code might transform "change" into "CVGDK" or "cocktail lounge". The U.S. National Security Agency defined a code as "A substitution cryptosystem in which the plaintext elements are primarily words, phrases, or sentences, and the code equivalents (called "code groups") typically consist of letters or digits (or both) in otherwise meaningless combinations of identical length." A codebook is needed to encrypt, and decrypt the phrases or words. By contrast, ciphers encrypt messages at the level of individual letters, or small groups of letters, or even, in modern ciphers, individual bits. Messages can be transformed first by a code, and then by a cipher.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Codebook密码本是一种用于收集和存储密码的文档。最初,密码本通常是字面上的书籍,但今天“密码本”是一系列代码的完整记录的代名词,无论物理格式如何。在密码学中,密码本是用于实现代码的文档。码本包含用于编码和解码的查找表;每个单词或短语都有一个或多个字符串来替换它。为了破译用代码编写的消息,两端都必须有相应的代码本副本。与密码中使用的秘密信息(密钥)相比,密码本的分发和物理安全性在代码的使用中提出了特殊的困难,密钥通常要短得多。
A codebook is a type of document used for gathering and storing cryptography codes. Originally, codebooks were often literally books, but today "codebook" is a byword for the complete record of a series of codes, regardless of physical format. In cryptography, a codebook is a document used for implementing a code. A codebook contains a lookup table for coding and decoding; each word or phrase has one or more strings which replace it. To decipher messages written in code, corresponding copies of the codebook must be available at either end. The distribution and physical security of codebooks presents a special difficulty in the use of codes compared to the secret information used in ciphers, the key, which is typically much shorter.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Codress message在军事密码学中,地址消息是一种加密消息,其地址也被加密。这样做通常是为了防止流量分析。这篇与密码学相关的文章是一个小作品。您可以通过添加缺失的信息来帮助维基百科。
In military cryptography, a codress message is an encrypted message whose address is also encrypted. This is usually done to prevent traffic analysis. This cryptography-related article is a stub. You can help Wikipedia by adding missing information.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Communications security通信安全是防止未经授权的拦截者以可理解的形式访问电信的学科,同时仍将内容传递给预期的接收者。在北大西洋公约组织文化中,包括美国国防部文化中,通常用缩写 COMSEC 来指代。该领域包括 COMSEC 设备和相关密钥材料的密码安全、传输安全、排放安全和物理安全。 COMSEC 用于保护军事通信网络上的机密和非机密流量,包括语音、视频和数据。它可用于模拟和数字应用以及有线和无线链路。
Communications security is the discipline of preventing unauthorized interceptors from accessing telecommunications in an intelligible form, while still delivering content to the intended recipients. In the North Atlantic Treaty Organization culture, including United States Department of Defense culture, it is often referred to by the abbreviation COMSEC. The field includes cryptographic security, transmission security, emissions security and physical security of COMSEC equipment and associated keying material. COMSEC is used to protect both classified and unclassified traffic on military communications networks, including voice, video, and data. It is used for both analog and digital applications, and both wired and wireless links.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Completeness (cryptography)在密码学中,如果每个输出位的值取决于所有输入位,则布尔函数被认为是完整的。这是加密密码中理想的属性,因此,如果输入(明文)的一位发生更改,则输出(密文)的每一位发生更改的概率平均为 50%。说明为什么这是好的最简单方法如下:考虑一下,如果我们更改 8 字节明文的最后一个字节,它只会对密文的第 8 个字节产生任何影响。这意味着,如果攻击者猜测 256 个不同的明文-密文对,他将始终知道我们发送的每个 8 字节序列的最后一个字节(实际上占所有数据的 12.5%)。
In cryptography, a boolean function is said to be complete if the value of each output bit depends on all input bits. This is a desirable property to have in an encryption cipher, so that if one bit of the input (plaintext) is changed, every bit of the output (ciphertext) has an average of 50% probability of changing. The easiest way to show why this is good is the following: consider that if we changed our 8-byte plaintext's last byte, it would only have any effect on the 8th byte of the ciphertext. This would mean that if the attacker guessed 256 different plaintext-ciphertext pairs, he would always know the last byte of every 8byte sequence we send (effectively 12.5% of all our data).
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗ 密码学Computer security计算机安全(也称为网络安全、数字安全或信息技术 (IT) 安全)是信息安全领域的一个子学科。它的重点是保护计算机软件、系统和网络免受威胁,这些威胁可能导致未经授权的信息泄露、盗窃或硬件、软件或数据损坏,以及它们提供的服务的中断或误导。计算机安全的日益重要反映了对计算机系统、互联网和不断发展的无线网络标准的日益依赖。随着智能设备(包括智能手机、电视和物联网 (IoT) 的其他组件)的激增,这种依赖也在扩大。随着数字基础设施越来越融入日常生活,网络安全已成为一个关键问题。
Computer security (also cybersecurity, digital security, or information technology (IT) security) is a subdiscipline within the field of information security. It focuses on protecting computer software, systems, and networks from threats that can lead to unauthorized information disclosure, theft, or damage to hardware, software, or data, as well as to the disruption or misdirection of the services they provide. The growing significance of computer security reflects the increasing dependence on computer systems, the Internet, and evolving wireless network standards. This reliance has expanded with the proliferation of smart devices, including smartphones, televisions, and other components of the Internet of things (IoT). As digital infrastructure becomes more embedded in everyday life, cybersecurity has emerged as a critical concern.
来源、授权与使用说明
维基百科条目作者 · 获取于 2026-10-04 · CC BY-SA 4.0。简介经过纯文本提取与截取;两个语言版本的内容侧重可能不同。用于概念速查,不替代标准原文。 本条中文为英文百科简介的机器辅助翻译,请结合英文原文核对专业术语。
查看内容许可 ↗