Related papers: Efficient ECM factorization in parallel with the L…

Elliptic Curve Cryptography (ECC) is widely accepted for ensuring secure data exchange between resource-limited IoT devices. The National Institute of Standards and Technology (NIST) recommended implementation, such as B-163, is…

Sparsity has been widely recognized as crucial for efficient optimization in graph-based SLAM. Because the sparsity and structure of the SLAM graph reflect the set of incorporated measurements, many methods for sparsification have been…

This paper describes a 2-D graphics algorithm that uses shifts and adds to precisely plot a series of points on an ellipse of any shape and orientation. The algorithm can also plot an elliptic arc that starts and ends at arbitrary angles.…

Elliptic curves are planar curves which can be used to define an abelian group. The efficient computation of discrete logarithms over this group is a longstanding problem relevant to cryptography. It may be possible to efficiently compute…

This paper introduces Elliptic Curve Modulation (ECM), a novel modulation scheme that can be leveraged to effectively shuffle transmitted data while maintaining symbol error probability (SEP) performance equivalent to unencrypted systems.…

In the present paper we provide a probabilistic polynomial time algorithm that reduces the complete factorization of any squarefree integer $n$ to counting points on elliptic curves modulo $n$, succeeding with probability $1-\varepsilon$,…

Multi-scalar multiplication (MSM) is crucial in cryptographic applications and computationally intensive in zero-knowledge proofs. MSM involves accumulating the products of scalars and points on an elliptic curve over a 377-bit modulus, and…

Computation of a signal's estimated covariance matrix is an important building block in signal processing, e.g., for spectral estimation. Each matrix element is a sum of products of elements in the input matrix taken over a sliding window.…

In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…

In previous research, quantum resources were concretely estimated for solving Elliptic Curve Discrete Logarithm Problem(ECDLP). In [1], the quantum algorithm was optimized for the binary elliptic curves and the main optimization target was…

This work focuses on accelerating the multiplication of a dense random matrix with a (fixed) sparse matrix, which is frequently used in sketching algorithms. We develop a novel scheme that takes advantage of blocking and recomputation…

This paper focuses on the convergence certificates of the majorized proximal alternating minimization (PAM) method with subspace correction, proposed in \cite{TaoQianPan22} for the column $\ell_{2,0}$-norm regularized factorization model…

Let $E/\mathbb Q(t)$ be an elliptic curve and let $t_0 \in \mathbb Q$ be a rational number for which the specialization $E_{t_0}$ is an elliptic curve. Given a subgroup $M$ of $E(\mathbb Q(t))$ with mild conditions and $t_0 \in \mathbb Q$…

We present three methods for distributed memory parallel inverse factorization of block-sparse Hermitian positive definite matrices. The three methods are a recursive variant of the AINV inverse Cholesky algorithm, iterative refinement, and…

In this work we develop a simple equivalent circuit model (ECM) that predicts the spectral response of a lumped-element loaded single patterned layer reflective metasurface. The proposed ECM maintains accuracy across varying design…

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…

We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…

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…

There is an ongoing effort to develop tools that apply distributed computational resources to tackle large problems or reduce the time to solve them. In this context, the Alternating Direction Method of Multipliers (ADMM) arises as a method…

Elliptic curve cryptography (ECC) is widely used in security applications such as public key cryptography (PKC) and zero-knowledge proofs (ZKP). ECC is composed of modular arithmetic, where modular multiplication takes most of the…