|
Mathematical Methods of Cryptography
On bounds for balanced embedding degree
S. A. Novoselov Immanuel Kant Baltic Federal University, Kaliningrad, Russia
Abstract:
A generalized formula for calculating bounds for the balanced value of the hyperelliptic curve embedding degree is proved. Using this formula we give bounds for curves of genus 1–3 over finite fields with the small, medium and big characteristic. We also compute possible range of security level for curves with known generation methods, minimal $\rho$-value and embedding degrees $k=1,2,\dots,10$.
Keywords:
hyperelliptic curve cryptography, pairings, embedding degree, discrete logarithm problem.
Citation:
S. A. Novoselov, “On bounds for balanced embedding degree”, Prikl. Diskr. Mat., 2016, no. 2(32), 63–86
Linking options:
https://www.mathnet.ru/eng/pdm546 https://www.mathnet.ru/eng/pdm/y2016/i2/p63
|
Statistics & downloads: |
Abstract page: | 184 | Full-text PDF : | 79 | References: | 27 |
|