Abstract
In this paper we investigate an instance of the generalized Diffie-Hellman key exchange protocol suggested by the equidistribution theorem. We prove its correctness and discuss the security. Experimental evidences for the theoretical results are also provided.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Azhari, A., Bouftass, S.: On a new fast public key cryptosystem. https://eprint.iacr.org/2014/946.pdf
Bohl, P.: Über ein in der Theorie der säkutaren Störungen vorkommendes Problem. J. Reine Angew. Math. 135, 189–283 (1909)
Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644–654 (1976)
Gerold Grünauer Proposal of a new efficient public key system for encryption and digital signatures. https://eprint.iacr.org/2007/445.pdf
Horie, S., Watanabe, O.: Hard instance generation for SAT. In: Leong, H.W., Imai, H., Jain, S. (eds.) ISAAC 1997. LNCS, vol. 1350, pp. 22–31. Springer, Heidelberg (1997). doi:10.1007/3-540-63890-3_4
Liu, Y.-K., Lyubashevsky, V., Micciancio, D.: On bounded distance decoding for general lattices. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX/RANDOM -2006. LNCS, vol. 4110, pp. 450–461. Springer, Heidelberg (2006). doi:10.1007/11830924_41
Maze, G., Monico, C., Rosenthal, J.: Public key cryptography based on semigroup actions. Adv. Math. Commun. 1(4), 489–507 (2007)
Merkle, R.C.: Public key distribution using approximately linear functions. http://www.merkle.com/papers/approxLinearPK.html
Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. J. Algorithms 25(1), 19–51 (1997)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
Serpette, B., Vuillemin, J., Hervé, J.-C.: BigNum: a portable and efficient package for arbitrary-precision arithmetic. Digital, Paris Research Laboratory (1989)
NIST: Recommendation for Key Management, NIST Special Publication 800–57 Part 1 Revision 4 2016
Sierpinski, W.: Sur la valeur asymptotique d’une certaine somme. Bull Intl. Acad. Polonmaise des Sci. et des Lettres (Cracovie) series A, 9–11 (1910)
Soibelman, Y.: Quantum tori mirror symmetry and deformation theory. Lett. Math. Phys. 56(2), 99–125 (2001)
Weyl, H.: Über die Gibbs’sche Erscheinung und verwandte Konvergenzphänomene. Rendiconti del Circolo Matematico di Palermo, pp. 377–407 (1910)
Zhang, Y.: A practical attack to Bouftass’s crypto system. https://arxiv.org/abs/1605.00987v1
Acknowledgments
This research was partially supported by the Romanian National Authority for Scientific Research (CNCS-UEFISCDI) under the project PN-III-P2-2.1-PTE-2016-0191.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Barcau, M., Paşol, V., Pleşca, C., Togan, M. (2017). On a Key Exchange Protocol. In: Farshim, P., Simion, E. (eds) Innovative Security Solutions for Information Technology and Communications. SecITC 2017. Lecture Notes in Computer Science(), vol 10543. Springer, Cham. https://doi.org/10.1007/978-3-319-69284-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-69284-5_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69283-8
Online ISBN: 978-3-319-69284-5
eBook Packages: Computer ScienceComputer Science (R0)