Left-to-right signed-bit τ -adic representations of n integers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4307 LNCS, Issue , 2006, Pages 469-478

  Brumley, Billy Bob ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Digital signatures; Elliptic curve cryptography; Joint sparse form; Koblitz curves; Simultaneous elliptic scalar multiplication

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY; PUBLIC KEY CRYPTOGRAPHY;

ARBITRARY NUMBER; DIGITAL SIGNATURE SCHEMES; ELLIPTIC CURVE CRYPTOGRAPHY; ELLIPTIC SCALAR MULTIPLICATION; JOINT SPARSE FORM; KOBLITZ CURVES; SIGNATURE VERIFICATION; TWO-POINT;

AUTHENTICATION;

EID: 38049045374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935308_33     Document Type: Conference Paper

References (13)

1. Solinas, J.A.: Efficient arithmetic on Koblitz curves. Designs, Codes, and Cryptography 19(2–3) (2000) 195–249
2. Solinas, J.A.: Low-weight binary representations for pairs of integers. Technical Report CORR 2001-41, Centre for Applied Cryptographic Research, University of Waterloo, Canada (2001)
3. Ciet, M., Lange, T., Sica, F., Quisquater, J.J.: Improved algorithms for efficient arithmetic on elliptic curves using fast endomorphisms. Advances in Cryptology-Eurocrypt 2003 2656 (2003) 388–400
4. Proos, J.: Joint sparse forms and generating zero columns when combing. Technical Report CORR 2003-23, Centre for Applied Cryptographic Research, University of Waterloo, Canada (2003)
5. Grabner, P.J., Heuberger, C., Prodinger, H.: Distribution results for low-weight binary representations for pairs of integers. Theoretical Computer Science 319(1-3) (2004) 307–331
6. Ruan, X., Katti, R.S.: Low-weight left-to-right binary signed-digit representation of n integers. In: 2004 IEEE International Symposium on Information Theory. (2004)
7. Brumley, B.B.: Efficient three-term simultaneous elliptic scalar multiplication with applications. In: Proceedings of the 11th Nordic Workshop on Secure IT Systems (NordSec 2006), Linköping, Sweden (2006) to appear.
8. Hankerson, D., Menezes, A., Vanstone, S.: Guide to elliptic curve cryptography. Springer, New York (2004)
9. Koblitz, N.: Cm-curves with good cryptographic properties. In: CRYPTO ’91: Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, London, UK, Springer-Verlag (1992) 279–287
10. ElGamal, T.: A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory IT-31(4) (1985) 469–472
11. Straus, E.G.: Addition chains of vectors (problem 5125). American Mathematical Monthly 71 (1964) 806–808
12. NIST: Recommended elliptic curves for federal government use. Technical report, National Institute of Standards and Technology (NIST) (1999)
13. Järvinen, K.: Unified elliptic curve point addition and subtraction algorithm. Technical report, Packet Level Authentication Project, Signal Processing Laboratory, Helsinki University of Technology, Espoo, Finland (2006) Internal.