On the security of generalized Jacobian cryptosystems
From MaRDI portal
Publication:2470818
DOI10.3934/AMC.2007.1.413zbMath1143.94010OpenAlexW2024305003MaRDI QIDQ2470818
Publication date: 15 February 2008
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2007.1.413
elliptic curvesfinite fieldsdiscrete logarithm problempublic-key cryptographypairing-friendly curvessemi-abelian varieties
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Classical groups (algebro-geometric aspects) (14L35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: On the security of generalized Jacobian cryptosystems