activity
20062026
most citedA new method for solving the elliptic curve discrete logarithm problem

8 citations · 32 across the 25 of their papers we have counts for

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.CR2019

Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling

Upendra Kapshikar, Ayan Mahalanobis

McEliece and Niederreiter cryptosystems are robust and versatile cryptosystems. These cryptosystems work with many linear error-correcting codes. They are popular these days becaus…