default search action
Dag Arne Osvik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i7]Dag Arne Osvik, David Canright:
A More Compact AES, and More. IACR Cryptol. ePrint Arch. 2024: 1076 (2024)
2010 – 2019
- 2012
- [b1]Dag Arne Osvik:
Faster Software Cryptography. EPFL, Switzerland, 2012 - [j2]Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé
, Pascal Jermini, Michela Thiémard, Paul C. Leyland, Peter L. Montgomery, Andrey Timofeev, Heinz Stockinger
A heterogeneous computing environment to solve the 768-bit RSA challenge. Clust. Comput. 15(1): 53-68 (2012) - [i6]Dag Arne Osvik:
Fast Embedded Software Hashing. IACR Cryptol. ePrint Arch. 2012: 156 (2012) - 2010
- [j1]Eran Tromer, Dag Arne Osvik, Adi Shamir:
Efficient Cache Attacks on AES, and Countermeasures. J. Cryptol. 23(1): 37-71 (2010) - [c7]Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé
Factorization of a 768-Bit RSA Modulus. CRYPTO 2010: 333-350 - [c6]Dag Arne Osvik, Joppe W. Bos, Deian Stefan, David Canright:
Fast Software AES Encryption. FSE 2010: 75-93 - [i5]Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann:
Factorization of a 768-bit RSA modulus. IACR Cryptol. ePrint Arch. 2010: 6 (2010)
2000 – 2009
- 2009
- [c5]Marc Stevens
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. CRYPTO 2009: 55-69 - [c4]David Canright, Dag Arne Osvik:
A More Compact AES. Selected Areas in Cryptography 2009: 157-169 - [i4]Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger:
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. IACR Cryptol. ePrint Arch. 2009: 111 (2009) - [i3]Joppe W. Bos, Dag Arne Osvik, Deian Stefan:
Fast Implementations of AES on Various Platforms. IACR Cryptol. ePrint Arch. 2009: 501 (2009) - 2007
- [c3]Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik:
A Kilobit Special Number Field Sieve Factorization. ASIACRYPT 2007: 1-12 - [i2]Kazumaro Aoki, Jens Franke, Thorsten Kleinjung, Arjen K. Lenstra, Dag Arne Osvik:
A kilobit special number field sieve factorization. IACR Cryptol. ePrint Arch. 2007: 205 (2007) - 2006
- [c2]Dag Arne Osvik, Adi Shamir, Eran Tromer:
Cache Attacks and Countermeasures: The Case of AES. CT-RSA 2006: 1-20 - 2005
- [i1]Dag Arne Osvik, Adi Shamir, Eran Tromer:
Cache attacks and Countermeasures: the Case of AES. IACR Cryptol. ePrint Arch. 2005: 271 (2005) - 2000
- [c1]Dag Arne Osvik:
Speeding up Serpent. AES Candidate Conference 2000: 317-329
Coauthor Index
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-08-03 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: