Publication

Computation of a 768-Bit Prime Field Discrete Logarithm

Publications associées (37)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured n×n matrix it can be computed in O(n3) operations. An interesting problem arises if the input matrix is a Toeplitz matrix, for exa ...

MATHICSE2016

Light Transport Matrix recovery for nearly planar objects

Martin Vetterli, Paolo Prandoni, Loïc Arnaud Baboulaz, Niranjan Thanikachalam

The light transport matrix has become a powerful tool for scene relighting, owing to the versatility of its representational power of various light transport phenomenon. We argue that scenes with an almost planar surface geometry, even with significant amo ...

SPIE2014

FID-guided retrospective motion correction based on autofocusing

Rolf Gruetter, Tobias Kober, Cristina Granziera, Gunnar Krüger

This work investigates the possibility of using FID navigator signals to improve the performance of a recently proposed autofocusing-based retrospective motion correction technique. FID navigators were incorporated into an MP-RAGE sequence and 3 subjects w ...

2014

Protecting Circuits From Computationally Bounded And Noisy Leakage

Sebastian Faust

Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles any circuit into a circuit with the same functionality but resilience against well-defin ...

Siam Publications2014

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

Assessing Gaps and Needs for Integrating Building Performance Optimization Tools in Net Zero Energy Buildings Design

Shady Galal Mohamed Attia

This paper summarizes a study undertaken to reveal potential challenges and opportunities for integrating optimization tools in net zero energy buildings (NZEB) design. The paper reviews current trends in simulation-based building performance optimization ...

Elsevier2013

Function computation of arbitrarily correlated discrete sources over Gaussian networks with multiple access components but no broadcast is studied. Two classes of functions are considered: the arithmetic sum function and the frequency histogram function. T ...

2013

Synthesis of sparse arrays with focused or shaped beampattern via sequential convex optimizations

Benjamin Fuchs

An iterative procedure for the synthesis of sparse arrays radiating focused or shaped beampattern is presented. The algorithm consists in solving a sequence of weighted l(1) convex optimization problems. The method can thus be readily implemented and effic ...

Institute of Electrical and Electronics Engineers2012

Content Preference Estimation In Online Social Networks: Message Passing Versus Sparse Reconstruction On Graphs

We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for which this information is available ahead of time. The techniques take advantag ...

2011

Factorization of a 768-Bit RSA Modulus

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Dag Arne Osvik, Patric Zimmermann

This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA. ...

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