Double-speed Barrett moduli
From MaRDI portal
Publication:2803625
DOI10.1007/978-3-662-49301-4_10zbMATH Open1405.94065OpenAlexW2402351132MaRDI QIDQ2803625FDOQ2803625
Authors: Rémi Géraud, Diana Maimut, David Naccache 
Publication date: 2 May 2016
Published in: The New Codebreakers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49301-4_10
Recommendations
- An improvement of the Barrett modular reduction algorithm
- scientific article; zbMATH DE number 1024055
- Multiplication on large simple modules based on Barrett's minimally redundant modular scheme
- Speeding up bipartite modular multiplication
- Efficient modular reduction algorithm in \(\mathbb F_q[x]\) and its application to ``left to right modular multiplication in \(\mathbb F_2[x]\).
Cites Work
- Title not available (Why is that?)
- A method for obtaining digital signatures and public-key cryptosystems
- Modular Multiplication Without Trial Division
- Title not available (Why is that?)
- Title not available (Why is that?)
- On RSA moduli with prescribed bit patterns
- Short RSA keys and their generation
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- Title not available (Why is that?)
Cited In (5)
- Barberpole tempo illusions
- Exact duality transformations for sigma models and gauge theories
- A geometric renormalization group in discrete quantum space–time
- An improvement of the Barrett modular reduction algorithm
- Multiplication on large simple modules based on Barrett's minimally redundant modular scheme
This page was built for publication: Double-speed Barrett moduli
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803625)
