SIDH hybrid schemes with a classical component based on the discrete logarithm problem over finite field extension

Authors

  • Michał Jakub Wroński Institute of Mathematics and Cryptology, Faculty of Cybernetics, Military University of Technology in Warsaw http://orcid.org/0000-0002-8679-9399
  • Elżbieta Burek Institute of Mathematics and Cryptology, Faculty of Cybernetics, Military University of Technology in Warsaw http://orcid.org/0000-0003-2937-0833
  • Łukasz Dzierzkowski Institute of Mathematics and Cryptology, Faculty of Cybernetics, Military University of Technology in Warsaw

Abstract

The concept of a hybrid scheme with connection of SIDH and ECDH is nowadays very popular. In hardware implementations it is convenient to use a classical key exchange algorithm, which is based on the same finite field as SIDH. Most frequently used hybrid scheme is SIDH-ECDH. On the other hand, using the same field as in SIDH, one can construct schemes over $\Fpn$, like Diffie-Hellman or XTR scheme, whose security is based on the discrete logarithm problem. In this paper, idea of such schemes will be presented. The security of schemes, which are based on the discrete logarithm problem over fields $\Fp, \Fpd, \Fpc, \Fps$ and $\Fpo$, for primes $p$ used in SIDH, will be analyzed. At the end, the propositions of practical applications of these schemes will be presented.

References

@INPROCEEDINGS{Sho94,

author={P. W. {Shor}},

booktitle={Proceedings 35th Annual Symposium on Foundations of Computer Science},

title={Algorithms for quantum computation: discrete logarithms and factoring},

year={1994},

volume={},

number={},

pages={124-134},

keywords={computational complexity;parallel algorithms;quantum computation algorithms;discrete logarithms;factoring;physical computational device;polynomial factor;Las Vegas algorithms;quantum computer;cryptosystems;Quantum computing;Quantum mechanics;Polynomials;Computational modeling;Physics computing;Computer simulation;Costs;Mechanical factors;Cryptography;Circuit simulation},

doi={10.1109/SFCS.1994.365700},

ISSN={},

month={Nov},}

@article{Wro20,

author="M. Wroński, T. Kijko, R. Dryło",

title = "Methods of Generation of Elliptic Curves for Hybrid SIDH Scheme over Large Fields",

year = "2020",

journal = "To appear in: Proceedings of the Romanian Academy, Series A",

volume = "January-March",

}

@inproceedings{Jaq19,

title={Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE},

author={Samuel Jaques and John M. Schanck},

booktitle={CRYPTO},

year={2019}

}

@InProceedings{Cos16,

author="Costello, Craig

and Longa, Patrick

and Naehrig, Michael",

editor="Robshaw, Matthew

and Katz, Jonathan",

title="Efficient Algorithms for Supersingular Isogeny Diffie-Hellman",

booktitle="Advances in Cryptology -- CRYPTO 2016",

year="2016",

publisher="Springer Berlin Heidelberg",

address="Berlin, Heidelberg",

pages="572--601",

abstract="We propose a new suite of algorithms that significantly improve the performance of supersingular isogeny Diffie-Hellman (SIDH) key exchange. Subsequently, we present a full-fledged implementation of SIDH that is geared towards the 128-bit quantum and 192-bit classical security levels. Our library is the first constant-time SIDH implementation and is up to 2.9 times faster than the previous best (non-constant-time) SIDH software. The high speeds in this paper are driven by compact, inversion-free point and isogeny arithmetic and fast SIDH-tailored field arithmetic: on an Intel Haswell processor, generating ephemeral public keys takes 46 million cycles for Alice and 52 million cycles for Bob, while computing the shared secret takes 44 million and 50 million cycles, respectively. The size of public keys is only 564 bytes, which is significantly smaller than most of the popular post-quantum key exchange alternatives. Ultimately, the size and speed of our software illustrates the strong potential of SIDH as a post-quantum key exchange candidate and we hope that these results encourage a wider cryptanalytic effort.",

isbn="978-3-662-53018-4"

}

@misc{Gui19,

author = {Aurore Guillevic},

title = {Discrete logarithm computation in finite fields $mathbb F_{p^n}$ with NFS variants and consequences in

pairing-based cryptography},

howpublished = {personal site},

year = {2019},

note = {url{https://members.loria.fr/AGuillevic/files/talks/19_Rennes_STNFS.pdf}},

}

@misc{SIKE,

author = {David Jao et. al.},

title = {Supersingular Isogeny Key Encapsulation (version from April 17, 2019},

howpublished = {NIST PQC},

year = {2019},

note = {url{https://sike.org/files/SIDH-spec.pdf}},

}

@misc{Wags,

author = {S. Wagstaf},

title = {The Cunningham Project},

howpublished = {},

year = {},

note = {url{https://pdfs.semanticscholar.org/66af/f30505c7cdf318756785a937744bca3b1e5b.pdf}},

}

@article{Gal12,

author={Galbraith, Steven D. and Pollard, John M. and Ruprai, Raminder S.},

title={Computing discrete logarithms in an interval},

volume={82},

DOI={10.1090/s0025-5718-2012-02641-x},

number={282},

journal={Mathematics of Computation},

year={2012},

pages={1181–1195}}

@book{BLA04,

place={Warszawa},

title={Krzywe eliptyczne w kryptografii},

publisher={Wydawnictwa Naukowo-Techniczne},

author={Blake, Ian F. and Seroussi, Gadiel and Smart, Nigel Paul and Kraśkiewicz Witold},

year={2004}}

@misc{ieee,

title={1363-2000 - IEEE Standard Specifications for Public-Key Cryptography},

url={https://standards.ieee.org/standard/1363-2000.html},

journal={IEEE}}

@article{WAN12,

title={Improved Pollard rho method for computing discrete logarithms over finite extension fields},

volume={236},

DOI={10.1016/j.cam.2012.03.019},

number={17},

journal={Journal of Computational and Applied Mathematics},

author={Wang, Ping and Zhang, Fangguo},

year={2012}, pages={4336–4343}}

@book{MUL13,

place={Boca Raton, FL},

title={Handbook of finite fields},

publisher={Chapman & Hall/CRC},

author={Mullen, Gary L. and Panario, Daniel},

year={2013}}

@misc{PQEC19,

title={Post Quantum ECC on FPGA Platform},

author={Debapriya Basu Roy and Debdeep Mukhopadhyay},

url={https://eprint.iacr.org/2019/568},

journal={Cryptology ePrint Archive: Report 2019/568 - Post Quantum ECC on FPGA Platform}}

@article{Gon99,

title={Public-key cryptosystems based on cubic finite field extensions},

author={Gong, Guang and Harn, Lein},

journal={IEEE Transactions on Information Theory},

volume={45},

number={7},

pages={2601--2605},

year={1999},

publisher={IEEE}

}

@inproceedings{LUC93,

title={LUC: A New Public Key System},

author={Smith, Peter J and Lennon, Michael JJ},

booktitle={SEC},

pages={103--117},

year={1993}

}

@inproceedings{XTR00,

title={The XTR public key system},

author={Lenstra, Arjen K and Verheul, Eric R},

booktitle={Annual International Cryptology Conference},

pages={1--19},

year={2000},

organization={Springer}

}

@article{Rup00,

title={Improvements to the gaudry-schost algorithm for multidimensional discrete logarithm problems and applications},

author={Ruprai, Raminder Singh},

journal={Department of Mathematics, Royal Holloway University of London},

year={2010}

}

Downloads

Published

2024-04-19

Issue

Section

Cryptography and Cybersecurity