Patent Leaderboard
USPTO Patent Rankings Data through Dec 31, 2025
Home › Performing block form reductions modulo non-Mersenne primes in cryptographic protocols

Performing block form reductions modulo non-Mersenne primes in cryptographic protocols

US Patent 10218494 · Granted Feb 26, 2019

Assignee

Inventors

View full patent text on Google Patents →

More Patents by These Inventors

Broadcasting in supersingular isogeny-based cryptosystems2020
Traversing a zigzag path tree topology in a supersingular isogeny-based cryptosy2020
Traversing a zigzag path tree topology in a supersingular isogeny-based cryptosy2020
Using cryptographic co-processors in a supersingular isogeny-based cryptosystem2020
Using cryptographic co-processors in a supersingular isogeny-based cryptosystem2020
Processing batches of point evaluations in a supersingular isogeny-based cryptos2020
Processing batches of point evaluations in a supersingular isogeny-based cryptos2020
Obtaining keys from broadcasters in supersingular isogeny-based cryptosystems2020
Generating a lattice basis for lattice-based cryptography2018
Applying modular reductions in cryptographic protocols2018
Generating integers for cryptographic protocols2017