The Experts below are selected from a list of 2862 Experts worldwide ranked by ideXlab platform
Morris J Dworkin - One of the best experts on this subject based on the ideXlab platform.
-
recommendation for block cipher modes of operation galois counter mode gcm and gmac
Special Publication (NIST SP) - 800-38D, 2007Co-Authors: Morris J DworkinAbstract:This Recommendation specifies the Galois/Counter Mode (GCM), an algorithm for authenticated encryption with associated data, and its specialization, GMAC, for generating a Message Authentication Code (MAC) on data that is not encrypted. GCM and GMAC are modes of operation for an underlying approved symmetric key block cipher.
-
sp 800 38d recommendation for block cipher modes of operation galois counter mode gcm and gmac
2007Co-Authors: Morris J DworkinAbstract:This Recommendation specifies the Galois/Counter Mode (GCM), an algorithm for authenticated encryption with associated data, and its specialization, GMAC, for generating a Message Authentication Code (MAC) on data that is not encrypted. GCM and GMAC are modes of operation for an underlying approved symmetric key block cipher.
-
sp 800 38b recommendation for block cipher modes of operation the cmac mode for Authentication
2005Co-Authors: Morris J DworkinAbstract:This Recommendation specifies a Message Authentication Code (MAC) algorithm based on a symmetric key block cipher. This block cipher-based MAC algorithm, called CMAC, may be used to provide assurance of the authenticity and, hence, the integrity of binary data.
-
sp 800 38c recommendation for block cipher modes of operation the ccm mode for Authentication and confidentiality
2004Co-Authors: Morris J DworkinAbstract:This Recommendation defines a mode of operation, called Counter with Cipher Block Chaining-Message Authentication Code (CCM), for a symmetric key block cipher algorithm. CCM may be used to provide assurance of the confidentiality and the authenticity of computer data by combining the techniques of the Counter (CTR) mode and the Cipher Block Chaining-Message Authentication Code (CBC-MAC) algorithm.
Phillip Rogaway - One of the best experts on this subject based on the ideXlab platform.
-
The Security of the Cipher Block Chaining Message Authentication Code
Journal of Computer and System Sciences, 2000Co-Authors: Mihir Bellare, Joe Kilian, Phillip RogawayAbstract:Let F be some block cipher (eg., DES) with block length l. The cipher block chaining Message Authentication Code (CBC MAC) specifies that an m-block Message x=x1?xm be authenticated among parties who share a secret key a for the block cipher by tagging x with a prefix of ym, where y0=0l and yi=Fa(mi?yi?1) for i=1, 2, ?, m. This method is a pervasively used international and U.S. standard. We provide its first formal justification, showing the following general lemma: cipher block chaining a pseudorandom function yields a pseudorandom function. Underlying our results is a technical lemma of independent interest, bounding the success probability of a computationally unbounded adversary in distinguishing between a random ml-bit to l-bit function and the CBC MAC of a random l-bit to l-bit function.
-
bucket hashing and its application to fast Message Authentication
International Cryptology Conference, 1995Co-Authors: Phillip RogawayAbstract:We introduce a new technique for generating a Message Authentication Code (MAC). At its center is a simple metaphor: to (noncryptographically) hash a string x, cast each of its words into a small number of buckets; xor the contents of each bucket; then collect up all the buckets' contents. Used in the context of Wegman-Carter Authentication, this style of hash function provides the fastest known approach to software Message Authentication.
David Mcgrew - One of the best experts on this subject based on the ideXlab platform.
-
a high speed hardware architecture for universal Message Authentication Code
IEEE Journal on Selected Areas in Communications, 2006Co-Authors: Bo Yang, Ramesh Karri, David McgrewAbstract:We present an architecture level optimization technique called divide-and-concatenate based on two observations: 1) the area of an array multiplier and its associated data path decreases quadratically and their delay decreases linearly as their operand size is reduced and 2) in universal hash functions and their associated Message Authentication Codes, two one-way hash functions are equivalent if they have the same collision probability property. In the proposed approach, we divide a 2w-bit data path (with collision probability 2-2w) into two w-bit data paths (each with collision probability 2-w) and concatenate their results to construct an equivalent 2w-bit data path (with a collision probability 2-2w ). We applied this technique on NH universal hash, a universal hash function that uses multiplications and additions. We implemented the straightforward 32-bit pipelined NH universal hash data path and the divide-and-concatenate architecture that uses four equivalent 8-bit divide-and-concatenate NH universal hash data paths on a Xilinx Virtex II XC2VP7-7 field programmable gate array (FPGA) device. This divide-and-concatenate architecture yielded a 94% increase in throughput with only 40% hardware overhead. Finally, the implementation of universal Message Authentication Code (UMAC) with collision probability 2-32 using the divide-and-concatenate NH hash as a building block yielded a throughput of 79.2 Gb/s with only 3840 Virtex II XC2VP7-7 FPGA slices
-
the use of galois Message Authentication Code gmac in ipsec esp and ah
RFC, 2006Co-Authors: J. Viega, David McgrewAbstract:This memo describes the use of the Advanced Encryption Standard (AES) Galois Message Authentication Code (GMAC) as a mechanism to provide data origin Authentication, but not confidentiality, within the IPsec Encapsulating Security Payload (ESP) and Authentication Header (AH). GMAC is based on the Galois/Counter Mode (GCM) of operation, and can be efficiently implemented in hardware for speeds of 10 gigabits per second and above, and is also well-suited to software implementations. [STANDARDS-TRACK]
Mullapathi Farooq - One of the best experts on this subject based on the ideXlab platform.
-
Analysis and Implementation of Message Authentication Code (MAC) Algorithms for GOOSE Message Security
IEEE Access, 2019Co-Authors: S. M. Suhail Hussain, Mullapathi FarooqAbstract:There is growing awareness towards cybersecurity threats in power systems. IEC 61850 standard facilitates communication between different Intelligent Electronic devices (IEDs) and eases interoperable operation with set data and Message structures. An unwanted consequence of this standardized communication over ethernet is increased viability to cyber threats. The IEC 62351-6 standard stipulates the use of digital signatures for ensuring integrity in IEC 61850 Message exchanges. However, the digital signatures result in higher computational times which makes it very difficult to use for Generic Object-Oriented Substation Events (GOOSE) Messages. This short communication article proposes implementation of the Message Authentication Code (MAC) algorithms, such as Hash-based Message Authentication Code (HMAC) and Advanced Encryption Standard-Galois Message Authentication Code (AES-GMAC), for GOOSE Message integrity. Lab tests are run to observe their timing performances and feasibility for GOOSE.
S. M. Suhail Hussain - One of the best experts on this subject based on the ideXlab platform.
-
Analysis and Implementation of Message Authentication Code (MAC) Algorithms for GOOSE Message Security
IEEE Access, 2019Co-Authors: S. M. Suhail Hussain, Mullapathi FarooqAbstract:There is growing awareness towards cybersecurity threats in power systems. IEC 61850 standard facilitates communication between different Intelligent Electronic devices (IEDs) and eases interoperable operation with set data and Message structures. An unwanted consequence of this standardized communication over ethernet is increased viability to cyber threats. The IEC 62351-6 standard stipulates the use of digital signatures for ensuring integrity in IEC 61850 Message exchanges. However, the digital signatures result in higher computational times which makes it very difficult to use for Generic Object-Oriented Substation Events (GOOSE) Messages. This short communication article proposes implementation of the Message Authentication Code (MAC) algorithms, such as Hash-based Message Authentication Code (HMAC) and Advanced Encryption Standard-Galois Message Authentication Code (AES-GMAC), for GOOSE Message integrity. Lab tests are run to observe their timing performances and feasibility for GOOSE.