Revisiting the Security of COMET Authenticated Encryption Scheme

Gueron, Shay; Jha, Ashwin; Nandi, Mridul

doi:10.1007/978-3-030-92518-5_1

Cited by 4 publications

(2 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the Counter mode provide only confi dentiality not message authentication. So GCM incorporates with Counter mode and builds on it by adding a Message Authentication Code (MAC) based on universal hashing provide message authentication that can keep up with our cipher [23]. It uses Polynomial hashing in the fi nite fi eld GF (2 n ) [24].…”

Section: Another Authentication Encryption Mode Is Cwc Combined Withmentioning

confidence: 99%

Redefining GCM’s resistance to cryptanalysis with offset mechanisms

Muhammad,

Yasir

2024

Trends Comput Sci Inf Technol

View full text Add to dashboard Cite

The research paper proposes an enhancement to the Galois/Counter Mode (GCM) of authenticated encryption by introducing an “offset” mechanism. This modification aims to improve privacy and resist differential cryptanalysis without significantly impacting the mode’s efficiency and simplicity. The improved GCM maintains its original features, such as minimal block cipher invocations, the use of a single cryptographic key, and efficient offset computation. It provides a detailed analysis of the operational framework, including the integration and calculation of offsets in encryption and decryption processes. By complicating the predictability of differential cryptanalysis through unique offsets, the paper asserts this enhancement significantly increases GCM’s security within a concrete security model. The discussion emphasizes the benefits of the offset-enhanced GCM over other modes, highlighting its suitability for high-speed, parallelizable cryptographic applications while bolstering resistance against cryptanalytic attacks.

show abstract

Section: Another Authentication Encryption Mode Is Cwc Combined Withmentioning

confidence: 99%

Redefining GCM’s resistance to cryptanalysis with offset mechanisms

Muhammad,

Yasir

2024

Trends Comput Sci Inf Technol

View full text Add to dashboard Cite

show abstract

“…Meanwhile, in [27], the authors used Artix-7, Spartan-6, and Cyclone-V FPGAs to implement the six NIST LWC round 2 candidate ciphers, SpoC, GIFT-COFB [28], COMET-AES [29], COMET-CHAM [29], Ascon [30], and Schwaemm and Esch [31]. Among all the schemes, it was clear that SpoC had the lowest area and power consumption, while Ascon had the highest throughput-to-area (TPA) ratio.…”

Section: Introductionmentioning

confidence: 99%

Analysis of Lightweight Cryptographic Algorithms on IoT Hardware Platform

2023

View full text Add to dashboard Cite

Highly constrained devices that are interconnected and interact to complete a task are being used in a diverse range of new fields. The Internet of Things (IoT), cyber-physical systems, distributed control systems, vehicular systems, wireless sensor networks, tele-medicine, and the smart grid are a few examples of these fields. In any of these contexts, security and privacy might be essential aspects. Research on secure communication in Internet of Things (IoT) networks is a highly contested topic. One method for ensuring secure data transmission is cryptography. Because IoT devices have limited resources, such as power, memory, and batteries, IoT networks have boosted the term “lightweight cryptography”. Algorithms for lightweight cryptography are designed to efficiently protect data while using minimal resources. In this research, we evaluated and benchmarked lightweight symmetric ciphers for resource-constrained devices. The evaluation is performed using two widely used platform: Arduino and Raspberry Pi. In the first part, we implemented 39 block ciphers on an ATMEGA328p microcontroller and analyzed them in the terms of speed, cost, and energy efficiency during encryption and decryption for different block and key sizes. In the second part, the 2nd-round NIST candidates (80 stream and block cipher algorithms) were added to the first-part ciphers in a comprehensive analysis for equivalent block and key sizes in the terms of latency and energy efficiency.

show abstract

Revisiting the Security of COMET Authenticated Encryption Scheme

Gueron

Jha

Nandi

2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Threshold Implementations have become a popular generic technique to construct circuits resilient against power analysis attacks. In this paper, we look to devise efficient threshold circuits for the lightweight block cipher family SKINNY. The only threshold circuits for this family are those proposed by its designers who decomposed the 8-bit S-box into four quadratic S-boxes, and constructed a 3-share byte-serial threshold circuit that executes the substitution layer over four cycles. In particular, we revisit the algebraic structure of the S-box and prove that it is possible to decompose it into (a) three quadratic S-boxes and (b) two cubic S-boxes. Such decompositions allow us to construct threshold circuits that require three shares and executes each round function in three cycles instead of four, and similarly circuits that use four shares requiring two cycles per round. Our constructions significantly reduce latency and energy consumption per encryption operation. Notably, to validate our designs, we synthesize our circuits on standard CMOS cell libraries to evaluate performance, and we conduct leakage detection via statistical tests on power traces on FPGA platforms to assess security. 1

show abstract

Revisiting the Security of COMET Authenticated Encryption Scheme

Cited by 4 publications

References 35 publications

Redefining GCM’s resistance to cryptanalysis with offset mechanisms

Redefining GCM’s resistance to cryptanalysis with offset mechanisms

Analysis of Lightweight Cryptographic Algorithms on IoT Hardware Platform

Revisiting the Security of COMET Authenticated Encryption Scheme

Contact Info

Product

Resources

About