Ecient Implementation of Tate Pairing on a Mobile Phone Using Java
Source: University of Tsukuba
PairingBased Cryptosystems (PBC) has been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosystems. This paper presents an efficient implementation for computing Tate pairing on a mobile phone using Java. This paper implemented the nT pairing a recent efficient variation of DuursmaLee algorithm over some finite fields of characteristic with extension degree m= {97, 167, 193, 239}.
| Format: | Size: | 283.90 | |
| Date: | Aug 2006 |
People who downloaded this item also downloaded
- Running Scala in the Browser: Cross-Compiling Scala to JavaScript
- Towards Cloud Mobile Hybrid Application Generation Using Semantically Enriched Domain Specific Languages
- MobiCloud - Making Clouds Reachable: A Toolkit for Easy and Efficient Development of Customized Cloud Mobile Hybrid Application
- Provably Secure Timed-Release Public Key Encryption
- File System Auditing That Works
