Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Unbelievable Security. Matching AES Security Using Public Key Systems
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Computation of Discrete Logarithms in F2607
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Computer Architecture: A Quantitative Approach
Computer Architecture: A Quantitative Approach
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Advances in Elliptic Curve Cryptography (London Mathematical Society Lecture Note Series)
Constructing elliptic curves with prescribed embedding degrees
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems
IEEE Transactions on Information Theory
A pairing SW implementation for Smart-Cards
Journal of Systems and Software
Efficient Implementation of Tate Pairing on a Mobile Phone Using Java
Computational Intelligence and Security
Software Implementation of Arithmetic in
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Revocation games in ephemeral networks
Proceedings of the 15th ACM conference on Computer and communications security
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Journal of Systems and Software
Secure signed radix-r recoding methods for constrained-embedded devices
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
A group-based security policy for wireless sensor networks
Proceedings of the 2010 ACM Symposium on Applied Computing
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
An hybrid approach for efficient multicast stream authentication over unsecured channels
ProvSec'07 Proceedings of the 1st international conference on Provable security
Optimised versions of the ate and twisted ate pairings
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
An efficient countermeasure against side channel attacks for pairing computation
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
An efficient user authentication and key exchange protocol for mobile client-server environment
Computer Networks: The International Journal of Computer and Telecommunications Networking
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
A novel node level security policy framework for wireless sensor networks
Journal of Network and Computer Applications
Network-on-Chip interconnect for pairing-based cryptographic IP cores
Journal of Systems Architecture: the EUROMICRO Journal
New receipt-free voting scheme using double-trapdoor commitment
Information Sciences: an International Journal
An efficient anonymous authentication protocol for mobile pay-TV
Journal of Network and Computer Applications
Towards generalized ID-based user authentication for mobile multi-server environment
International Journal of Communication Systems
A private online system for executing wills based on a secret sharing mechanism
Security and Communication Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Implementing cryptographic pairings
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Implementing cryptographic pairings over barreto-naehrig curves
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Instruction set extensions for pairing-based cryptography
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
The importance of the final exponentiation in pairings when considering fault attacks
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Future Generation Computer Systems
Securing pairing-based cryptography on smartcards
International Journal of Information and Computer Security
Improved side channel attacks on pairing based cryptography
COSADE'13 Proceedings of the 4th international conference on Constructive Side-Channel Analysis and Secure Design
| Hi-index | 0.00 |
Pairings on elliptic curves are fast coming of age as cryptographic primitives for deployment in new security applications, particularly in the context of implementations of Identity-Based Encryption (IBE). In this paper we describe the implementation of various pairings on a contemporary 32-bit smart-card, the Philips HiPerSmartTM, an instantiation of the MIPS-32 based SmartMIPSTM architecture. Three types of pairing are considered, first the standard Tate pairing on a nonsupersingular curve $E(\mathbb{F}_p)$, second the Ate pairing, also on a nonsupersingular curve $E(\mathbb{F}_p)$, and finally the ηT pairing on a supersingular curve $E(\mathbb{F}_{2^m})$. We demonstrate that pairings can be calculated as efficiently as classic cryptographic primitives on this architecture, with a calculation time of as little as 0.15 seconds.