Papers by Keyword: Elliptic Curve

Abstract: — Scientific researches advancements achieving miniaturization of Micro-electromechanical Systems, has enable smarts autonomous embedded devices know as sensor nodes, that are developed on numerous platforms using the proprietary of hardware and software with capability to communicate wirelessly. Today more than ever these sensors are continuously spreading to civilian usage side of things and in many others applications , including military, security, medical, environments, and animal among others, to sense specific occurrence of desired event and may carried very important data on physical device such as the mica-mote. Hence a plethora of security protocols arises in order to mitigate the risks of malicious attacks such as eavesdrop communications, or data alteration, using cryptographic techniques such as Elliptic curve for data privacy, accuracy, integrity, efficiency, and reducing the energy consumption by mote and processors. We focus on securing data by all means. Hence the in-network processing technique is used to reduce considerably the energy consumption, considering that sensors deployments in inaccessible and resource-constrained environments. After the drawback, we investigate the secured data aggregation and give security requirements that are mandatory to a Trusted Data Aggregation with Low Energy model to satisfy. The security and energy performances are analysed comparing with others methods. Index Terms—TDALE, Aggregation, Elliptic curve, RSA, Security, Energy

Abstract: This paper proposes a secure prosecution program after analysis and study on the defects of current network report systems in their report modes and protection on prosecutors’ privacy. The program can not only achieve better anonymity for prosecutors but also can track malicious prosecutors. This paper improved the efficiency of existing algorithms for privacy, and realized various functions for the prosecution system to ensure anonymity, non-repudiation, traceability and other safety indicators.

Abstract: For decades, symmetric cryptosystems, such as chaos-based ones, are designed for image encryption. In this paper, a novel public key scheme for image encryption is presented. Based on the improved elliptic curve cryptosystem and Arnold cat map, the novel scheme can offer high security while avoid exchange and distribution of secret keys. The experiments illustrate that the presented scheme is computationally less complex than the traditional asymmetric cryptosystems and suitable for large image encryption.

Abstract: Recently elliptic curve cryptosystems are widely accepted for security applications key generation, signature and verification. Cryptographic mechanisms based on elliptic curves depend on arithmetic involving the points of the curve. it is possible to use smaller primes, or smaller finite fields, with elliptic curves and achieve a level of security comparable to that for much larger integers. Koblitz curves, also known as anomalous binary curves, are elliptic curves defined over F2. The primary advantage of these curves is that point multiplication algorithms can be devised that do not use any point doublings. The ElGamal cryptosystem, which is based on the Discrete Logarithm problem can be implemented in any group. In this paper, we propose the ElGamal over Koblitz Curve Scheme by applying the arithmetic on Koblitz curve to the ElGamal cryptosystem. The advantage of this scheme is that point multiplication algorithms can be speeded up the scalar multiplication in the affine coodinate of the curves using Frobenius map. It has characteristic two, therefore it’s arithmetic can be designed in any computer hardware. Moreover, it has more efficient to employ the TNAF method for scalar multiplication on Koblitz curves to decrease the number of nonzero digits. It’s security relies on the inability of a forger, who does not know a private key, to compute elliptic curve discrete logarithm.

Abstract: Based on Elliptic Curve cryptosystem, a threshold signature scheme characterized by (k, l) joint verification for (t, n) signature is put forward. After being signed by a signer company employing (t, n) threshold signature scheme, the information m is transmitted to a particular verifier company, and then the signature is verified through the cooperation of k ones from the verifier company with l members, so as to realize a directional transmission between different companies. Finally, the application examples of the company encryption communication system, the generating polynomial of company private key and public key were given. The security of this scheme is based on Shamir threshold scheme and Elliptic Curve system, and due to the advantages of Elliptic Curve, the scheme enjoys wider application in practice.

Abstract: Two secure, high-efficient and feasible e-cash schemes are proposed in this thesis based on elliptic curve by using blind signature system, the schemes are completed by three protocols, namely, withdrawal protocol, payment protocol and deposit protocol. The two schemes make advantage of blind parameter, namely, after cash is received by Bank, cash is also hardly connected with the signature at some times. They are simple and easily realized. The elliptic curve cryptographic algorithm is adopted in the scheme, the length of the private key is short, and its efficiency and strength is significantly higher than e-cash scheme based on RSA signature proposed by D.Chaum. There is no effective solution to the elliptic curve discrete logarithm problem (ECDLP), therefore, the schemes are safe.

Abstract: On the elliptic curve cryptosystem proposed a new multi-proxy signature scheme - (t, k, n) threshold blind proxy signature scheme.In new program blind proxy signature and (t,k,n) threshold secret sharing scheme will be combined, and will not over-concentration of the rights of the blind proxy signer .Computation of the program is small, security is high, the achieve efficiency and the utility is better .can prevent a malicious user's forgery attack and have the security properties of proxy signature.

Abstract: In elliptic curve cryptography, reverse-mode operation is the impact on the efficiency of digital signature one of the most important factor. Analysis of the limited domain of elliptic curve digital signature process, to prove the correctness of the algorithm, a non-mode based on the inverse operation of the elliptic curve digital signature algorithm, the algorithm does not reduce the security on the basis of improved algorithms Efficiency.

Abstract: In practical applications of pairing-based cryptosystems, the efficiency of pairing computation is a crucial factor. Recently, there have been many improvements for the computation of Tate pairing, which focuses on the arithmetical operations under given elliptic curve. Based to the characteristics that Miller’s algorithm will be improved tremendous if there are subgroups with order of low hamming prime above the elliptic curve, an algorithm of generating primes of low hamming with weight 3 is given in this paper. Then, we present an effective generation method of elliptic curve, which enable it feasible that there is certain some subgroup of low hamming prime order. The improvement of paring computation is marked above the elliptic curve generating by our method.

Abstract: Recently, several one time password authentication schemes have been proposed. However, most one-time password authentication schemes have security flaws. In this paper, a novel one-time password authentication and key agreement scheme (EAKAS) based on elliptic curve digital signature chain is developed. The proposed scheme has the following merits password or verification table is not required in the server; users can choose or change password; it can resist off-line dictionary attacks and achieves mutual authentication; it has no system clock synchronization and no constraint of transmission delay; it can resist replay attacks, man-in-the-middle attack and insider attack; it is sensitive to password error and strong in security restoration; the session keys in proposed scheme have the feature of freshness, confidentiality, known key security and forward security. Compared with the related schemes, our proposed scheme has better security and well suited to scenarios requiring a high level security.