Publications related to Computation Of A 30750-Bit Binary Field Discrete Logarithm

On the discrete logarithm problem in finite fields of fixed characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

For

q

a prime power, the discrete logarithm problem (DLP) in

\mathbb{F}_q

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer

x

such that

g^x = h

. We present an algorithm for computing discrete log ...

2015

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

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

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

Robert Granger, Jens Markus Zumbrägel

In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. By combining the polynomial time relat ...

Springer Berlin Heidelberg2013

Interactive Function Computation

Michael Christoph Gastpar

We investigate the role of interaction for computa- tion problem settings where nodes intend to compute functions of the raw messages generated at other nodes. In this work, we make some progress on a more elementary research component: feedback. Specifica ...

2013

Nonstationary Positive Definite Tapering On The Plane

Raphaël Huser

A common problem in spatial statistics is to predict a random field f at some spatial location t(0) using observations f(t(1)),..., f(t(n)) at t(1),..., t(n) epsilon IRd. Recent work by Kaufman et al. and Furrer et al. studies the use of tapering for reduc ...

American Statistical Association2013

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

Randomized versus Deterministic Implementations of Concurrent Data Structures

Dan Alistarh

One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...

EPFL2012

Practicality and time complexity of a sparsified RNA folding algorithm

Philipp Bucher, Slavica Dimitrieva Janeva

Commonly used RNA folding programs compute the minimum free energy structure of a sequence under the pseudoknot exclusion constraint. They are based on Zuker's algorithm which runs in time O(n^3). Recently, it has been claimed that RNA folding can be achie ...

2012

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Graph Chatbot

Chat with Graph Search

On the discrete logarithm problem in finite fields of fixed characteristic

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Tight Bounds for Asynchronous Renaming

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

Interactive Function Computation

Nonstationary Positive Definite Tapering On The Plane

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}}$

Randomized versus Deterministic Implementations of Concurrent Data Structures

Practicality and time complexity of a sparsified RNA folding algorithm

Nonstationary Positive Definite Tapering On The Plane

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}}$

Tight Bounds for Asynchronous Renaming

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

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

Practicality and time complexity of a sparsified RNA folding algorithm

On the discrete logarithm problem in finite fields of fixed characteristic

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Randomized versus Deterministic Implementations of Concurrent Data Structures

Interactive Function Computation