Publications related to Solving a $6120$-bit DLP on a Desktop Computer

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Robert Granger, Philipp Svetolik Jovanovic

A popular approach to tweakable blockcipher design is via masking, where a certain primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute tweak-dependent mask. In this work, we revisit the principle of masking. We do so a ...

2015

Intriguing aspects of lanthanide luminescence

Jean-Claude Bünzli, Svetlana Eliseeva

The enthralling properties of lanthanide luminescence have propelled luminescent probes, tags and materials based on these elements to the forefront of science and technology. In this minireview, attention is focused on the latest innovations and on less-k ...

Royal Soc Chemistry2013

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Robert Granger, Jens Markus Zumbrägel

In this paper we propose a binary field variant of the Joux-Lercier medium-sized Function Field Sieve, which results not only in complexities as low as

L_{q^n}(1/3,(4/9)1/3)

for computing arbitrary logarithms, but also in an heuristic polynomial time alg ...

Springer Berlin Heidelberg2013

Optical Methods for Solid Mechanics: A Full-Field Approach

Unique within the field for being written in a tutorial style, this textbook adopts a step-by-step approach to the background needed for understanding a wide range of full-field optical measurement techniques in solid mechanics. This method familiarizes re ...

WILEY-VCH2012

Room Helps: Acoustic Localization With Finite Elements

Martin Vetterli, Ivan Dokmanic

Acoustic source localization often relies on the free-space/far-field model. Recent work exploiting spatio-temporal sparsity promises to go beyond these scenarios, however, it requires the knowledge of the transfer functions from each possible source locat ...

Ieee2012

Solving 112-bit prime ECDLP on game consoles using sloppy reduction

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Marcelo Kaihara

We describe a cell processor implementation of Pollard’s rho method to solve discrete logarithms in groups of elliptic curves over prime fields. The implementation was used on a cluster of PlayStation 3 game consoles to set a new record. We present in deta ...

2012

Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols

Yuri Faenza, Hans Raj Tiwary

We show that the binary logarithm of the nonnegative rank of a nonnegative matrix is, up to small constants, equal to the minimum complexity of a randomized communication protocol computing the matrix in expectation. We use this connection to prove new con ...

Springer Berlin Heidelberg2012

Sampling Curves with Finite Rate of Innovation

Thierry Blu, Hanjie Pan, Pier Luigi Dragotti

We focus on a specific class of curves that can be parametrized using a finite number of variables in two dimensions. The corresponding indicator plane, which is a binary image, has infinite bandwidth and can not be sampled and perfectly reconstructed with ...

2011

Descent properties of hermitian Witt groups in inseparable extensions

Eva Bayer Fluckiger, Daniel Arnold Moldovan

Let k be a field of characteristic ≠2, A be a central simple algebra with involution σ over k and W(A,σ) be the associated Witt group of hermitian forms. We prove that for all purely inseparable extensions L of k, the canonical map rL/k:W(A,σ)⟶W(AL,σL) is ...

Springer Verlag2011

On the Use of the Negation Map in the Pollard Rho Method

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung

The negation map can be used to speed up the Pollard rho method to compute discrete logarithms in groups of elliptic curves over finite fields. It is well known that the random walks used by Pollard rho when combined with the negation map get trapped in fr ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Solving a $6120$-bit DLP on a Desktop Computer

Graph Chatbot

Chat with Graph Search

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Intriguing aspects of lanthanide luminescence

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

Optical Methods for Solid Mechanics: A Full-Field Approach

Room Helps: Acoustic Localization With Finite Elements

Solving 112-bit prime ECDLP on game consoles using sloppy reduction

Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols

Sampling Curves with Finite Rate of Innovation

Descent properties of hermitian Witt groups in inseparable extensions

On the Use of the Negation Map in the Pollard Rho Method

Solving 112-bit prime ECDLP on game consoles using sloppy reduction

Room Helps: Acoustic Localization With Finite Elements

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in $\mathbb{F}_{2^{1971}}$ and $\mathbb{F}_{2^{3164}}$

On the Use of the Negation Map in the Pollard Rho Method

Descent properties of hermitian Witt groups in inseparable extensions

Intriguing aspects of lanthanide luminescence

Optical Methods for Solid Mechanics: A Full-Field Approach

Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols

Sampling Curves with Finite Rate of Innovation

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption