Related papers: Fast algorithms for computing isogenies between or…
Elliptic curve cryptography has received great attention in recent years due to its high resistance against modern cryptanalysis. The aim of this article is to present efficient generators to generate substitution boxes (S-boxes) and pseudo…
In 2012 Driemel et al. \cite{DBLP:journals/dcg/DriemelHW12} introduced the concept of $c$-packed curves as a realistic input model. In the case when $c$ is a constant they gave a near linear time $(1+\varepsilon)$-approximation algorithm…
In the past two decades, Elliptic Curve Cryptography (ECC) have become increasingly advanced. ECC, with much smaller key sizes, offers equivalent security when compared to other asymmetric cryptosystems. In this survey, an comprehensive…
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time quantum adversary. Our problem,…
We work out the complete descent via 4-isogeny for a family of rational elliptic curves with a rational point of order 4; such a family is of the form $y^2 + x y + a y = x^3 + a x^2$ where $\sqrt{-a} \in \mathbb Q^\times$. In the process we…
Biclustering, also known as co-clustering or two-way clustering, simultaneously partitions the rows and columns of a data matrix to reveal submatrices with coherent patterns. Incorporating background knowledge into clustering to enhance…
Computation of Gauss's arithmetic-geometric mean involves iteration of a simple step, whose algebro-geometric interpretation is the construction of an elliptic curve isogenous to a given one, specifically one whose period is double the…
$ \newcommand{\cclass}[1]{{\textsf{#1}}} $The classical Grothendieck inequality has applications to the design of approximation algorithms for $\cclass{NP}$-hard optimization problems. We show that an algorithmic interpretation may also be…
This paper considers the problem of cardinality estimation in data stream applications. We present a statistical analysis of probabilistic counting algorithms, focusing on two techniques that use pseudo-random variates to form…
An usual problem in statistics consists in estimating the minimizer of a convex function. When we have to deal with large samples taking values in high dimensional spaces, stochastic gradient algorithms and their averaged versions are…
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 $\mathbb{F}_{p^2}$, if an imaginary quadratic order $O$…
The procedure of Least Square-Errors curve fitting is extensively used in many computer applications for fitting a polynomial curve of a given degree to approximate a set of data. Although various methodologies exist to carry out curve…
This thesis presents important insights and concepts related to the topic of the extraction of geometric primitives from the edge contours of digital images. Three specific problems related to this topic have been studied, viz., polygonal…
Let $E_{\lambda}$ be the Legendre family of elliptic curves with equation $Y^2=X(X-1)(X-\lambda)$. Given a curve $\mathcal{C}$, satisfying a condition on the degrees of some of its coordinates and parametrizing $m$ points $P_1, \ldots, P_m…
Elliptic homogenization is used to determine coarse-grained properties of materials with features on small scales for heat transfer and elasticity. When microstructural features of a material have rapid, periodic fluctuations, the solution…
We consider a misspecified optimization problem that requires minimizing a function f(x;q*) over a closed and convex set X where q* is an unknown vector of parameters that may be learnt by a parallel learning process. In this context, We…
This paper analyzes the random fluctuations obtained by a heterogeneous multi-scale first-order finite element method applied to solve elliptic equations with a random potential. We show that the random fluctuations of such solutions are…
The Weil pairing on elliptic curves has deep links with discrete logarithm problems. In practice, to better suit the functionalities of cryptosystems, one often needs to modify the original Weil pairing via what is called a distortion map.…
Given two simplicial complexes in R^d, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the Fr\'echet distance between these curves is minimized. As a polygonal…
Building on existing algorithms and results, we offer new insights and algorithms for various problems related to detecting maximal and maximum bicliques. Most of these results focus on graphs with small maximum degree, providing improved…