Search

Your search keyword '"Osvik, Dag Arne"' showing total 22 results
Start Over Author "Osvik, Dag Arne"
22 results on '"Osvik, Dag Arne"'

1. Factorization of a 768-Bit RSA Modulus

Author

Kleinjung, Thorsten, Aoki, Kazumaro, Franke, Jens, Lenstra, Arjen K., Thomé, Emmanuel, Bos, Joppe W., Gaudry, Pierrick, Kruppa, Alexander, Montgomery, Peter L., Osvik, Dag Arne, te Riele, Herman, Timofeev, Andrey, Zimmermann, Paul, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Rabin, Tal, editor

Published
2010
Full Text
View/download PDF

2. Fast Software AES Encryption

Author

Osvik, Dag Arne, Bos, Joppe W., Stefan, Deian, Canright, David, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Hong, Seokhie, editor, and Iwata, Tetsu, editor

Published
2010
Full Text
View/download PDF

3. A More Compact AES

Author

Canright, David, Osvik, Dag Arne, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Jacobson, Michael J., Jr., editor, Rijmen, Vincent, editor, and Safavi-Naini, Reihaneh, editor

Published
2009
Full Text
View/download PDF

4. Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate

Author

Stevens, Marc, Sotirov, Alexander, Appelbaum, Jacob, Lenstra, Arjen, Molnar, David, Osvik, Dag Arne, de Weger, Benne, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Halevi, Shai, editor

Published
2009
Full Text
View/download PDF

5. A Kilobit Special Number Field Sieve Factorization

Author

Aoki, Kazumaro, Franke, Jens, Kleinjung, Thorsten, Lenstra, Arjen K., Osvik, Dag Arne, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Kurosawa, Kaoru, editor

Published
2007
Full Text
View/download PDF

6. Cache Attacks and Countermeasures: The Case of AES

Author

Osvik, Dag Arne, Shamir, Adi, Tromer, Eran, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Pointcheval, David, editor

Published
2006
Full Text
View/download PDF

9. Factorization of a 768-Bit RSA Modulus

Author

Kleinjung, Thorsten, primary, Aoki, Kazumaro, additional, Franke, Jens, additional, Lenstra, Arjen K., additional, Thomé, Emmanuel, additional, Bos, Joppe W., additional, Gaudry, Pierrick, additional, Kruppa, Alexander, additional, Montgomery, Peter L., additional, Osvik, Dag Arne, additional, te Riele, Herman, additional, Timofeev, Andrey, additional, and Zimmermann, Paul, additional

Published
2010
Full Text
View/download PDF

15. Faster Software Cryptography

Author

Osvik, Dag Arne and Lenstra, Arjen K.

Subjects
cache attacks, cryptography, bitslice, software, optimization
Abstract

This thesis presents work on the efficiency and security of cryptographic software. First it describes several efforts to construct very efficient implementations of cryptographic primitives. These include the Advanced Encryption Standard (AES) as well as several popular hash functions, spanning from the old MD5 to several candidates for the upcoming SHA-3 standard. Computer architectures considered range from low-end 8-bit microcontrollers to modern high-end graphics cards, and several key techniques for optimizing such implementations are presented. Results include compact implementations of SHA-1 and SHA-256 with reduced memory footprint and more than triple and double speed, respectively, compared with other fast implementations on the same architecture. Next it presents novel cryptanalytic attacks that can be performed on processor architectures with cache memories, like those used in modern personal computers. These belong to the category of side-channel attacks, exploiting unintended information leakage from an implementation to retrieve secret keys without having to find weaknesses in the cipher itself. The attacks even allow an unprivileged process to attack other processes running in parallel on the same processor, despite partitioning methods such as memory protection, sandboxing and virtualization. Practical results include full AES key recovery in 65ms using only write access to an encrypted partition. Finally the thesis investigates a technique for reducing the number of boolean operations required to express the AES round function, resulting in a significant improvement over previous efforts. This can be useful both for very compact AES implementations in hardware and for bitslice implementations of AES, in which software simulates many copies of the same compact hardware. Such software eliminates the table lookups exploited in cache attacks, and hence this kind of implementaton can be completely immune to them.

