The code equivalence problem is to decide whether two linear codes over Fq are identical up to a linear isometry of the Hamming space. In this paper, we review the hardness of code equivalence over Fq due to some recent negative results and argue on the possible implications in code-based cryptography. In particular, we present an improved version of the three-pass identification scheme of Gira...

1 Summary of the review In this review I present the book " Post-Quantum Cryptography ". This volume gives a detailed, technical-level treatment of the post-quantum cryptography universe. 2 Summary of the book When (if?) quantum computers of a big enough size will be available, most of the current public-key cryptography primitives based on number theory will be vulnerable. The " next generatio...

Cryptography relies on Mathematics in all its aspects, beginning from the constructions relying on various mathematical theories, continuing with security evaluation of cryptographic systems, and proving their security, and finally ending in implementation. Recently, new security threats are posed by the emerging quantum computing technology. Specifically, quantum algorithms can break some publ...

Counterfeit production is a threat for every genuine business causing damage to their brand image and stealing revenues. The aim of this paper topresenta novel method prevent counterfeit products using cryptography, QR code webservice. requires that original product manufacturer obtain cryptographic key pair, securely store private publish public on website as code. needs print unique item pack...

This paper introduces a constant-time implementation for a quasi-cyclic moderate-density-parity-check (QC-MDPC) code based encryption scheme. At a 2 security level, the software takes 14 679 937 Cortex-M4 and 1 560 072 Haswell cycles to decrypt a short message, while the previous records were 18 416 012 and 3 104 624 (non-constant-time) cycles. Such speed is achieved by combining two techniques...

In [1], four different DRBGs are recommended for cryptographic purpose. Each generator is based on some underlying cryptographic concept. The article examines each of the concept to determine what are the necessary and sufficient conditions for the DRBG to be secured in its generation process. In addition, the effects of failure of typical cryptographic requirements of each underlying concept a...

In this paper we present CAOVerif, a deductive verification tool for the CAO language. CAO is a domain-specific language for cryptography with interesting challenges for formal verification. It introduces not only a rich mathematical type system, but it also offers cryptography-oriented language constructions. The toolchain encompasses different transformations of the source code in order to ge...