Cryptanalysis of tripartite and multi-party authenticated key agreement protocols
Information Sciences: an International Journal
Hardware acceleration of the Tate pairing on a genus 2 hyperelliptic curve
Journal of Systems Architecture: the EUROMICRO Journal
Self-certified signature scheme from pairings
Journal of Systems and Software
A pairing SW implementation for Smart-Cards
Journal of Systems and Software
An efficient session key generation for NTDR networks based on bilinear paring
Computer Communications
New cryptosystems design based on hybrid-mode problems
Computers and Electrical Engineering
On the embedding degree of reductions of an elliptic curve
Information Processing Letters
Journal of Symbolic Computation
FPGA and ASIC implementations of the ηT pairing in characteristic three
Computers and Electrical Engineering
Provably secure non-interactive key distribution based on pairings
Discrete Applied Mathematics - Special issue: Coding and cryptography
Refinements of Miller's algorithm for computing the Weil/Tate pairing
Journal of Algorithms
Ramanujan's class invariants and their use in elliptic curve cryptography
Computers & Mathematics with Applications
Faster pairing computation on genus 2 hyperelliptic curves
Information Processing Letters
An efficient dynamic authenticated key exchange protocol with selectable identities
Computers & Mathematics with Applications
Enhanced Certificate-Based Encryption from pairings
Computers and Electrical Engineering
A novel electronic cash system with trustee-based anonymity revocation from pairing
Electronic Commerce Research and Applications
A round-optimal three-party ID-based authenticated key agreement protocol
Information Sciences: an International Journal
An improved two-party identity-based authenticated key agreement protocol using pairings
Journal of Computer and System Sciences
Short signature scheme for multi-source network coding
Computer Communications
Counting points on Cab curves using Monsky--Washnitzer cohomology
Finite Fields and Their Applications
Polynomial approximation of bilinear Diffie--Hellman maps
Finite Fields and Their Applications
Finite Fields and Their Applications
Algebraic curves and cryptography
Finite Fields and Their Applications
Improved Pollard rho method for computing discrete logarithms over finite extension fields
Journal of Computational and Applied Mathematics
Enhanced authentication for commercial video services
Security and Communication Networks
Zeta function and cryptographic exponent of supersingular curves of genus 2
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Constructing pairing-friendly genus 2 curves with ordinary Jacobians
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
On the minimal embedding field
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
The tate pairing via elliptic nets
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Identity-based encryption: how to decrypt multiple ciphertexts using a single decryption key
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
ZigBee security using identity-based cryptography
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
Efficient and dynamic key management for multiple identities in identity-based systems
Information Sciences: an International Journal
Additively homomorphic encryption with a double decryption mechanism, revisited
ISC'12 Proceedings of the 15th international conference on Information Security
On the strength comparison of the ECDLP and the IFP
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Breaking pairing-based cryptosystems using ηT pairing over GF(397)
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Tate pairing computation on jacobi's elliptic curves
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
An identity based encryption using elliptic curve cryptography for secure M2M communication
Proceedings of the First International Conference on Security of Internet of Things
On the Security of an Efficient and Non-interactive Hierarchical Key Agreement Protocol
Wireless Personal Communications: An International Journal
| Hi-index | 754.84 |
Elliptic curve cryptosystems have the potential to provide relatively small block size, high-security public key schemes that can be efficiently implemented. As with other known public key schemes, such as RSA and discrete exponentiation in a finite field, some care must be exercised when selecting the parameters involved, in this case the elliptic curve and the underlying field. Specific classes of curves that give little or no advantage over previously known schemes are discussed. The main result of the paper is to demonstrate the reduction of the elliptic curve logarithm problem to the logarithm problem in the multiplicative group of an extension of the underlying finite field. For the class of supersingular elliptic curves, the reduction takes probabilistic polynomial time, thus providing a probabilistic subexponential time algorithm for the former problem