Published
2012
Full Text
View/download PDF

18. Fast Software AES Encryption

Author

Applied Mathematics, Osvik, Dag Arne, Bos, Joppe W., Stefan, Deian, Canright, David, Applied Mathematics, Osvik, Dag Arne, Bos, Joppe W., Stefan, Deian, and Canright, David

Abstract

This paper presents new software speed records for AES-128 encryption for architectures at both ends of the performance spectrum. On the one side we target the low-end 8-bit AVR microcontrollers and 32-bit ARM microprocessors, while on the other side of the spectrum we consider the high-performing Cell broadband engine and NVIDIA graphics processing units (GPUs). Platform specifi c techniques are detailed, explaining how the software speed records on these architectures are obtained. Additionally, this paper presents the first AES decryption implementation for GPU architectures.

Published
2010

19. A heterogeneous computing environment to solve the 768-bit RSA challenge

Author

Kleinjung, Thorsten, primary, Bos, Joppe W., additional, Lenstra, Arjen K., additional, Osvik, Dag Arne, additional, Aoki, Kazumaro, additional, Contini, Scott, additional, Franke, Jens, additional, Thomé, Emmanuel, additional, Jermini, Pascal, additional, Thiémard, Michela, additional, Leyland, Paul, additional, Montgomery, Peter L., additional, Timofeev, Andrey, additional, and Stockinger, Heinz, additional

Published
2010
Full Text
View/download PDF

21. Cache Attacks and Countermeasures: The Case of AES.

Author

Pointcheval, David, Osvik, Dag Arne, Shamir, Adi, and Tromer, Eran

Abstract

We describe several software side-channel attacks based on inter-process leakage through the state of the CPU's memory cache. This leakage reveals memory access patterns, which can be used for cryptanalysis of cryptographic primitives that employ data-dependent table lookups. The attacks allow an unprivileged process to attack other processes running in parallel on the same processor, despite partitioning methods such as memory protection, sandboxing and virtualization. Some of our methods require only the ability to trigger services that perform encryption or MAC using the unknown key, such as encrypted disk partitions or secure network links. Moreover, we demonstrate an extremely strong type of attack, which requires knowledge of neither the specific plaintexts nor ciphertexts, and works by merely monitoring the effect of the cryptographic process on the cache. We discuss in detail several such attacks on AES, and experimentally demonstrate their applicability to real systems, such as OpenSSL and Linux's dm-crypt encrypted partitions (in the latter case, the full key can be recovered after just 800 writes to the partition, taking 65 milliseconds). Finally, we describe several countermeasures for mitigating such attacks. Keywords: side-channel attack, cache, memory access, cryptanalysis, AES. [ABSTRACT FROM AUTHOR]

Published
2006
Full Text
View/download PDF

22. Multi-Stream Hashing on the PlayStation 3

Author

Bos, Joppe Willem, Casati, Nathalie, and Osvik, Dag Arne

Subjects
Synergistic Processing Element (SPE), Single Instruction Multiple Data (SIMD), Hashing, Cell Broadband Engine, Cryptology
Abstract

With process technology providing more and more transistors per chip, still following Moore's \law", processor designers have used a number of techniques to make those transistors useful. Lately they have started placing multiple processor cores on each chip; an example is the Cell Broadband Engine, which serves as the heart of Sony's PlayStation 3 game console. We present high-performance multi-stream versions of cryptographic hash functions from the MD/SHA-family. Our implementations require 1.74, 3.51 and 8.18 cycles per byte per SPE when using the cryptographic hash functions MD5, SHA-1 and SHA-256 respectively. To the best of our knowledge these are the fastest implementations of these hash functions for the Cell processor. These implementations can be useful for cryptanalytic use as well as for utilizing the SPEs as cryptographic accelerators.

Catalog

Books, media, physical & digital resources
See catalog results