Data-driven Block Ciphers for Fast Telecommunication Systems

Front Cover
CRC Press, Dec 14, 2007 - Computers - 208 pages
The Most Progressive and Complete Guide to DDO-Based Ciphers

Developers have long recognized that ciphers based on Permutation Networks (PNs) and Controlled Substitution-Permutation Networks (CSPNs) allow for the implementation of a variety of Data Driven Operations (DDOs). These DDOs can provide fast encryption without incurring excessive

From inside the book

Selected pages

Contents

Chapter 1 Short Introduction to Cryptography
1
Chapter 2 Permutation Networks as Primitive of DataDriven Ciphers
31
Chapter 3 DataDriven Primitives and Ciphers Based on Controlled SubstitutionPermutation Networks
69
Chapter 4 Switchable DataDependent Operations
107
Chapter 5 DataDriven Ciphers Suitable for Software Implementation
157
References
177
Index
183
Back cover
187
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page ii - A Practical Guide to Content Delivery Networks Gilbert Held ISBN: 0-8493-3649-X Resource, Mobility, and Security Management in Wireless Networks and Mobile Communications Van Zhang, Honglin Hu, and Masayuki Fujise ISBN: 0-8493-8036-7 Security in Distributed, Grid, Mobile, and Pervasive Computing Yang Xiao ISBN: 0-8493-7921-0 TCP Performance over UMTS-HSDPA Systems Mohamad Assaad and Djamal Zeghlache ISBN: 0-8493-6838-3 Testing Integrated QoS of VoIP: Packets to Perceptual Voice Quality Vlatko Lipovac...
Page 6 - N, O, P, Q, R, S, T, U, V, X, Y, Z. a, b, c, d, e, f, g, h, i, j, k, 1, m, n, o, p, q, r, s, t, u, v, x, y, x.
Page 6 - P r s t u V w X y z a b c d e f g h i j k 1 m n o P q s t u V w X y z a b c d e f g h i j k 1 m n o P q r t u V w X y z a b c d e f g h i j k 1 m n o P q r s u V w X y z a b c d e f g h i j k 1 m n o P q r s t V w X y z a b c d e f g h i j k 1 m n...
Page 3 - H; I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z a, b, c, d, o, f, g, h, i...
Page 6 - These were, — a, b, c, d, e, f, g, h, i, k, 1, m, n, o, p, q, r, s, t, u, x. y...
Page 3 - ASCII value 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127...
Page 6 - W) (a) (b) (c) (d) (e) (f) (8) (h) (i) (J) (k) (1) (m) (n...
Page 6 - ... 135 136 137 140 141 142 143 144 145 146 147 150 151 152 153 154 155 156 157 160 161 162 163 164 165...
Page 6 - K, L, M, N, O, P, Q. S, T, U, V, W, X, Y, Z a, b, c, d, e,f, g, *, ij, k, /, m, n, a, f, q, r, v M.
Page 9 - A hash function is a computationally efficient function mapping binary strings of arbitrary length to binary strings of some fixed length, called hash-values.

About the author (2007)

Moldovyan, Nikolai; Moldovyan, Alexander A.

Bibliographic information