RSA Cryptosystem ElGamal Cryptosystem Messey Omura Cryptosystem Knapsack Cryptosystem Construction of Knapsack Cryptosystem Quadratic Residue Cryptosystem Hybrid Cryptosystem: Diffie Hellman’s key Exchange Digital Signatures A Classification of Digital Signature Schemes Digital Signature Schemes with Appendix Digital Signature Schemes with Message Recovery RSA Signature Scheme Feige– Fiat – Sha...

We consider the problem of proving that a user has selected and correctly employed a truly random seed in the generation of her RSA key pair. This task is related to the problem of key validation, the process whereby a user proves to another party that her key pair has been generated securely. The aim of key validation is to pursuade the verifying party that the user has not intentionally weake...

In cloud, there is an important functionality called Data sharing. Data sharing is also concerned about the security, efficiency and flexibility for the data to share in the cloud storage. The capacity of selectively sharing encrypted data with different users via public cloud server may great ease security concerned over inattentive data leaks in the cloud. The key challenging of designing enc...

Unlike SET (Secure Electronic Transaction) protocol. This paper proposes an ASEP (Advanced Secure Electronic Payment) protocol, which uses ECC (Elliptic Curve Cryptosystem with F2 m not Fp) [1, 2, 3], SHA (Secure Hash Algorithm) and 3BC (Block Byte Bit Cipher) instead of RSA and DES. To improve the strength of encryption and the speed of processing, the public key and the private key of ECC are...

0. Introduction 1. Description of NTRU 1.1. Notation 1.2. Key Creation 1.3. Encryption 1.4. Decryption 1.5. Why Decryption Works 1.6. Parameter choices notation and a norm estimate 1.7. Sample spaces 1.8. A Decryption Criterion 2. Attributes and Advantages of NTRU 2.1. Theoretical Operating Speci cations 2.2. Comparison With Other PKCS's 3. Security Considerations 3.1. Security Analysis 3.2. Br...

The standard RSA cryptosystem is not semantically secure. Pointcheviel proposed a variant of RSA cryptosystem with the property of semantic security by introducing a new problem known as DRSA problem. He called it DRSA scheme. In this paper, we underlined a shortcoming of that scheme and proposed an alternative DRSA public key cryptosystem.

In this paper,we will present a new key exchange system based on linear algebra, which spend less operations but weaker in security than the DiffieHellman’s one.

Problem statement: In the last decade, dynamical systems were utilized to develop cryptosystems, which ushered the era of continuous value cryptography that transformed the practical region from finite field to real numbers. Approach: Taking the security threats and privacy issues into consideration, fractals functions were incorporated into public-key cryptosystem due to their complicated math...

In recent years the study of cryptosystem has shifted noticeably from symmetric to asymmetric key encryptions. One of the more intriguing issues of the research is NTRU encryption system, which is based on ring theory. The security of NTRU always depends on the lattices. Several studies have suggested that it is very difficult to know whether a polynomial is invertible or not. Nayak et al. intr...

In Crypto 97, a public key cryptosystem based on the closest vector problem was suggested by Goldreich, Goldwasser and Halevi [4]. In this paper, we propose a public key cryptosystem applying representations of polynomials to the GGH encryption scheme. Its key size is much smaller than the GGH system so that it is a quite practical and efficient lattice based cryptosystem.