Authentication watermarking is a hidden data inserted into an image, in order to detect any alterations. It seems to be almost impossible to design a really secure authentication watermarking without making use of the solid cryptography theory and techniques. In a cryptography-based authentication watermarking, a message authentication code (or digital signature) of the whole image is computed ...

Code equivalence is a well-known concept in coding theory. Recently, literature saw an increased interest this notion, due to the introduction of protocols based on hardness finding between two linear codes. In paper, we analyze security code equivalence, with special focus hardest instances, cryptographic usage. Our work stems from thorough review existing literature, identifies various types ...

In this paper we propose an e-voting authentication scheme combined with QR-codes and visual cryptography. We focus on the usability, in order to supply voters with less technical experience with a usable scheme. The only requirement is that the user needs to handle a device containing a QR-code reader, most probably a smartphone. This approach is based on visual cryptography as the work horse:...

One of the huge problems for security in sensor networks is the lack of resources. Based on microcontroller architectures with severe limited computing abilities, strong public-key cryptography is commonly seen as infeasible on sensor devices. In contrast to this prejudice this paper presents an efficient and lightweight implementation of public-key cryptography algorithms relying on elliptic c...

We intend to narrow the gap between concrete implementations and verified models of cryptographic protocols. We consider protocols implemented in F#, a variant of ML, and verified using CryptoVerif, Blanchet’s protocol verifier for computational cryptography. We experiment with compilers from F# code to CryptoVerif processes, and from CryptoVerif declarations to F# code. We present two case stu...

For thousands of years, code-makers and code-breakers have been competing for supremacy. Their arsenals may soon include a powerful new weapon: quantum mechanics. Cryptography — the art of code-making — has a long history of military and diplomatic applications, dating back to the Babylonians. In World World Two, the Allies' feat of breaking the legendary German code, Enigma, contributed greatl...

Public-key cryptosystems nowadays are mostly based on number theoretic problems like factorization (RSA) and the discrete logarithm problem (Elgamal). However, such systems can be broken with quantum computers by applying Shor’s algorithms [1] for solving both problems, factorization and discrete logarithm, in polynomial time. Hence there is a need for post-quantum cryptography, i.e., methods r...

This note presents variations on the Fibonacci universal code, that may also be called the Gopala-Hemachandra code, that can have applications in source coding as well as in cryptography.

The development of military (state) control systems in modern conditions hybrid warfare requires the possibility rapid expansion both functionality and scaling physical logical basis management, increasing range digitization use civilian communication channels to manage troops weapons. Not only computing power enemy, means suppressing / or blocking system, but also quantum technologies that pla...

For thousands of years, code-makers and code-breakers have been competing for supremacy. Their arsenals may soon include a powerful new weapon: quantum mechanics. Cryptography — the art of code-making — has a long history of military and diplomatic applications, dating back to the Babylonians. In World World Two, the Allies' feat of breaking the legendary German code, Enigma, contributed greatl...