In *Encyclopedia of Multimedia*, pages 135–136. Springer US, 2008. 00000

Paper abstract bibtex

Paper abstract bibtex

DefinitionData Encryption Standard (DES) and Advanced Encryption Standard (AES) are designed to encrypt a sequence of data elements.The DES algorithm is designed to encipher and decipher 64-bit blocks of data under control of a 64-bit key, of which 56 bits are randomly generated and used directly by the algorithm. Deciphering must be accomplished by using the same key as for enciphering. The deciphering process is the reverse of the enciphering process. A 64-bit block to be enciphered is subject to an initial permutation to form L0 and R0 (32 bits each, respectively the left and right half of the 64-bit block generated by the initial permutation), then to 16-iteration key-dependent computation, and the final result of the computation (L16 and R16) is subject to a permutation that is the inverse of the initial permutation. The 16 key-dependent computations can be simply defined as [1]: ...

@incollection{furht_data_2008-2, title = {Data {Encryption} {Standard} ({DES}) and {Advanced} {Encryption} {Standard} ({AES})}, copyright = {©2008 Springer-Verlag}, isbn = {978-0-387-74724-8 978-0-387-78414-4}, url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_287}, abstract = {DefinitionData Encryption Standard (DES) and Advanced Encryption Standard (AES) are designed to encrypt a sequence of data elements.The DES algorithm is designed to encipher and decipher 64-bit blocks of data under control of a 64-bit key, of which 56 bits are randomly generated and used directly by the algorithm. Deciphering must be accomplished by using the same key as for enciphering. The deciphering process is the reverse of the enciphering process. A 64-bit block to be enciphered is subject to an initial permutation to form L0 and R0 (32 bits each, respectively the left and right half of the 64-bit block generated by the initial permutation), then to 16-iteration key-dependent computation, and the final result of the computation (L16 and R16) is subject to a permutation that is the inverse of the initial permutation. The 16 key-dependent computations can be simply defined as [1]: ...}, language = {en}, urldate = {2016-05-03}, booktitle = {Encyclopedia of {Multimedia}}, publisher = {Springer US}, editor = {Furht, Borko}, year = {2008}, note = {00000}, pages = {135--136} }

Downloads: 0