Примеры использования Block cipher на Английском языке и их переводы на Русский язык
{-}
-
Official
-
Colloquial
In this mode, a block cipher is not an FPE.
Block cipher: symmetric encryption in blocks of bytes.
The previous hash value(Hi-1)is fed as the key to the block cipher.
The block cipher process 64 bits blocks in 56 rounds.
To encrypt anything larger than 128 bits, AES uses a block cipher mode.
There are many different AES block cipher modes that are part of the AES specification.
Consider a hash function which uses an AES-like substitution-permutation block cipher as its compression function.
As a result, the ECB block cipher mode is considered weak security and is not recommended for use.
The CSA algorithm is composed of two distinct ciphers: a block cipher and a stream cipher. .
The alternative, a block cipher, is limited to a certain block size usually 128 or 256 bits.
They proved that each of these techniques is as secure as the block cipher that is used to construct it.
Twofish is a symmetric key block cipher with a block size of 128 bits and key sizes up to 256 bits.
On March 21, 2012, the Chinese government published the industrial standard"GM/T 0002-2012 SM4 Block Cipher Algorithm", officially renaming SMS4 to SM4.
If the block cipher has different block and key sizes the hash value(Hi-1) will have the wrong size for use as the key.
In cryptography, a cipher block chaining message authentication code(CBC-MAC) is a technique for constructing a message authentication code from a block cipher.
In many cases it's best to choose a block cipher algorithm mode designed to combine secrecy and authentication, e.g., Galois/Counter Mode(GCM) and EAX.
Originally specified as IEEE Std 1619-2007,NIST added XTS to the list of AES block cipher modes in 2010.
This mode uses two keys: K{\displaystyle\scriptstyle K}is the key for the block cipher and F{\displaystyle\scriptstyle F} is an additional key of the same size as block. .
ISO/IEC 9797 Information technology- Security techniques- Data integrity mechanism using a cryptographic check function employing a block cipher algorithm.
However, in typical usage, a block cipher is used in a mode of operation that allows it to encrypt arbitrarily long messages, and with an initialization vector as discussed above.
In 2001, the US National Institute of Standards and Technology(NIST)revised its list of approved modes of operation by including AES as a block cipher and adding CTR mode in SP800-38A.
Some methods to turn any normal block cipher into a one-way compression function are Davies-Meyer, Matyas-Meyer-Oseas, Miyaguchi-Preneel(single-block-length compression functions) and MDC-2, MDC-4, Hirose double-block-length compressions functions.
It was discovered that a malicious client could crash a GNUTLS server and vice versa,by sending TLS records encrypted with a block cipher which contain invalid padding.
The cryptographic primitives used in Skype are: the AES block cipher, the RSA public-key cryptosystem, the ISO 9796-2 signature padding scheme, the SHA-1 hash function, and the RC4 stream cipher. .
As with all block ciphers, encryption and decryption of multiple blocks of data may be performed using a variety of modes of operation,which can generally be defined independently of the block cipher algorithm.
In cryptography, the Intel Cascaded Cipher, is a relatively new,high bandwidth block cipher, used as an optional component of the Output Content Protection DRM scheme of the Microsoft Windows Vista operating system.
Hellman's block cipher technique can be applied to a stream cipher by using the same idea of covering the N{\displaystyle N} points space through matrices obtained from multiple variants f i{\displaystyle f_{i}} of the function f{\displaystyle f} which is the mapping of internal states to output prefixes.
However, because the plaintext orciphertext is only used for the final XOR, the block cipher operations may be performed in advance, allowing the final step to be performed in parallel once the plaintext or ciphertext is available.
According to Hellman, if the block cipher at hand has the property that the mapping from its key to cipher text is a random permutation function f{\displaystyle f} over an N{\displaystyle N} point space, and if this f{\displaystyle f} is invertible, the tradeoff relationship becomes ways better: T M N{\displaystyle TM=N.
If there is a set M of allowed values within the domain of a pseudorandom permutation P(for exampleP can be a block cipher like AES), an FPE algorithm can be created from the block cipher by repeatedly applying the block cipher until the result is one of the allowed values within M.