all InfoSec news
Multiplication polynomials for elliptic curves over finite local rings. (arXiv:2302.03650v1 [math.NT])
Feb. 8, 2023, 2:10 a.m. | Riccardo Invernizzi, Daniele Taufer
cs.CR updates on arXiv.org arxiv.org
For a given elliptic curve $E$ over a finite local ring, we denote by
$E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be
described solely in terms of its $x$-coordinate $P_x$, which can be therefore
used to parameterize all its multiples $nP$. We refer to the coefficient of
$(P_x)^i$ in the parameterization of $(nP)_x$ as the $i$-th multiplication
polynomial. We show that this coefficient is a degree-$i$ rational polynomial
without a constant term in $n$. We also …
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Regional Leader, Cyber Crisis Communications
@ Google | United Kingdom
Regional Intelligence Manager, Compliance, Safety and Risk Management
@ Google | London, UK
Senior Analyst, Endpoint Security
@ Scotiabank | Toronto, ON, CA, M1K5L1
Software Engineer, Security/Privacy, Google Cloud
@ Google | Bengaluru, Karnataka, India
Senior Security Engineer
@ Coinbase | Remote - USA