![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Karl Rubin
Person information
- affiliation: University of California, Irvine, Mathematics Department, USA
- award: Presidential Young Investigator Award
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j6]Barry Mazur, Karl Rubin:
Arithmetic Conjectures Suggested by the Statistical Behavior of Modular Symbols. Exp. Math. 32(4): 657-672 (2023) - 2010
- [j5]Karl Rubin, Alice Silverberg:
Choosing the correct elliptic curve in the CM method. Math. Comput. 79(269): 545-561 (2010) - 2009
- [j4]Karl Rubin, Alice Silverberg:
Using Abelian Varieties to Improve Pairing-Based Cryptography. J. Cryptol. 22(3): 330-364 (2009) - 2008
- [j3]Karl Rubin, Alice Silverberg:
Compression in Finite Fields and Torus-Based Cryptography. SIAM J. Comput. 37(5): 1401-1428 (2008) - 2001
- [j2]Karl Rubin, Alice Silverberg:
Rank Frequencies for Quadratic Twists of Elliptic Curves. Exp. Math. 10(4): 559-569 (2001) - 2000
- [j1]Karl Rubin, Alice Silverberg:
Ranks of Elliptic Curves in Families of Quadratic Twists. Exp. Math. 9(4): 583-590 (2000)
Conference and Workshop Papers
- 2005
- [c4]Marten van Dijk
, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff:
Practical Cryptography in High Dimensional Tori. EUROCRYPT 2005: 234-250 - 2004
- [c3]Karl Rubin, Alice Silverberg:
Using Primitive Subgroups to Do More with Fewer Bits. ANTS 2004: 18-41 - 2003
- [c2]Karl Rubin, Alice Silverberg:
Torus-Based Cryptography. CRYPTO 2003: 349-365 - 2002
- [c1]Karl Rubin, Alice Silverberg:
Supersingular Abelian Varieties in Cryptology. CRYPTO 2002: 336-353
Informal and Other Publications
- 2009
- [i6]Dan Boneh, Karl Rubin, Alice Silverberg:
Finding composite order ordinary elliptic curves using the Cocks-Pinch method. IACR Cryptol. ePrint Arch. 2009: 533 (2009) - 2007
- [i5]Karl Rubin, Alice Silverberg:
Choosing the correct elliptic curve in the CM method. IACR Cryptol. ePrint Arch. 2007: 253 (2007) - 2004
- [i4]Karl Rubin, Alice Silverberg:
Using primitive subgroups to do more with fewer bits. IACR Cryptol. ePrint Arch. 2004: 87 (2004) - [i3]Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff:
Practical Cryptography in High Dimensional Tori. IACR Cryptol. ePrint Arch. 2004: 352 (2004) - 2003
- [i2]Karl Rubin, Alice Silverberg:
Torus-based cryptography. IACR Cryptol. ePrint Arch. 2003: 39 (2003) - 2002
- [i1]Karl Rubin, Alice Silverberg:
The best and worst of supersingular abelian varieties in cryptology. IACR Cryptol. ePrint Arch. 2002: 6 (2002)
Coauthor Index
![](https://dblp1.uni-trier.de/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-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint