Related papers: Mathematics of Isogeny Based Cryptography

Envelopes of parameterized families of plane curves is an important topic, both for the mathematics involved and for its applications. Nowadays, it is generally studied in a technology-rich environment, and automated methods are developed…

This book arises from the need to provide a clear and up-to-date overview of the impacts of quantum computing on cryptography. The goal is to provide a reference in Portuguese for undergraduate, master's, and doctoral students in the field…

We propose an algorithm that calculates isogenies between elliptic curves defined over an extension $K$ of $\mathbb{Q}_2$. It consists in efficiently solving with a logarithmic loss of $2$-adic precision the first order differential…

In this paper, we use the hardness of quantization over general lattices as the basis of developing a physical layer secrecy system. Assuming that the channel state observed by the legitimate receiver and the eavesdropper are distinct, this…

Descent via an isogeny on an elliptic curve is used to construct two subrings of the field of rational numbers, which are complementary in a strong sense, and for which Hilbert's Tenth Problem is undecidable. This method further develops…

What should these lectures be? The subject assigned to us is so broad that many books can be written about it. So, in planning these lectures I had several options. One would be to focus on a narrow subset of topics and to cover them in…

We introduce and study arithmetic spin structures on elliptic curves. We show that there is a unique isogeny class of elliptic curves over $\F_{p^2}$ which carries a unique arithmetic spin structure and provides a geometric object of weight…

An algorithm is presented that in context of public key use of Elliptic Curve Cryptography allows discovery of the private key in worst case O(n).

These notes originated in a series of lectures I gave in Marseille in May, 2013. I was invited to give an introduction to the isomorphism theorems, originating with Dynkin, which connect Markov local times and Gaussian processes. This is an…

Molecular graphs generally contain subgraphs (known as groups) that are identifiable and significant in composition, functionality, geometry, etc. Flat latent representations (node embeddings or graph embeddings) fail to represent, and…

The goal of this chapter is to present a survey of homomorphic encryption techniques and their applications. After a detailed discussion on the introduction and motivation of the chapter, we present some basic concepts of cryptography. The…

In this paper we propose a novel approach to aperiodic order in optical science and technology that leverages the intrinsic structural complexity of certain non-polynomial (hard) problems in number theory and cryptography for the…

I apply the algebraic framework developed in arXiv:1101.4542 to study geometry of elliptic spaces in 1, 2, and 3 dimensions. The background material on projectivised Clifford algebras and their application to Cayley-Klein geometries is…

The aim of this short lecture series is to expose the students to the beautiful theory of lattices by, on one hand, demonstrating various basic ideas that appear in this theory and, on the other hand, formulating some of the celebrated…

We propose a decision procedure for analysing security of quantum cryptographic protocols, combining a classical algebraic rewrite system for knowledge with an operational semantics for quantum distributed computing. As a test case, we use…

In the last few years there has been a growing interest towards methods for statistical inference and learning based on computational geometry and, notably, tropical geometry, that is, the study of algebraic varieties over the min-plus…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

We provide an explicit and algorithmic version of a theorem of Momose classifying isogenies of prime degree of elliptic curves over number fields, which we implement in Sage and PARI/GP. Combining this algorithm with recent work of…

In this paper we study the security of a proposal for Post-Quantum Cryptography from both a number theoretic and cryptographic perspective. Charles-Goren-Lauter in 2006 [CGL06] proposed two hash functions based on the hardness of finding…

We use machine learning to study the moduli space of genus two curves, specifically focusing on detecting whether a genus two curve has $(n, n)$-split Jacobian. Based on such techniques, we observe that there are very few rational moduli…