Security Articles from Wikipedia

More documents

Recommendations

Info

Advanced Encryption Standard 9 [24] "Index of formal scientific papers" (http:/ / cr. yp. to/ papers. html#cachetiming). Cr.yp.to. . Retrieved 2008-11-02. [25] Bruce Schneier. "AES Timing Attack" (http:/ / www. schneier. com/ blog/ archives/ 2005/ 05/ aes_timing_atta_1. html). . Retrieved 2007-03-17. [26] Dag Arne Osvik1; Adi Shamir2 and Eran Tromer2 (2005-11-20) (PDF). Cache Attacks and Countermeasures: the Case of AES (http:/ / www. wisdom. weizmann. ac. il/ ~tromer/ papers/ cache. pdf). . Retrieved 2008-11-02. [27] Dhiman Saha, Debdeep Mukhopadhyay, Dipanwita RoyChowdhury (PDF). A Diagonal Fault Attack on the Advanced Encryption Standard (http:/ / eprint. iacr. org/ 2009/ 581. pdf). . Retrieved 2009-12-08. [28] Endre Bangerter, David Gullasch and Stephan Krenn (2010). "Cache Games – Bringing Access-Based Cache Attacks on AES to Practice" (http:/ / eprint. iacr. org/ 2010/ 594. pdf). . [29] http:/ / news. ycombinator. com/ item?id=1937902 [30] http:/ / csrc. nist. gov/ groups/ STM/ cavp/ index. html [31] OpenSSL's Notes about FIPS certification (http:/ / openssl. org/ docs/ fips/ fipsnotes. html) [32] http:/ / csrc. nist. gov/ groups/ STM/ cavp/ documents/ aes/ KAT_AES. zip [33] "Performance Comparisons of the AES submissions" (http:/ / www. schneier. com/ paper-aes-performance. pdf) (PDF). 1999-02-01. . Retrieved 2010-12-28. References • Nicolas Courtois, Josef Pieprzyk, "Cryptanalysis of Block Ciphers with Overdefined Systems of Equations". pp267–287, ASIACRYPT 2002. • Joan Daemen, Vincent Rijmen, "The Design of Rijndael: AES - The Advanced Encryption Standard." Springer, 2002. ISBN 3-540-42580-2. • Christof Paar, Jan Pelzl, "The Advanced Encryption Standard" (http:/ / wiki. crypto. rub. de/ Buch/ sample_chapters. php), Chapter 4 of "Understanding Cryptography, A Textbook for Students and Practitioners". (companion web site contains online lectures on AES), Springer, 2009. External links • Reference implementation and derived code (http:/ / embeddedsw. net/ Cipher_Reference_Home. html) • FIPS PUB 197: the official AES standard (http:/ / csrc. nist. gov/ publications/ fips/ fips197/ fips-197. pdf) (PDF file) • AES algorithm archive information - (old, unmaintained) (http:/ / csrc. nist. gov/ archive/ aes/ rijndael/ wsdindex. html) • Animation of the AES encryption process (http:/ / www. formaestudio. com/ rijndaelinspector/ ) • Fully Functional Animation of the AES encryption process and key expansion (128 bits) - based on the work of Enrique Zabala (previous link) (http:/ / blog. ultrassecreto. com/ wp-content/ uploads/ 2009/ 06/ projetofinal. html) • Stick Figure Guide to AES (http:/ / www. moserware. com/ 2009/ 09/ stick-figure-guide-to-advanced. html), a layman introduction to cryptography and AES. • AES encryption is cracked (http:/ / www. theinquirer. net/ inquirer/ news/ 2102435/ aes-encryption-cracked/ ) • An in-depth description of the Advanced Encryption Standard and the maths behind it. C implementation provided. (http:/ / www. x-n2o. com/ aes-explained/ ) • Accelerating AES in software by using custom instructions (http:/ / www. ensilica. com/ pdfs/ A_study_of_aes_and_its_efficient_implementation_on_eSi_RISC_r1. 0. pdf) (PDF file) • AES VHDL implementation (pipelined and iterative) (http:/ / www. isaakian. com/ VHDL_page. html)
Block cipher 10 Block cipher In cryptography, a block cipher is a symmetric key cipher operating on fixed-length groups of bits, called blocks, with an unvarying transformation. A block cipher encryption algorithm might take (for example) a 128-bit block of plaintext as input, and output a corresponding 128-bit block of ciphertext. The exact transformation is controlled using a second input — the secret key. Decryption is similar: the decryption algorithm takes, in this example, a 128-bit block of ciphertext together with the secret key, and yields the original 128-bit block of plain text. A message longer than the block size (128 bits in the above example) can still be encrypted with a block cipher by breaking the message into blocks and encrypting each block individually. However, in this method all blocks are encrypted with the same key, which degrades security (because each repetition in the plaintext becomes a repetition in the ciphertext). To overcome this issue, modes of operation are used to make encryption probabilistic. Some modes of operation, despite the fact that their underlying implementation is a block cipher, allow the encryption of individual bits. The resulting cipher is called a stream cipher. An early and highly influential block cipher design was the Data Encryption Standard (DES), developed at IBM and published as a standard in 1977. A successor to DES, the Advanced Encryption Standard (AES), was adopted in 2001. Generalities A block cipher consists of two paired algorithms, one for encryption, E, and the other for decryption, E −1 . Both algorithms accept two inputs: an input block of size n bits and a key of size k bits, yielding an n-bit output block. For any one fixed key, decryption is the inverse function of encryption, so that for any block M and key K. M is termed the plaintext and C the ciphertext. For each key K, E K is a permutation (a bijective mapping) over the set of input blocks. Each key selects one permutation <strong>from</strong> the possible set of . The block size, n, is typically 64 or 128 bits, although some ciphers have a variable block size. 64 bits was the most common length until the mid-1990s, when new designs began to switch to the longer 128-bit length. One of several modes of operation is generally used along with a padding scheme to allow plaintexts of arbitrary lengths to be encrypted. Each mode has different characteristics in regard to error propagation, ease of random access and vulnerability to certain types of attack. Typical key sizes (k) include 40, [1] 56, [1] 64, 80, 128, [1] 192 and 256, 512, 1024, 2048, 4096 bits. As of 2011, 128 bits is normally taken as the minimum key length needed to prevent brute force attacks. For creating ciphers with arbitrary block sizes (or on domains that aren't powers of two) see Format-preserving encryption. Iterated block ciphers Most block ciphers are constructed by repeatedly applying a simpler function. This approach is known as iterated block cipher (see also product cipher). Each iteration is termed a round, and the repeated function is termed the round function; anywhere between 4 to 32 rounds are typical. Usually, the round function R takes different round keys K i as second input, which are derived <strong>from</strong> the original key: where is the plaintext and the ciphertext, with r being the round number. Frequently, key whitening is used in addition to this. At the beginning and the end, the data is modified with key material (often with XOR, but simple arithmetic operations like adding and subtracting are also used):
Page 1 and 2: Security Articles from Wikipedia PD
Page 3 and 4: Article Licenses License 180
Page 5 and 6: Advanced Encryption Standard 2 is a
Page 7 and 8: Advanced Encryption Standard 4 The
Page 9 and 10: Advanced Encryption Standard 6 Know
Page 11: Advanced Encryption Standard 8 Test
Page 15 and 16: Block cipher 12 Block ciphers and o
Page 17 and 18: Block cipher modes of operation 14
Page 27 and 28: Certificate authority 24 Certificat
Page 29 and 30: Certificate authority 26 Security T
Page 31 and 32: CMAC 28 The CMAC tag generation pro
Page 33 and 34: Cryptographic hash function 30 resi
Page 35 and 36: Cryptographic hash function 32 func
Page 37 and 38: Cryptographic hash function 34 Algo
Page 39 and 40: DiffieHellman key exchange 36 The s
Page 41 and 42: DiffieHellman key exchange 38 3. Bo
Page 43 and 44: DiffieHellman key exchange 40 Upon
Page 45 and 46: DiffieHellman key exchange 42 • C
Page 47 and 48: Digital signature 44 every paramete
Page 49 and 50: Digital signature 46 implemented. I
Page 51 and 52: Digital signature 48 authority). Fo
Page 53 and 54: Digital Signature Algorithm 50 Digi
Page 55 and 56: Digital Signature Algorithm 52 Sens
Page 57 and 58: HMAC 54 Implementation The followin
Page 59 and 60: HMAC 56 External links • FIPS PUB
Page 61 and 62: HTTP Secure 58 Browser integration
Page 63 and 64:
HTTP Secure 60 From an architectura
Page 65 and 66:
IPsec 62 IPsec Internet Protocol Se
Page 67 and 68:
IPsec 64 operates directly on top o
Page 69 and 70:
IPsec 66 Cryptographic algorithms C
Page 71 and 72:
IPsec 68 External links • All IET
Page 73 and 74:
Kerberos (protocol) 70 Kerberos (pr
Page 75 and 76:
Kerberos (protocol) 72 Client Authe
Page 77 and 78:
Kerberos (protocol) 74 External lin
Page 79 and 80:
Message authentication code 76 Mess
Page 81 and 82:
Message authentication code 78 Exte
Page 83 and 84:
NeedhamSchroeder protocol 80 S resp
Page 85 and 86:
Pretty Good Privacy 82 Pretty Good
Page 87 and 88:
Pretty Good Privacy 84 Security qua
Page 89 and 90:
Pretty Good Privacy 86 PGP 3 and fo
Page 91 and 92:
Pretty Good Privacy 88 based on sec
Page 93 and 94:
Public key certificate 90 Public ke
Page 95 and 96:
Public key certificate 92 (b) ensur
Page 97 and 98:
Public key certificate 94 Usefulnes
Page 99 and 100:
Public key infrastructure 96 As tim
Page 101 and 102:
Public key infrastructure 98 Extern
Page 103 and 104:
Public-key cryptography 100 In cont
Page 105 and 106:
Public-key cryptography 102 To achi
Page 107 and 108:
Public-key cryptography 104 using t
Page 109 and 110:
Public-key cryptography 106 Spreadi
Page 111 and 112:
Public-key cryptography 108 Externa
Page 113 and 114:
RSA (algorithm) 110 The RSA algorit
Page 115 and 116:
RSA (algorithm) 112 A working examp
Page 117 and 118:
RSA (algorithm) 114 Signing message
Page 119 and 120:
RSA (algorithm) 116 Side-channel an
Page 121 and 122:
RSA (algorithm) 118 • The PKCS #1
Page 123 and 124:
S/MIME 120 administrative overhead
Page 125 and 126:
Secure Electronic Transaction 122 T
Page 127 and 128:
Secure Shell 124 Usage SSH is typic
Page 129 and 130:
Secure Shell 126 • RFC 4462, Gene
Page 131 and 132:
Secure Shell 128 ability to multipl
Page 133 and 134:
Security service (telecommunication
Page 135 and 136:
Security service (telecommunication
Page 137 and 138:
SHA-1 134 SHA-1 SHA-1 General Desig
Page 139 and 140:
SHA-1 136 Applications SHA-1 forms
Page 141 and 142:
SHA-1 138 At the Rump Session of CR
Page 143 and 144:
SHA-1 140 a = temp Add this chunk's
Page 145 and 146:
SHA-1 142 • Xiaoyun Wang, Yiqun L
Page 147 and 148:
Stream cipher 144 Types of stream c
Page 149 and 150:
Stream cipher 146 Filter generator
Page 151 and 152:
Stream cipher 148 SNOW Pre-2003 Ver
Page 153 and 154:
Symmetric-key algorithm 150 Key gen
Page 155 and 156:
Transport Layer Security 152 TLS 1.
Page 157 and 158:
Transport Layer Security 154 • SS
Page 159 and 160:
Transport Layer Security 156 • Fi
Page 161 and 162:
Transport Layer Security 158 Length
Page 163 and 164:
Transport Layer Security 160 layer
Page 165 and 166:
Transport Layer Security 162 Suppor
Page 167 and 168:
Transport Layer Security 164 • RF
Page 169 and 170:
Transport Layer Security 166 Extern
Page 171 and 172:
X.509 168 Extensions informing a sp
Page 173 and 174:
X.509 170 00:d3:a4:50:6e:c8:ff:56:6
Page 175 and 176:
X.509 172 Exploits • MD2-based ce
Page 177 and 178:
X.509 174 External links • ITU-T
Page 179 and 180:
Article Sources and Contributors 17
Page 181 and 182:
Article Sources and Contributors 17
Page 183:
License 180 License Creative Common
show all

Security Articles from Wikipedia

Create successful ePaper yourself

Delete template?

Save as template?