A course in number theory and cryptography
A course in number theory and cryptography
On the asymptotic analysis of the Euclidean algorithm
Journal of Symbolic Computation
Exponentiating faster with addition chains
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Efficient identification and signatures for smart cards
CRYPTO '89 Proceedings on Advances in cryptology
Discrete logarithms in GF(P) using the number field sieve
SIAM Journal on Discrete Mathematics
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
When is a pair of matrices mortal?
Information Processing Letters
A survey of fast exponentiation methods
Journal of Algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Signed Digit Representations of Minimal Hamming Weight
IEEE Transactions on Computers
Improved Digital Signature Suitable for Batch Verification
IEEE Transactions on Computers
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
The Fast Cascade Exponentation Algorithm and its Applications on Cryptography
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Algorithms for Multi-exponentiation
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Fortifying password authentication in integrated healthcare delivery systems
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Fast Multicomputation with Asynchronous Strategy
IEEE Transactions on Computers
Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
International Journal of Computer Mathematics
Information Sciences: an International Journal
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
EPA: an efficient password-based protocol for authenticated key exchange
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
An efficient password-only two-server authenticated key exchange system
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Zero-knowledge argument for simultaneous discrete logarithms
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
PrETP: privacy-preserving electronic toll pricing
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Fast multi-computations with integer similarity strategy
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Modular arithmetic and fast algorithm designed for modern computer security applications
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part III
Server-aided signatures verification secure against collusion attack
Information Security Tech. Report
Efficient public key cryptosystem resilient to key leakage chosen ciphertext attacks
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
OAKE: a new family of implicitly authenticated diffie-hellman protocols
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Efficient leakage-resilient public key encryption from DDH assumption
Cluster Computing
| Hi-index | 14.98 |
In this paper, we propose new algorithms for multiple modular exponentiation operations. The major aim of these algorithms is to speed up the performance of some cryptographic protocols based on multiexponentiation. Our new algorithms are based on binary-like complex arithmetic, introduced by Pekmestzi and generalized in this paper.