Complexity and Fast Algorithms for Multiexponentiations
IEEE Transactions on Computers
Efficient Arithmetic on Koblitz Curves
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Rethinking Public Key Infrastructures and Digital Certificates: Building in Privacy
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A Signature Scheme Based on the Intractability of Computing Roots
Designs, Codes and Cryptography
Software Implementation of the NIST Elliptic Curves Over Prime Fields
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Efficient elliptic curve exponentiation
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
More Flexible Exponentiation with Precomputation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
An Improved Algorithm for Arithmetic on a Family of Elliptic Curves
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Fast exponentiation with precomputation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
ISC '02 Proceedings of the 5th International Conference on Information Security
On Montgomery-Like Representationsfor Elliptic Curves over GF(2k)
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Exponentiation in Pairing-Friendly Groups Using Homomorphisms
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Securing RSA against Fault Analysis by Double Addition Chain Exponentiation
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Novel Precomputation Schemes for Elliptic Curve Cryptosystems
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Zero-knowledge argument for simultaneous discrete logarithms
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Non-interactive multisignatures in the plain public-key model with efficient verification
Information Processing Letters
On shortening ciphertexts: new constructions for compact public key and stateful encryption schemes
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
An advanced method for joint scalar multiplications on memory constraint devices
ESAS'05 Proceedings of the Second European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Fast multi-computations with integer similarity strategy
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Two new fast methods for simultaneous scalar multiplication in elliptic curve cryptosystems
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Efficient broadcast encryption using multiple interpolation methods
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Fractional windows revisited: improved signed-digit representations for efficient exponentiation
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Public key cryptography sans certificates in ad hoc networks
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
On the design and implementation of an efficient DAA scheme
CARDIS'10 Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application
Efficient precomputation schemes of kP+lQ
Information Processing Letters
Fast elliptic curve cryptography in OpenSSL
FC'11 Proceedings of the 2011 international conference on Financial Cryptography and Data Security
A short non-delegatable strong designated verifier signature
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Server-aided signatures verification secure against collusion attack
Information Security Tech. Report
On the implementation of a pairing-based cryptographic protocol in a constrained device
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Ensuring high-quality randomness in cryptographic key generation
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
This paper compares different approaches for computing power products Π1≤i≤k giei in commutative groups. We look at the conventional simultaneous exponentiation approach and present an alternative strategy, interleaving exponentiation. Our comparison shows that in general groups, sometimes the conventional method and sometimes interleaving exponentiation is more efficient. In groups where inverting elements is easy (e.g. elliptic curves), interleaving exponentiation with signed exponent recoding usually wins over the conventional method.