Related papers: On oriented supersingular elliptic curves

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…

By a convenient reparametrisation of the integral curves of a nonlinear ordinary differential equation (ODE), we are able to improve the conclusions of the recent contribution [A. Constantin, Proc. Japan Acad. {\bf 86(A)} (2010), 41--44].…

Robustness is a fundamental aspect for developing safe and trustworthy models, particularly when they are deployed in the open world. In this work we analyze the inherent capability of one-stage object detectors to robustly operate in the…

In this paper we study the oriented swap process on the positive integers and its asymptotic properties. Our results extend a theorem by Angel, Holroyd, and Romik regarding the trajectories of particles in the finite oriented swap process.…

We show that the strongly regular graph on non-isotropic points of one type of the polar spaces of type $U(n, 2)$, $O(n, 3)$, $O(n, 5)$, $O^+(n, 3)$, and $O^-(n, 3)$ are not determined by its parameters for $n \geq 6$. We prove this by…

Let $n>1$ be an integer such that $X_{0}\!\left( n\right) $ has genus $0$, and let $K$ be a field of characteristic $0$ or relatively prime to $6n$. In this article, we explicitly classify the isogeny graphs of all rational elliptic curves…

Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications, in particular, as an essential building block for two-party and multi-party computation. We construct a round-optimal (2 rounds)…

Given an elliptic curve E over a field of positive characteristic p, we consider how to efficiently determine whether E is ordinary or supersingular. We analyze the complexity of several existing algorithms and then present a new approach…

An elliptic curve-based signcryption scheme is introduced in this paper that effectively combines the functionalities of digital signature and encryption, and decreases the computational costs and communication overheads in comparison with…

Measurement-device-independent quantum key distribution (MDIQKD) is a revolutionary protocol since it is physically immune to all attacks on the detection side. However, the protocol still keeps the strict assumptions on the source side…

In this paper we present a new primitive for a key exchange protocol based on multivariate non-commutative polynomial rings, analogous to the classic Diffie-Hellman method. Our technique extends the proposed scheme of Boucher et al. from…

We consider finite graphs whose vertexes are supersingular elliptic curves, possibly with level structure, and edges are isogenies. They can be applied to the study of modular forms and to isogeny based cryptography. The main result of this…

We design and analyze a Hybrid High-Order (HHO) method on unfitted meshes to approximate elliptic interface problems. The curved interface can cut through the mesh cells in a very general fashion. As in classical HHO methods, the present…

The problem of computing an explicit isogeny between two given elliptic curves over F_q, originally motivated by point counting, has recently awaken new interest in the cryptology community thanks to the works of Teske and Rostovstev &…

In his previous papers (Math. Res. Letters 7 (2000), 123--13; Progress in Math. 195 (2001), 473--490; Math. Res. Letters 8 (2001), 429--435; Moscow Math. J. 2 (2002), issue 2, 403-431; Proc. Amer. Math. Soc. 131 (2003), no. 1, 95--102) the…

We unconditionally determine $I_\Q(d)$, the set of possible prime degrees of cyclic $K$-isogneies of elliptic curves with $\Q$-rational $j$-invariants and without complex multiplication over number fields $K$ of degree $\leq d$, for $d\leq…

We present an oblivious transfer scheme that extends the proposal made by Barreto, Oliveira and Benits, based in isogenies supersingular elliptic curves, to the setting of principally polarized supersingular abelian surfaces.

We demonstrate a simple, statistically secure, ORAM with computational overhead $\tilde{O}(\log^2 n)$; previous ORAM protocols achieve only computational security (under computational assumptions) or require $\tilde{\Omega}(\log^3 n)$…

Quantum key distribution(QKD) is one of the most significant areas in quantum information theory. For nearly four decades, substantial QKD schemes are developed. In early years, the security of QKD protocols is depend on switching different…

Although random sequences can be used to generate probability events, they come with the risk of cheating in an unsupervised situation. In such cases, the oblivious transfer protocol may be used and this paper presents a variation to the DH…