Cryptography protects users by providing functionality for the encryption of data and authentication of other users. This technology lets the receiver of an electronic message verify the sender, ensures that a message can be read only by the intended person, and assures the recipient that a message has not be altered in transit. Classical cryptanalysis involves an interesting combination of ana...

This paper proposes a zero-distortion authentication watermarking to produces a watermarked signal. With the same decoder, the watermarked signal has the same quality as the original one. To this end, the scheme replaces the original signal with its equivalence so as to embed authentication message. We employ this concept to authenticate palette images by regulating the palette. Because the vis...

E-mail brings us lots of conveniences. Especially with help of PGP and S/MIME, it gives both confidentiality and message/origin authentication. However, in some cases for strong privacy, a message sender will not want to let others know even the fact that he sent a message to a recipient. Very recently, Harn and Ren proposed a fully deniable authentication scheme for E-mail where a sender can r...

Multi-receiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we constructed one multi-receiver authentication codes from pseudo-symplectic geometry over finite fields. The parameters and the probabilities of deceptions of this codes are also computed.

This document is one of a series concerned with defining a roadmap of protocol specification work for the use of modern cryptographic mechanisms and algorithms for message authentication in routing protocols. In particular, it defines the framework for a key management protocol that may be used to create and manage session keys for message authentication and integrity.

The cryptographic algorithms employed in Internet security must be able to handle packets which may vary in size over a large range. Most of the cryptographic hash algorithms process messages by partitioning them into large blocks. Due to this fact the messages have to be prepared by padding the required amount of zero bits to get an integer number of blocks. This process contributes a consider...

We demonstrate how adversaries with large computing resources can break Quantum Key Distribution (QKD) protocols which employ a particular message authentication code suggested previously. This authentication code, featuring low key consumption, is not Information-Theoretically Secure (ITS) since for each message the eavesdropper has intercepted she is able to send a different message from a se...