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 an intrusion-resilient cryptosystem [10], two entities (a user and a base) jointly evolve a secret decryption key; this provides very strong protection against an active attacker who can break into the user and base repeatedly and even simultaneously. Recently, a construction of an intrusion-resilient public-key encryption scheme based on specific algebraic assumptions has been shown [6]. We...

A Sidon space is a subspace of an extension field over base in which the product any two elements can be factored uniquely, up to constants. This paper proposes new public-key cryptosystem multivariate type based on spaces, and has potential remain secure even if quantum supremacy attained. system, whose security relies hardness well-known MinRank problem, shown resilient several straightforwar...

The algorithms such as RSA, ElGamal and ECC work on integers. Commutative operations integer multiplication leave these vulnerable to attack by eavesdroppers. For this reason, experts develop the concept of non-commutative algebra in public key cryptosystem adding properties groups, semirings, semiring division, matrices matrix decomposition. However, generating process some cryptosystems is qu...

The McEliece cryptosystem is one of the best-known (classical) public-key cryptosystems, which is based on algebraic coding theory. In this paper, we present a quantum analogue of the classical McEliece cryptosystem. Our quantumMcEliece public-key cryptosystem is based on the theory of stabilizer codes and has the key generation, encryption and decryption algorithms similar to those in the clas...