Advertisement

An Information Rate Improvement for a Polynomial Variant of the Naccache-Stern Knapsack Cryptosystem

  • Giacomo MicheliEmail author
  • Joachim Rosenthal
  • Reto Schnyder
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 358)

Abstract

We adapt an information rate improvement by Chevallier-Naccache-Stern for the Naccache-Stern knapsack cryptosystem, called the prime packing strategy, to the polynomial version of the protocol.

Notes

Acknowledgments

The authors were supported by Swiss National Science Foundation grant number 149716 and Armasuisse

References

  1. 1.
    Barbulescu R, Gaudry P, Joux A, Thomé E (2014) A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Advances in Cryptology-Eurocrypt 2014. Springer, pp 1–16Google Scholar
  2. 2.
    Chevallier-Mames B, Naccache D, Stern J (2008) Linear bandwidth naccache-stern encryption. In: Security and Cryptography for Networks. Springer, pp 327–339Google Scholar
  3. 3.
    Micheli G, Schiavina M (2014) A general construction for monoid-based knapsack protocols. Adv Math Commun 8(3)Google Scholar
  4. 4.
    Naccache D, Stern J (1997) A new public-key cryptosystem. In: Advances in Cryptology, EUROCRYPT. pp 27–36Google Scholar
  5. 5.
    Stanton D, White D (1986) Constructive combinatorics. Springer, New York Google Scholar
  6. 6.
    Stein W, et al. (2014) Sage mathematics software (version 6.1.1). The Sage Development Team, http://www.sagemath.org

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Giacomo Micheli
    • 1
    Email author
  • Joachim Rosenthal
    • 1
  • Reto Schnyder
    • 1
  1. 1.Institute of MathematicsUniversity of ZurichZurichSwitzerland

Personalised recommendations