Dergiler / International Journal of Information Security Science / 2022 / Cilt: 11 Sayı: 2

Fast 4 way vectorized ladder for the complete set of Montgomery curves

Sayfa
12–24
Yayın Tarihi
2022-06-30
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

This paper also introduces new formulas for doing arithmetic over GF(2^255-19).

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:This paper introduces 4 way vectorization of Montgomery ladder on any Montgomery form elliptic curve.
📊
Temel Bulgular & Veri:Our algorithm takes 2M^4+1S^4 (M^4: A vector of four field multiplications, S^4: A vector of four field squarings) per ladder step for variable-scalar variable-point multiplication.
💡
Sonuç & Katkı:This paper also introduces new formulas for doing arithmetic over GF(2^255-19).
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Montgomery ladder · elliptic curves · genus 1

Abstract

This paper introduces 4 way vectorization of Montgomery ladder on any Montgomery form elliptic curve. Our algorithm takes 2M^4+1S^4 (M^4: A vector of four field multiplications, S^4: A vector of four field squarings) per ladder step for variable-scalar variable-point multiplication. This paper also introduces new formulas for doing arithmetic over GF(2^255-19).

🔖

Bu Makaleye Atıf Yap

HIŞIL, H., EĞRİCE, B., YASSI, M. (2022). Fast 4 way vectorized ladder for the complete set of Montgomery curves. International Journal of Information Security Science, Cilt: 11 Sayı: 2, 12–24. https://ajindex.com/articles/918614

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...

Kaynakça (5)

  1. V. Miller, “Use of elliptic curves in cryptography,” in CRYPTO’85, ser. LNCS, vol. 218. Springer, 1985, pp. 417–426. N. Koblitz, “Elliptic curve cryptosystems,” Mathematics of Computation, vol. 48, no. 177, pp. 203–209, January 1987. P. Montgomery, “Speeding the Pollard and elliptic curve methods of factorization,” Mathematics of computation, vol. 48, no. 177, pp.243–264, 1987. D. Bernstein, “Curve25519: New Diffie-Hellman speed records,” in Public Key Cryptography - PKC 2006, 9th International Conference on Theory and Practice of Public-Key Cryptography, New York, NY, USA, April 24-26, 2006, Proceedings, ser. Lecture Notes in Computer Science, M. Yung, Y. Dodis, A. Kiayias, and T. Malkin, Eds., vol. 3958. Springer, 2006, pp. 207–228. [Online]. Available: https://doi.org/10.1007/11745853 14 E. Brier and M. Joye, “Weierstraß elliptic curves and side-channel attacks,” in Public Key Cryptography, 5th International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2002,
  2. Paris, France, February 12-14, 2002, Proceedings, ser. Lecture Notes in Computer Science, D. Naccache and P. Paillier, Eds., vol. 2274. Springer, 2002, pp. 335–345. [Online]. Available: https://doi.org/10.1007/3-540-45664-3 24 J. López and R. Dahab, “Fast multiplication on elliptic curves over GF(2m ) without precomputation,” in Cryptographic Hardware and Embedded Systems, First International Workshop, CHES’99, Worcester, MA, USA, August 12-13, 1999, Proceedings, ser. Lecture Notes in Computer Science, Ç. Koç and C. Paar, Eds., vol. 1717. Springer, 1999, pp. 316–327. [Online]. Available: https://doi.org/10.1007/3-540-48059-5 27 W. Castryck, S. Galbraith, and R. R. Farashahi, “Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation,” Cryptology ePrint Archive, Report 2008/218, 2008, https://eprint.iacr.org/2008/218.
  3. D. J. Bernstein, T. Lange, and R. Rezaeian Farashahi, “Binary Edwards curves,” in Cryptographic Hardware and Embedded Systems – CHES 2008,
  4. E. Oswald and P. Rohatgi, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008, pp. 244–265. R. Rezaeian Farashahi and S. G. Hosseini, “Differential addition on binary elliptic curves,” in Arithmetic of Finite Fields, S. Duquesne and S. Petkova-Nikova, Eds. Cham: Springer International Publishing, 2016, pp. 21–35. ——, “Differential addition on twisted Edwards curves,” in Information Security and Privacy - 22nd Australasian Conference, ACISP 2017,
  5. Auckland, New Zealand, July 3-5, 2017, Proceedings