Searching for "Fast Modular Reduction." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

14 documents found, showing 1 through 10. Next 10 →

Fast Modular Reduction
by William Hasenplaugh, Gunnar Gaubatz, Vinodh Gopal
…Fast Modular Reduction William Hasenplaugh, Gunnar Gaubatz, Vinodh Gopal Intel {william…
Add To MetaCart

Fast Modular Reduction With Precomputation
by Chae Hoon Lim, Hyo Sun Hwang, Pil Joong Lee — In Proceedings of Korea-Japan Joint Workshop on Information Security and Cryptology, Lecture
…Fast Modular Reduction With Precomputation Chae Hoon Lim, Hyo Sun Hwang Inform. & Commun. Research…
Cited by 1 (0 self) – Add To MetaCart

Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms
by A Major, Daniel Bailey, Professor Christof Paar — 1998
… . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 6 Fast Subfield Multiplication 10 6.1 Fast Modular Reduction…
Add To MetaCart

Elliptic Curve Cryptography On Smart Cards Without Coprocessors
by Adam D. Woodbury, Daniel V. Bailey, Christof Paar — 2000 — In IFIP CARDIS 2000, Fourth Smart Card Research and Advanced Application Conference
… of OEFs is due to fast modular reduction in the subfield. Given a prime, p = 2 n -c, reduction…
Cited by 28 (10 self) – Add To MetaCart

Elliptic Curve Cryptography On Smart Cards Without Coprocessors
by Adam Woodbury Electrical, Adam D. Woodbury, Daniel V. Bailey, Christof Paar — 2000 — In IFIP CARDIS 2000, Fourth Smart Card Research and Advanced Application Conference
… is due to fast modular reduction in the subfield. Given a prime, p =2 n −c, reduction is performed…
Add To MetaCart

Computation in Optimal Extension Fields
by Daniel V. Bailey, Dr. Christof, Paar Dr, Gabor Sarkozy, Dr. Micha Hofri, Department Head — 2000 — Conference on The Mathematics of Public Key Cryptography, The Fields Institute for Research in the Mathematical Sciences
… . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.2.1 Extension Field Modular Reduction . . . . . . . . . . . . . . . 10 4.2.2 Fast Subfield…
Cited by 4 (3 self) – Add To MetaCart

Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms
by Daniel V. Bailey, Christof Paar — 1998
… known that fast modular reduction is possible with moduli of the form 2 n ± c, wherecis a “small…
Cited by 50 (11 self) – Add To MetaCart

NTRU in Constrained Services
by Daniel V. Bailey, Daniel Coffin, Daniel Con, Adam Elbirt, Adam D. Woodbury, Joseph H. Silverman, Andadam D — 2001
…-limiting factor is Algorithm 1's use of circular array indexing for fast modular reduction. Since the Dragonball…
Add To MetaCart

Generating Efficient Primes for Discrete Log Cryptosystems
by Chae Hoon Lim, Pil Joong Lee
… of primes is discussed in Section 5 and finally we conclude in Section 6. 2 Fast Modular Reduction with a DR…
Cited by 1 (1 self) – Add To MetaCart

Generalized Mersenne Numbers
by Jerome A. Solinas — 1999
…): We have thus found our rule for fast modular reduction. Explicitly, the rule is this: (3) 5 X j=0…
Cited by 28 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB