نتایج جستجو برای: elliptic curve
تعداد نتایج: 155090 فیلتر نتایج به سال:
We describe an elliptic curve encryption scheme, PSEC (provably secure elliptic curve encryption scheme), which has two versions: PSEC-1 and PSEC-2. PSEC-1 is a public-key encryption system that uses the elliptic curve ElGamal trapdoor function and a random function (hash function). PSEC-2 is a public-key encryption system that uses the elliptic curve ElGamal trapdoor function, two random funct...
We describe a new version of the elliptic curve encryption schemes PSEC (Provably Secure Elliptic Curve). PSEC{3 is a public-key encryption system that uses the elliptic curve El Gamal trapdoor function and two random functions (hash functions) as well as any semantically secure symmetric encryption scheme, such as the one-time pad, or any classical block-cipher. Furthermore, we de ne a new pro...
To every non-singular elliptic curve (complex torus) we assign a C∗algebra Tθ = {u, v | vu = e uv} known as noncommutative torus. It is shown that morphisms of elliptic curves generate Morita equivalence of the corresponding noncommutative tori. Real number θ we call projective curvature attached to the elliptic curve. It is proved that projective curvatures of isomorphic elliptic curves are mo...
Signcryption is a new cryptographic approach which provides authentication and encryption simultaneously in a single logical step. The aim is to reduce the cost of signature-then-encryption approach. This cost includes computational cost and communication cost. Furthermore some signcryption schemes are based on RSA while some are based on elliptic curve. This paper provides a critical review of...
We present a pseudo random bit generator whose security is based on the intractability of the discrete logarithm problem in the group E(Fp) of rational points on an elliptic curve over a finite prime field Fp. The bit generator is implemented within the framework of the Java Cryptography Architecture (JCA). It uses an elliptic curve E chosen such that both E(Fp) and its twist E (Fp) are of prim...
Elliptic divisibility sequences are integer recurrence sequences, each of which is associated to an elliptic curve over the rationals together with a rational point on that curve. In this paper we present a higher-dimensional analogue over arbitrary base fields. Suppose E is an elliptic curve over a field K, and P1, . . . , Pn are points on E defined over K. To this information we associate an ...
The aim of this report is to illustrate the issues in implementing a practical elliptic curve cryptographic system. Before doing the implementation, I will review group operation defined on elliptic curve over finite field. From that perspective, the efficiency of elliptic curve cryptographic system can be improved in two steps. The first step is to find a good representation of field element s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید