Symmetric-key algorithms[a] are algorithms for cryptography that use the same cryptographic keys for both encryption of plaintext and decryption of ciphertext. The keys may be identical or there may be a simple transformation to go between the two keys.[1] The keys, in practice, represent a shared secret between two or more parties that can be used to maintain a private information link.[2] This requirement that both parties have access to the secret key is one of the main drawbacks of symmetric key encryption, in comparison to public-key encryption (also known as asymmetric key encryption).[3][4]
Types[edit]
A Temporary Symmetric Key Example. Temporary symmetric keys are created the same way you would create any other temporary object. You just designate the key as temporary by prefixing its name with a # sign.
Symmetric-key encryption can use either stream ciphers or block ciphers.[5]
Symmetric Key Generation
Generating Keys for Encryption and Decryption.; 3 minutes to read +7; In this article. Creating and managing keys is an important part of the cryptographic process. Symmetric algorithms require the creation of a key and an initialization vector (IV). The key must be kept secret from anyone who should not decrypt your data. In the CREATE CERTIFICATE and CREATE ASYMMETRIC KEY statements that clause was optional. Omitting it causes the new key to be protected by the database master key. With symmetric keys, that is not an option. A symmetric key has to be protected by either a password, a certificate, an asymmetric key or another symmetric key.
Implementations[edit]
Examples of popular symmetric-key algorithms include Twofish, Serpent, AES (Rijndael), Blowfish, CAST5, Kuznyechik, RC4, DES, 3DES, Skipjack, Safer+/++ (Bluetooth), and IDEA.[6]
Cryptographic primitives based on symmetric ciphers[edit]
Symmetric ciphers are commonly used to achieve other cryptographic primitives than just encryption.[citation needed]
Encrypting a message does not guarantee that this message is not changed while encrypted. Hence often a message authentication code is added to a ciphertext to ensure that changes to the ciphertext will be noted by the receiver. Message authentication codes can be constructed from symmetric ciphers (e.g. CBC-MAC).[citation needed]
However, symmetric ciphers cannot be used for non-repudiation purposes except by involving additional parties.[7] See the ISO/IEC 13888-2 standard.
Another application is to build hash functions from block ciphers. See one-way compression function for descriptions of several such methods.
Construction of symmetric ciphers[edit]
Many modern block ciphers are based on a construction proposed by Horst Feistel. Feistel's construction makes it possible to build invertible functions from other functions that are themselves not invertible.[citation needed]
Security of symmetric ciphers[edit]
Symmetric ciphers have historically been susceptible to known-plaintext attacks, chosen-plaintext attacks, differential cryptanalysis and linear cryptanalysis. Careful construction of the functions for each round can greatly reduce the chances of a successful attack.[citation needed]
Key management[edit]Key establishment[edit]![]()
Symmetric-key algorithms require both the sender and the recipient of a message to have the same secret key.All early cryptographic systems required one of those people to somehow receive a copy of that secret key over a physically secure channel.
Nearly all modern cryptographic systems still use symmetric-key algorithms internally to encrypt the bulk of the messages, but they eliminate the need for a physically secure channel by using DiffieâHellman key exchange or some other public-key protocol to securely come to agreement on a fresh new secret key for each message (forward secrecy).
Key generation[edit]
When used with asymmetric ciphers for key transfer, pseudorandom key generators are nearly always used to generate the symmetric cipher session keys. However, lack of randomness in those generators or in their initialization vectors is disastrous and has led to cryptanalytic breaks in the past. Therefore, it is essential that an implementation use a source of high entropy for its initialization.[8][9][10]
Reciprocal cipher[edit]
A reciprocal cipher is a cipher where, just as one enters the plaintext into the cryptography system to get the ciphertext, one could enter the ciphertext into the same place in the system to get the plaintext. A reciprocal cipher is also sometimes referred as self-reciprocal cipher.
Practically all mechanical cipher machines implement a reciprocal cipher, a mathematical involution on each typed-in letter.Instead of designing two kinds of machines, one for encrypting and one for decrypting, all the machines can be identical and can be set up (keyed) the same way.[11]
Examples of reciprocal ciphers include:
Practically all modern ciphers can be classified as either a stream cipher, most of which use a reciprocol XOR cipher combiner, or a block cipher, most of which use use Feistel cipher or LaiâMassey scheme with a reciprocal transformation in each round.
![]() Notes[edit]
References[edit]
Sql Symmetric Key
Retrieved from 'https://en.wikipedia.org/w/index.php?title=Symmetric-key_algorithm&oldid=948081123'
How to Generate a Symmetric Key by Usingthe pktool CommandHow To Generate Symmetric Key
Some applications require a symmetric key for encryption and decryptionof communications. In this procedure, you create a symmetric key and storeit.
Example 14â5 Creating a DES Key by Using the pktool Command
In the following example, a secret key for the DES algorithm is created.The key is stored in a local file for later decryption. The command protectsthe file with 400 permissions. When the key is created,the print=y option displays the generated key in the terminalwindow.
DES mechanisms use a 64-bit key. The user who owns the keyfile retrievesthe key by using the od command.
How To Generate A Symmetric KeyComments are closed.
|
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |