Barrett reduction

In modular arithmetic, Barrett reduction is a reduction algorithm introduced in 1986 by P.D. Barrett. A naive way of computing would be to use a fast… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2003-2017
01220032017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2017
2017
With Fully Homomorphic Encryption (FHE), it is possible to process encrypted data without having an access to the private-key… (More)
  • table 1
  • table 3
  • figure 1
  • figure 2
Is this relevant?
2016
2016
Isogeny based post-quantum cryptography is one of the most recent addition to the family of quantum resistant cryptosystems. In… (More)
Is this relevant?
2013
2013
Because wireless sensor network (WSN), which is composed of a large number of low-cost and resource-constrained devices… (More)
  • table I
  • table II
  • table III
  • figure 1
  • figure 3
Is this relevant?
2011
2011
We present modular reduction algorithms over finite fields of large characteristic that allow the use of redundant modular… (More)
  • figure 1
  • table 1
Is this relevant?
2011
2011
Flexibility in implementation of the underlying field algebra kernels often dictates the life-span of an Elliptic Curve… (More)
  • figure I
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2011
2011
This paper presents a new modular multiplication algorithm that allows one to implement modular multiplications efficiently. It… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
This paper focuses on the design and implementation of a fast reconfigurable method for elliptic curve cryptography acceleration… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
Is this relevant?
2005
2005
This paper proposes a novel processor architecture that provides a reconfigurable computing platform for modular exponentiation… (More)
  • figure 6
  • table I
  • figure 7
  • table II
  • figure 8
Is this relevant?
2003
2003
Most practical public-key cryptosystems are based on modular exponentiation. A modular exponentiation is composed of repeated… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table I
Is this relevant?