output
19932026
most citedDiscovery of a big void in Khufu's Pyramid by observation of cosmic-ray muons

490 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.CRShow all

12 papers · 1 filter

cs.CR2018★ 11 cited

Faster individual discrete logarithms in finite fields of composite extension degree

Aurore Guillevic

Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}, {GF})…

cs.CR2014★ 5 cited

Dynamic Tags for Security Protocols

Myrto Arapinis, Stéphanie Delaune, Steve Kremer

The design and verification of cryptographic protocols is a notoriously difficult task, even in symbolic models which take an abstract view of cryptography. This is mainly due to t…

cs.CR2014

Automated analysis of security protocols with global state

Steve Kremer, Robert Künnemann

Security APIs, key servers and protocols that need to keep the status of transactions, require to maintain a global, non-monotonic state, e.g., in the form of a database or registe…

cs.CR2014

Resolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core Architectures

Hamza Jeljeli

In cryptanalysis, solving the discrete logarithm problem (DLP) is key to assessing the security of many public-key cryptosystems. The index-calculus methods, that attack the DLP in…

cs.CR2014

Analysis and Diversion of Duqu's Driver

Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier +1

The propagation techniques and the payload of Duqu have been closely studied over the past year and it has been said that Duqu shared functionalities with Stuxnet. We focused on th…

cs.CR2013★ 1 cited

Compiling symbolic attacks to protocol implementation tests

Hatem Ghabri, Ghazi Maatoug, Michael Rusinowitch

Recently efficient model-checking tools have been developed to find flaws in security protocols specifications. These flaws can be interpreted as potential attacks scenarios but th…

cs.CR2013

Computing class polynomials for abelian surfaces

Andreas Enge, Emmanuel Thomé

We describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 curves via complex floating-point approximations of their roots. After providing…

cs.CR2013

Selecting polynomials for the Function Field Sieve

Razvan Barbulescu

The Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n), where q is small an prime power. The scope of this article is to select…

cs.CR2012★ 7 cited

Accelerating Iterative SpMV for Discrete Logarithm Problem Using GPUs

Hamza Jeljeli

In the context of cryptanalysis, computing discrete logarithms in large cyclic groups using index-calculus-based methods, such as the number field sieve or the function field sieve…

cs.CR2012

Intruder deducibility constraints with negation. Decidability and application to secured service compositions

Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch +1

The problem of finding a mediator to compose secured services has been reduced in our former work to the problem of solving deducibility constraints similar to those employed for c…

cs.CR2011★ 4 cited

Satisfiability of General Intruder Constraints with and without a Set Constructor

Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch +1

Many decision problems on security protocols can be reduced to solving so-called intruder constraints in Dolev Yao model. Most constraint solving procedures for protocol security r…

cs.CR2007★ 136 cited

Improved Analysis of Kannan's Shortest Lattice Vector Algorithm

Guillaume Hanrot, Damien Stehlé

The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a close…