In 1984, Shamir proposed the concept of the ID-based cryptosystem (IBC). Instead of generating and publishing a public key for each user, the ID-based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct. In such a way, a large public key file is not required. ...

Abstract: In 1984, Shamir proposed the concept of the identity-based cryptosystem. Instead of generating and publishing a public key for each user, the identity-based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct.This paper proposes a new identitybased c...

Practical approaches to constructing public key cryptosystems secure against chosen ciphertext attacks were rst initiated by Damgard and further extended by Zheng and Seberry. In this paper we rst point out that in some cryptosystems proposed by Zheng and Seberry the method for adding authentication capability may fail just under known plaintext attacks. Next, we present a new method for immuni...

Montgomery multiplication is used to speed up modular multiplications involved in public-key cryptosystems. However, it requires conversion of parameters into N -residue representation. These additional pre-computations can be costly for low resource devices like smart cards. In this paper, we propose a new, more efficient method, suitable for smart card implementations of most of public-key cr...

In this paper, we propose a new fair blind signature scheme with message recovery using pairing-based self-certified public key cryptosystems. Preserving the merits inherent in pairing-based cryptosystems, it can possess fewer bits to achieve the higher security level. In addition, our new scheme has the advantage that the authentication of the public key can be accomplished with the verificati...

The demands of secured electronic transactions are increasing rapidly. Prime Field Elliptic curve cryptosystems (PFECC) are becoming most popular because of the reduced number of key bits required in comparison to other cryptosystems. PFECC is emerging as an attractive alternative to traditional public-key cryptosystems. PFECC offers equivalent security with smaller key sizes resulting in faste...

In 1978 Merkle and Hellman [11] proposed public key cryptosystems based on the knapsack problem. The simplest of these cryptosystems, the basic knapsack cryptosystem, works as follows. The public information is a set of nonnegative integers { a i : 1 ≤ i ≤ n } which are called knapsack weights. Messages are encrypted by first being broken into blocks (x 1 , ... ,x n ) of n binary digits. A bloc...

Wang and Hu [B. Wang and Y. Hu, Quadratic compact knapsack public-key cryptosystem, Comput. Math. Appl. 59 (1) (2010) 194–206] proposed a knapsack-type public-key cryptosystem by introducing an easy quadratic compact knapsack problem and then using the Chinese remainder theorem to disguise the easy knapsack instant. In this paper, we present a heuristic stereotyped message attack that allows th...

Combinatorial problems serve as an important resource for developing practical public key cryptosystems and several combinatorial cryptosystems have been proposed in the cryptographic community. In this paper, a combinatorial public key cryptosystem is proposed. The security of the proposed cryptosystem is dependent on a combinatorial problem involving matrices. The system features fast encrypt...

Algebraic key establishment protocols based on the difficulty of solving equations over algebraic structures are described as a theoretical basis for constructing public–key cryptosystems.