Information Technology Reference
In-Depth Information
as the authentication, the password storage mechanisms, the Digital Signal Standard
(DSS), the Transport Layer Security (TLS), the Internet Protocol Security (IPSec),
the Random number generation algorithms; etc. Several Lightweight cryptographic
algorithms are presented. Lightweight cryptographic algorithms have been designed
to
fit with a very compact hardware. Each algorithm can be adapted for a speci
c
field (Korb and Noll 2010 ; Bogdanov et al. 2013 ).
SHA family: Secure SHA Algorithms are a family of Hash Algorithms pub-
lished by NIST since 1993. SHA has many derivative standards such as SHA-0,
SHA-1, SHA-3
￿
MDA/MD5/MD6: Message-Digest Algorithm is a family of broadly used
cryptographic hash function developed by Ronald Rivest that produces a 128-bit
for MD4 and MD5, 256-bit for MD6.
￿
Quark: Family of cryptographic functions designed for resource-constrained
hardware environments.
￿
CubeHash: A very simple cryptographic hash function designed in University of
Illinois at Chicago, Department of Computer Science.
￿
￿
Photon: A lightweight hash function designed for very constrained devices.
￿
SQUASH: Not collision resistant, suitable for RFID applications.
According to its complexity, Quark presents the most appropriate algorithm to
evaluate the performance of the soft-core FPGA processor architecture. Quark can
minimize area and power consumption, it offers strong security guarantees. These
Hash algorithms that are ef
ciently implemented in low cost embedded devices are
important components for securing new applications in ubiquitous computing.
Quark Hash algorithm is a family of lightweight cryptographic
algorithms
designed for resource-constrained hardware environments, as RFID tags. It com-
bines a number of innovations that make it unique and optimized. In the design of
Quark, designers opt for an algorithm based on bit shift. It combines a sponge
construction with a capacity e equal to the digest length n, and a core permutation
inspired by preceding primitives. Quark algorithm proposes three instances: u-
Quark, d-Quark and s-Quark. Quark is a family of cryptographic
sponge
func-
tions intended for resource-constrained hardware environments (Bogdanov et al.
2013 ). It minimizes area and power consumption, yet offers strong security guar-
antees.Quark function includes four functions: (1) permute function, (2) init func-
tion, (3) update function and (4)
sponge
final function. These instances are parameterized
by a rate r, a capacity c, an output length n and a b-bit permutation (b = r + c).
Table 5 demonstrates the parameters of each instance of the Quark algorithms.
Table 5 Parameters of Quark hash algorithms instance
Rate (r)
Capacity (c)
With (b)
Digest (n)
u-Quark
8
128
136
136
d-Quark
16
160
176
176
s-Quark
32
224
256
256
Search WWH ::




Custom Search