Skip to main content
SpringerLink
Log in

A Public Key Cryptosystem Based upon Euclidean Addition Chains

  • Conference paper
Sequences and Their Applications – SETA 2010 (SETA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6338))

Included in the following conference series:

Abstract

Addition chains are classical tools used to speed up exponentiation in cryptographic algorithms. In this paper we proposed to use a subset of addition chains, the Euclidean addition chains, in order to define a new public key cryptosystem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bahig, H.M.: Improved generation of minimal addition chains. Computing 78(2), 161–172 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Brauer, A.: On addition chains. Bull. Amer. Math. Soc. 45, 736–739 (1939)

    Article  MathSciNet  Google Scholar 

  3. Chevallier-Mames, B., Naccache, D., Stern, J.: Linear bandwidth naccache-stern encryption. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 327–339. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Downey, P.J., Leong, B.L., Sethi, R.: Computing sequences with addition chains. SIAM J. Comput. 10(3), 638–646 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  5. Goundar, R., Shiota, K., Toyonaga, M.: Spa resistant scalar multiplication using golden ration addition chain method. International Journal of Applied Mathematics 38(2), 83–88 (2008)

    MathSciNet  Google Scholar 

  6. Knuth, D.E.: The Art of Computer Programming: Fundamental Algorithms, 3rd edn., vol. 2. Addison Wesley, Reading (July 1997)

    MATH  Google Scholar 

  7. Meloni, N.: Arithmétique pour la Cryptographie basée sur les Courbes Elliptiques. Ph.D. thesis, Université de Montpellier, France (2007)

    Google Scholar 

  8. Meloni, N.: New point addition formulae for ECC applications. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 189–201. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Montgomery, P.L.: Evaluating recurrences of form X m + n  = f(X m ,X n ,X m − n ) via Lucas chains (2002), ftp://ftp.cwi.nl/pub/pmontgom/Lucas.ps.gz

  10. Naccache, D., Stern, J.: A new public-key cryptosystem. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 27–36. Springer, Heidelberg (1997)

    Google Scholar 

  11. Sholz, A.: Aufgabe 253. Jahresbericht der deutschen Mathematiker-Vereinigung 47, 41–42 (1937)

    Google Scholar 

  12. Subbarao, M.: Addition chains - some results and problems. Number Theory and Applications, 555–574 (1989)

    Google Scholar 

  13. Yao, A.C.: On the evaluation of powers. SIAM Journal on Computing 5(1), 100–103 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  14. Yao, A.C., Knuth, D.E.: Analysis of the substractive algorithm for greatest common divisors. Proc. Nat. Acad. Sci. USA 72(12), 4720–4722 (1975)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université du Sud Toulon-Var, IMATH, IUFM de Nice, Université de Nice, France

    Fabien Herbaut

  2. Université du Sud Toulon-Var, IMATH, France

    Pascal Véron

Authors
  1. Fabien Herbaut
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Véron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LAGA,Universities of Paris 8 and Paris 13 and CNRS, France

    Claude Carlet

  2. Institute for Algebra and Geometry, Faculty of Mathematics, Otto-von-Guericke-University Magdeburg, D-39016,, Magdeburg, Germany

    Alexander Pott

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Herbaut, F., Véron, P. (2010). A Public Key Cryptosystem Based upon Euclidean Addition Chains. In: Carlet, C., Pott, A. (eds) Sequences and Their Applications – SETA 2010. SETA 2010. Lecture Notes in Computer Science, vol 6338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15874-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15874-2_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15873-5

  • Online ISBN: 978-3-642-15874-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation