HMAC is the most widely-deployed cryptographic-hash-function-based message authentication code. First, we describe a security issue that arises because of inconsistencies in the standards and the published literature regarding keylength. We prove a separation result between two versions of HMAC, which we denote HMAC and HMAC, the former being the real-world version standardized by Bellare et al...

At SAC 2009, Misoczki and Barreto proposed a new class of codes, which have parity-check matrices that are quasi-dyadic. A special subclass of these codes were shown to coincide with Goppa codes and those were recommended for cryptosystems based on error-correcting codes. Quasi-dyadic codes have both very compact representations and allow for efficient processing, resulting in fast cryptosystem...

In 2016, the National Institute of Standards and Technology (NIST) announced an open competition with goal finding standardizing suitable algorithms for quantum-resistant cryptography. This study presents a detailed, mathematically oriented overview round-three finalists NIST’s post-quantum cryptography standardization consisting lattice-based key encapsulation mechanisms (KEMs) CRYSTALS-Kyber,...

We document our development of a library for elliptic curve cryptography in JavaScript. We discuss design choices and investigate optimizations at various levels, from integer multiplication and field selection to various fixed-based EC point multiplication techniques. Relying on a small volume of public precomputed data, our code provides a speed-up of a factor 50 compared to previous existing...

This paper proposes the first code-based quantum immune sequential aggregate signature (SAS) scheme and proves security of proposed in random oracle model. Aggregate (AS) schemes allow a group potential signers to sign different messages respectively, all signatures those users on can be aggregated into single such that size is much smaller than total individual signatures. Because aggregation ...