Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 2018
- Jean-Claude Bajard, Julien Eynard, Nabil Merkiche:
Montgomery reduction within the context of residue number system arithmetic. J. Cryptogr. Eng. 8(3): 189-200 (2018) - Craig Costello, Benjamin Smith:
Montgomery curves and their arithmetic - The case of large characteristic fields. J. Cryptogr. Eng. 8(3): 227-240 (2018) - Wangchen Dai, Ray C. C. Cheung:
Spectral arithmetic in Montgomery modular multiplication. J. Cryptogr. Eng. 8(3): 211-226 (2018) - Martin Schramm, Reiner Dojen, Michael Heigl:
A Vendor-Neutral Unified Core for Cryptographic Operations in GF(p) and GF(sm) Based on Montgomery Arithmetic. Secur. Commun. Networks 2018: 4983404:1-4983404:18 (2018) - 2017
- Craig Costello, Benjamin Smith:
Montgomery curves and their arithmetic. CoRR abs/1703.01863 (2017) - Joppe W. Bos, Peter L. Montgomery:
Montgomery Arithmetic from a Software Perspective. IACR Cryptol. ePrint Arch. 2017: 1057 (2017) - Craig Costello, Benjamin Smith:
Montgomery curves and their arithmetic: The case of large characteristic fields. IACR Cryptol. ePrint Arch. 2017: 212 (2017) - Michael Meyer, Steffen Reith, Fabio Campos:
On hybrid SIDH schemes using Edwards and Montgomery curve arithmetic. IACR Cryptol. ePrint Arch. 2017: 1213 (2017) - 2013
- Jean-Claude Bajard, Julien Eynard, Filippo Gandino:
Fault Detection in RNS Montgomery Modular Multiplication. IEEE Symposium on Computer Arithmetic 2013: 119-126 - 2012
- Dimitrios Schinianakis, Alexander Skavantzos, Thanos Stouraitis:
GF(2n) Montgomery multiplication using Polynomial Residue Arithmetic. ISCAS 2012: 3033-3036 - 2011
- Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery:
Efficient SIMD Arithmetic Modulo a Mersenne Number. IEEE Symposium on Computer Arithmetic 2011: 213-221 - Filippo Gandino, Fabrizio Lamberti, Paolo Montuschi, Jean-Claude Bajard:
A General Approach for Improving RNS Montgomery Exponentiation Using Pre-processing. IEEE Symposium on Computer Arithmetic 2011: 195-204 - David Kohel:
Arithmetic of Split Kummer Surfaces: Montgomery Endomorphism of Edwards Products. IWCC 2011: 238-245 - Antonio de la Piedra, Abdellah Touhafi, Gianluca Cornetta:
Cryptographic accelerator for 802.15.4 transceivers with key agreement engine based on Montgomery arithmetic. SCVT 2011: 1-5 - Çetin Kaya Koç:
Montgomery Arithmetic. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 799-803 - 2010
- Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery:
Efficient SIMD arithmetic modulo a Mersenne number. IACR Cryptol. ePrint Arch. 2010: 338 (2010) - 2008
- Wouter Castryck, Steven D. Galbraith, Reza Rezaeian Farashahi:
Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation. IACR Cryptol. ePrint Arch. 2008: 218 (2008) - 2007
- Jaewook Chung, M. Anwar Hasan:
Montgomery Reduction Algorithm for Modular Multiplication Using Low-Weight Polynomial Form Integers. IEEE Symposium on Computer Arithmetic 2007: 230-239 - Kamel Bentahar, Nigel P. Smart:
Efficient 15, 360-bit RSA Using Woop-Optimised Montgomery Arithmetic. IMACC 2007: 346-363 - 2005
- Jean-Claude Bajard, Laurent Imbert, Graham A. Jullien:
Parallel Montgomery Multiplication in GF(2k) Using Trinomial Residue Arithmetic. IEEE Symposium on Computer Arithmetic 2005: 164-171 - David Money Harris, Ram Krishnamurthy, Mark A. Anders, Sanu Mathew, Steven Hsu:
An Improved Unified Scalable Radix-2 Montgomery Multiplier. IEEE Symposium on Computer Arithmetic 2005: 172-178 - Çetin Kaya Koç, Colin D. Walter:
Montgomery Arithmetic. Encyclopedia of Cryptography and Security 2005 - 2004
- Dan Page, Nigel P. Smart:
Parallel Cryptographic Arithmetic Using a Redundant Montgomery Representation. IEEE Trans. Computers 53(11): 1474-1482 (2004) - Jean-Claude Bajard, Laurent Imbert, Graham A. Jullien:
Parallel Montgomery Multiplication in GF(2k) using Trinomial Residue Arithmetic. IACR Cryptol. ePrint Arch. 2004: 279 (2004) - 2003
- Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery:
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. CT-RSA 2003: 343-354 - 1999
- Thomas Blum:
Montgomery Modular Exponentiation on Reconfigurable Hardware. IEEE Symposium on Computer Arithmetic 1999: 70-77 - 1997
- Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup:
An IWS Montgomery Modular Multiplication Algorithm. IEEE Symposium on Computer Arithmetic 1997: 234-239
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-12 14:03 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint