Results 1 to 10 of about 38,603 (168)
Constructing Cycles in Isogeny Graphs of Supersingular Elliptic Curves [PDF]
Loops and cycles play an important role in computing endomorphism rings of supersingular elliptic curves and related cryptosystems. For a supersingular elliptic curve E defined over đť”˝p2, if an imaginary quadratic order O can be embedded in End(E) and a ...
Xiao Guanju, Luo Lixia, Deng Yingpu
doaj +5 more sources
Finding orientations of supersingular elliptic curves and quaternion orders [PDF]
An oriented supersingular elliptic curve is a curve which is enhanced with the information of an endomorphism. Computing the full endomorphism ring of a supersingular elliptic curve is a known hard problem, so one might consider how hard it is to find ...
Sarah Arpin+5 more
semanticscholar +7 more sources
One option for a digital signature solution for devices with low memory and low bandwidth transmission over channels uses a short digital signature scheme based on Weil bilinear pairing aimed at short processing times, fast computation, and convenient ...
Nhu-Quynh Luc+2 more
doaj +2 more sources
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main technical idea in our scheme is that we transmit the images of torsion bases
De Feo Luca, Jao David, Plût Jérôme
doaj +2 more sources
An Efficient Signature Scheme From Supersingular Elliptic Curve Isogenies
Since supersingular elliptic curve isogenies are one of the several candidate sources of hardness for building post-quantum cryptographic primitives, the research of efficient signature schemes based on them is still a hot topic.
Yan Huang+3 more
doaj +2 more sources
Several research works propose the use of Elliptic Curve Cryptography (ECC) to provide security for the Internet of Things (IoT) and cloud computing due to its shorter key requirement of approximately 160-571 bits vs.
Zakaria Abukari+2 more
openalex +3 more sources
Pairing-based cryptography has realized a lot of innovative cryptographic applications such as attribute-based cryptography and semi homomorphic encryption.
Yasuyuki Nogami+4 more
openalex +3 more sources
Let $$E/\mathbb {Q}$$ E / Q be an elliptic curve ...
Ben Forrás, Katharina Müller
openalex +2 more sources
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems [PDF]
Eric R. Verheul
openalex +2 more sources
A remark on the characteristic elements of anticyclotomic Selmer groups of elliptic curves with complex multiplication at supersingular primes [PDF]
Let $p\ge5$ be a prime number. Let $E/\mathbb{Q}$ be an elliptic curve with complex multiplication by an imaginary quadratic field K such that p is inert in K and that E has good reduction at p.
Antonio Lei
semanticscholar +1 more source