An Alternative Approach for Computing Discrete Logarithms in Compressed SIDH

11/19/2021
by   Kaizhan Lin, et al.
0

Currently, public-key compression of supersingular isogeny Diffie-Hellman (SIDH) and its variant, supersingular isogeny key encapsulation (SIKE) involve pairing computation and discrete logarithm computation. In this paper, we propose novel methods to compute only 3 discrete logarithms instead of 4, in exchange for computing a lookup table efficiently. The algorithms also allow us to make a trade-off between memory and efficiency. Our implementation shows that the efficiency of our algorithms is close to that of the previous work, and our algorithms perform better in some special cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/11/2018

Computing discrete Morse complexes from simplicial complexes

We consider the problem of efficiently computing a discrete Morse comple...
research
08/02/2021

Analysing digital in-memory computing for advanced finFET node

Digital In-memory computing improves energy efficiency and throughput of...
research
06/27/2012

Scaling Up Coordinate Descent Algorithms for Large ℓ_1 Regularization Problems

We present a generic framework for parallel coordinate descent (CD) algo...
research
10/07/2021

Computing eigenfunctions of the multidimensional Ornstein-Uhlenbeck operator

We discuss approaches to computing eigenfunctions of the Ornstein–Uhlenb...
research
10/31/2022

Adaptive Compression for Communication-Efficient Distributed Training

We propose Adaptive Compressed Gradient Descent (AdaCGD) - a novel optim...
research
10/03/2019

Orbit Computation for Atomically Generated Subgroups of Isometries of Z^n

Isometries and their induced symmetries are ubiquitous in the world. Tak...
research
06/11/2020

Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment

We report on two new records: the factorization of RSA-240, a 795-bit nu...

Please sign up or login with your details

Forgot password? Click here to reset