![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
James A. Muir
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [i5]James A. Muir:
A Tutorial on White-box AES. IACR Cryptol. ePrint Arch. 2013: 104 (2013)
2000 – 2009
- 2009
- [j7]James A. Muir, Paul C. van Oorschot
:
Internet geolocation: Evasion and counterevasion. ACM Comput. Surv. 42(1): 4:1-4:23 (2009) - [j6]Clemens Heuberger, James A. Muir:
Unbalanced digit sets and the closest choice strategy for minimal weight integer representations. Des. Codes Cryptogr. 52(2): 185-208 (2009) - 2008
- [i4]Clemens Heuberger, James A. Muir:
Unbalanced Digit Sets and the Closest Choice Strategy for Minimal Weight Integer Representations. IACR Cryptol. ePrint Arch. 2008: 135 (2008) - 2007
- [j5]Clemens Heuberger, James A. Muir:
Minimal weight and colexicographically minimal integer representations. J. Math. Cryptol. 1(4): 297-328 (2007) - [j4]James A. Muir:
A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-r Representations. IEEE Trans. Inf. Theory 53(3): 1234-1241 (2007) - 2006
- [j3]James A. Muir, Douglas R. Stinson:
On the low hamming weight discrete logarithm problem for nonadjacent representations. Appl. Algebra Eng. Commun. Comput. 16(6): 461-472 (2006) - [j2]James A. Muir, Douglas R. Stinson:
Minimality and other properties of the width-w nonadjacent form. Math. Comput. 75(253): 369-384 (2006) - [c5]James A. Muir:
Seifert's RSA Fault Attack: Simplified Analysis and Generalizations. ICICS 2006: 420-434 - [i3]James A. Muir:
A Simple Left-to-Right Algorithm for the Computation of the Arithmetic Weight of Integers. IACR Cryptol. ePrint Arch. 2006: 8 (2006) - [i2]Clemens Heuberger, James A. Muir:
Minimal Weight and Colexicographically Minimal Integer Representations. IACR Cryptol. ePrint Arch. 2006: 209 (2006) - 2005
- [j1]James A. Muir, Douglas R. Stinson:
Alternative Digit Sets for Nonadjacent Representations. SIAM J. Discret. Math. 19(1): 165-191 (2005) - [c4]James A. Muir, Douglas R. Stinson:
New Minimal Weight Representations for Left-to-Right Window Methods. CT-RSA 2005: 366-383 - [i1]James A. Muir:
Seifert's RSA Fault Attack: Simplified Analysis and Generalizations. IACR Cryptol. ePrint Arch. 2005: 458 (2005) - 2003
- [c3]James A. Muir, Douglas R. Stinson:
Alternative Digit Sets for Nonadjacent Representations. Selected Areas in Cryptography 2003: 306-319
1990 – 1999
- 1991
- [c2]James A. Muir:
It's out there, somewhere..., but what's available, and how can I access it? SIGUCCS 1991: 247-253
1980 – 1989
- 1986
- [c1]James A. Muir:
A successful user services generated campus master plan. SIGUCCS 1986: 391-398
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint