A new cryptosystem based on spatial chaotic system

Encryption of images is different from that of texts due to some intrinsic features of images such as bulk data capacity and high redundancy, which is generally difficult to handle by traditional methods. This paper proposes a new spatial chaos system (SCS), which is investigated by conducting FIPS 140-1 statistic test, and is especially useful for encryption of digital images. It is shown how to adapt a two dimensional (2D) ergodic matrix obtained from SCS to permute the positions of image pixels and confuse the relationship between the cipher image and plain image simultaneously. Experimental results show that the performance and security of the proposed cryptographic system are better than those of existing lower dimensional chaotic cryptographic systems.     

Comment on “Image encryption with chaotically coupled chaotic maps”

This paper studies the security of a recently proposed chaos-based cryptosystem. It is shown that the encryption architecture of this cryptosystem exhibits some important problems related to its implementation and its robustness against noise. Some security problems are also highlighted.     

Tight Bounds on the Information Rate of Secret Sharing Schemes

A secret sharing scheme is a protocol by means of which a dealer distributes a secret s among a set of participants P in such a way that only qualified subsets of P can reconstruct the value of s whereas any other subset of P, non-qualified to know s, cannot determine anything about the value of the secret.In this paper we provide a general technique to prove upper bounds on the information rate of secret sharing schemes. The information rate is the ratio between the size of the secret and the size of the largest share given to any participant. Most of the recent upper bounds on the information rate obtained in the literature can be seen as corollaries of our result. Moreover, we prove that for any integer d there exists a d-regular graph for which any secret sharing scheme has information rate upper bounded by 2/(d+1). This improves on van Dijk's result dik and matches the corresponding lower bound proved by Stinson in [22].     

An algorithm for evaluation of discrete logarithms in some nonprime finite fields

In this paper we propose an algorithm for evaluation of logarithms in the finite fields , where the number has a small primitive factor . The heuristic estimate of the complexity of the algorithm is equal to
, where grows to , and is limited by a polynomial in . The evaluation of logarithms is founded on a new congruence of the kind of D. Coppersmith, , which has a great deal of solutions-pairs of polynomials of small degrees.

     

Evaluation of discrete logarithms in a group of

We show that to solve the discrete log problem in a subgroup of order of an elliptic curve over the finite field of characteristic one needs operations in this field.

     

New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes

This paper provides new combinatorial bounds and characterizations of authentication codes (A-codes) and key predistribution schemes (KPS). We first prove a new lower bound on the number of keys in an A-code without secrecy, which can be thought of as a generalization of the classical Rao bound for orthogonal arrays. We also prove a new lower bound on the number of keys in a general A-code, which is based on the Petrenjuk, Ray-Chaudhuri and Wilson bound for t-designs. We also present new lower bounds on the size of keys and the amount of users' secret information in KPS, the latter of which is accomplished by showing that a certain A-code is hiding inside any KPS.     

The eight variable homogeneous degree three bent functions

We determine the affine equivalence classes of the eight variable degree three homogeneous bent functions using a new algorithm. Our algorithm applies to general bent functions and can systematically determine the automorphism groups. We provide a partial verification of the enumeration of eight variable degree three homogeneous bent functions obtained by Meng et al. We determine the affine equivalence classes of these functions.     

Pairings for cryptographers

Many research papers in pairing-based cryptography treat pairings as a “black box”. These papers build cryptographic schemes making use of various properties of pairings. If this approach is taken, then it is easy for authors to make invalid assumptions concerning the properties of pairings. The cryptographic schemes developed may not be realizable in practice, or may not be as efficient as the authors assume.The aim of this paper is to outline, in as simple a fashion as possible, the basic choices that are available when using pairings in cryptography. For each choice, the main properties and efficiency issues are summarized. The paper is intended to be of use to non-specialists who are interested in using pairings to design cryptographic schemes.     

Lewis Carroll's ciphers: The literary connections

Charles L. Dodgson, who lectured on mathematics at Christ Church in Oxford University, constructed ciphers that were state of the art in his time. In poems and letters he demonstrated a great talent for creating acrostics and anagrams. In this paper I describe the ciphers closely and argue that their creation was intertwined with his word game inventions.