An interactive identification scheme based on discrete logarithms and factoring
Journal of Cryptology - Eurocrypt '90
Basic digit sets for radix representation
Journal of the ACM (JACM)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Resource requirements for the application of addition chains in modulo exponentiation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Fast exponentiation with precomputation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Signature schemes based on the strong RSA assumption
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
Elliptic Curve Cryptography on a Palm OS Device
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
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
A Cyclic Window Algorithm for ECC Defined over Extension Fields
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Improving and Extending the Lim/Lee Exponentiation Algorithm
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Algorithms for Multi-exponentiation
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Integer Decomposition for Fast Scalar Multiplication on Elliptic Curves
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Abuse-Free Optimistic Contract Signing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
An Improved Pseudo-random Generator Based on Discrete Log
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Security and Performance of Server-Aided RSA Computation Protocols
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Fast Server-Aided RSA Signatures Secure Against Active Attacks
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
High-Speed Software Multiplication in F2m
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
A Study on the Proposed Korean Digital Signature Algorithm
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A New Forward-Secure Digital Signature Scheme
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ISC '02 Proceedings of the 5th International Conference on Information Security
Secure Server-Aided Signature Generation
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
How to Implement Cost-Effective and Secure Public Key Cryptosystems
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Software Implementation of Elliptic Curve Cryptography over Binary Fields
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Hardware architectures for public key cryptography
Integration, the VLSI Journal
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Network coding: an instant primer
ACM SIGCOMM Computer Communication Review
A-Codes from Rational Functions over Galois Rings
Designs, Codes and Cryptography
Speeding up Exponentiation using an Untrusted Computational Resource
Designs, Codes and Cryptography
Improving secure server performance by re-balancing SSL/TLS handshakes
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Double Point Compression with Applications to Speeding Up Random Point Multiplication
IEEE Transactions on Computers
Should one always use repeated squaring for modular exponentiation?
Information Processing Letters
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
International Journal of Information and Computer Security
Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Generalized Scalar Multiplication Secure against SPA, DPA, and RPA
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient Flexible Batch Signing Techniques for Imbalanced Communication Applications
IEICE - Transactions on Information and Systems
New Elliptic Curve Multi-scalar Multiplication Algorithm for a Pair of Integers to Resist SPA
Information Security and Cryptology
More efficient DDH pseudorandom generators
Designs, Codes and Cryptography
Server(prover/signer)-aided verification of identity proofs and signatures
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Using hash functions as a hedge against chosen ciphertext attack
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Secure signed radix-r recoding methods for constrained-embedded devices
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Generic GF(2m) arithmetic in software and its application to ECC
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Fast batch verification of multiple signatures
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
New Frobenius expansions for elliptic curves with efficient endomorphisms
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Improved techniques for fast exponentiation
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Speeding up secure sessions establishment on the internet
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
An improved pseudorandom generator based on hardness of factoring
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Generalized MMM-algorithm secure against SPA, DPA, and RPA
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Zero-knowledge sets with short proofs
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Information Processing Letters
Efficient software implementation of binary field arithmetic using vector instruction sets
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Efficient implementation of the orlandi protocol
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Identity-based key exchange protocols without pairings
Transactions on computational science X
High-speed high-security signatures
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
Parallel modular exponentiation using load balancing without precomputation
Journal of Computer and System Sciences
Signed MSB-set comb method for elliptic curve point multiplication
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
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
How to securely outsource cryptographic computations
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Countermeasures for preventing comb method against SCA attacks
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
New online/offline signature schemes without random oracles
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Efficient primitives from exponentiation in Zp
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Making the diffie-hellman protocol identity-based
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Efficient countermeasures for thwarting the SCA attacks on the frobenius based methods
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Parallelizing the weil and tate pairings
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Improved fixed-base comb method for fast scalar multiplication
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Thinking inside the BLAC box: smarter protocols for faster anonymous blacklisting
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
High-Performance scalar multiplication using 8-dimensional GLV/GLS decomposition
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
A new precomputation method is presented for computing gR for a fixed element g and a randomly chosen exponent R in a given group. Our method is more efficient and flexible than the previously proposed methods, especially in the case where the amount of storage available is very small or quite large. It is also very efficient in computing gRyB for a small size E and variable number y, which occurs in the verification of Schnorr's identification scheme or its variants. Finally it is shown that our method is well-suited for parallel processing as well.