The concept of grouping proofs has been introduced by Juels to permit RFID tags to generate a verifiable proof that they have been scanned simultaneously, even when readers or tags are potentially untrusted. In this paper, we extend this concept and propose a narrowstrong privacy-preserving RFID grouping proof and demonstrate that it can easily be extended to use cases with more than two tags, ...

Remote voting systems implementing the homomorphic tallying paradigm have proven to be the best option for elections with a small range of candidates. In this paper, we propose a new homomorphic tallying remote voting system that makes use of elliptic curve cryptography. The proposed system is suitable for multiple choice elections. Detailed security and performance analysis are provided.

The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computationally unfeasible when elliptic curves are suitably chosen. This paper provides an algorithm to obtain cryptographically good elliptic curves from a given one. The core of such a procedure lies on the usage of successi...

In 2007, Stange proposed a novel method for computing the Tate pairing on an elliptic curve over a finite field. This method is based on elliptic nets, which are maps from Z to a ring that satisfies a certain recurrence relation. In the present paper, we explicitly give formulae based on elliptic nets for computing the following variants of the Tate pairing: the Ate, Atei, R-Ate, and optimal pa...

An exploration of the benefits and challenges of a PKI based on elliptic curve cryptography

The secure end-to-end route discovery in the decentralized Mobile Adhoc Networks (MANETs) should have to meet the requirements of prevention of DoS attacks on data traffic, should be adaptive and fault tolerant and must have high speed, low energy overhead and scalability for future development. In this research a secure routing using antnet mechanism and mutual authentication using Elliptic Cu...

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...

Even first semester calculus students are aware of how calculus, hence analysis, is used to solve problems in engineering. In recent decades the engineering world is gaining more exposure to algebra through the powerful problem solutions it provides. One area that algebra has made significant contributions to is cryptography and, more specifically, public key cryptography. In this paper we aim ...

This paper merges between elliptic curve addition presents a modified processor architecture for Elliptic Curve Cryptography computations in Galois Fields GF(p). The architecture incorporates the methodology of pipelining to utilize the benefit of both parallel and serial implementations. It allows the exploitation of the inherited independency that exists in elliptic curve point addition and d...