Related papers: The Q-curve construction for endomorphism-accelera…
Whilst many key exchange and digital signature systems still rely on NIST P-256 (secp256r1) and secp256k1, offering around 128-bit security, there is an increasing demand for transparent and reproducible curves at the 256-bit security…
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…
A new approach to discretization of the Duffing equation is presented. Integrable discrete maps are obtained by using well-studied encrypting operations in elliptic curve cryptography and, therefore, they do not depend upon standard small…
We develop a graph-theoretic algorithm to compute the $\varphi$-Selmer group of the elliptic curve $E_b: y^2 = x^3 + bx$ over $\mathbb{Q}(i)$, where $b \in \mathbb{Z}[i]$ and $\varphi$ is a degree 2 isogeny of $E_b$. We associate to $E_b$ a…
A directly public verifiable signcryption scheme is introduced in this paper that provides the security attributes of message confidentiality, authentication, integrity, non-repudiation, unforgeability, and forward secrecy of message…
High-fidelity entangling gates are essential for quantum computation. Currently, most approaches to designing such gates are based either on simple, analytical pulse waveforms or on ones obtained from numerical optimization techniques. In…
We determine, for an elliptic curve $E/\mathbb{Q}$, all the possible torsion groups $E(K)_{tors}$, where $K$ is the compositum of all $\mathbb{Z}_{p}$-extensions of $\mathbb{Q}$. Furthermore, we prove that for an elliptic curve…
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
The supersingular Endomorphism Ring problem is the following: given a supersingular elliptic curve, compute all of its endomorphisms. The presumed hardness of this problem is foundational for isogeny-based cryptography. The One Endomorphism…
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
Public-key cryptography algorithms, especially elliptic curve cryptography (ECC) and elliptic curve digital signature algorithm (ECDSA) have been attracting attention from many researchers in different institutions because these algorithms…
This article gives an elementary computational proof of the group law for Edwards elliptic curves following Bernstein, Lange, et al., Edwards, and Friedl. The associative law is expressed as a polynomial identity over the integers that is…
In this paper we present, using the arithmetic of elliptic curves over finite fields, an algorithm for the efficient generation of a sequence of uniform pseudorandom vectors in high dimensions, that simulates a sample of a sequence of…
We present a deterministic and explicit algorithm to compute the endomorphism rings of supersingular elliptic curves. As an example we compute the endomorphism rings of all supersingular elliptic curves defined over characteristic…
We construct isotrivial and non-isotrivial elliptic curves over $\mathbb{F}_q(t)$ with an arbitrarily large set of separable integral points. As an application of this construction, we prove that there are isotrivial log-general type…
The Mordell-Weil groups $E(\mathbb{Q})$ of elliptic curves influence the structures of their quadratic twists $E_{-D}(\mathbb{Q})$ and the ideal class groups $\mathrm{CL}(-D)$ of imaginary quadratic fields. For appropriate $(u,v) \in…
Nodes of sensor networks may be resource-constrained devices, often having a limited lifetime, making sensor networks remarkably dynamic environments. Managing a cryptographic protocol on such setups may require a disproportionate effort…
The study of alternative models for elliptic curves has found recent interest from cryptographic applications, once it was recognized that such models provide more efficiently computable algorithms for the group law than the standard…
Specific quantum algorithms exist to-in theory-break elliptic curve cryptographic protocols. Implementing these algorithms requires designing quantum circuits that perform elliptic curve arithmetic. To accurately judge a cryptographic…
High-performance techniques to simulate quantum programs on classical hardware rely on exponentially large vectors to represent quantum states. When simulating quantum algorithms, the quantum states that occur are often sparse due to…