Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guerric Meurice de Dormale

dblp:83/4958 · DBLP profile ↗
← Back
9ranked-venue papers
7as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 7 · 6 first-authorSecurity and privacy · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › hash function cryptanalysis
collision search
0.112007
Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA · CHES 2007
Cryptographic primitives and cryptanalysis
discrete logarithm
0.112007
Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA · CHES 2007
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography
0.112007
Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA · CHES 2007
Reconfigurable computing and FPGAs
FPGA implementation
0.012007
Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA · CHES 2007
YearPublicationVenuePosition
2011 Compact FPGA Implementations of the Five SHA-3 Finalists
Stéphanie Kerckhof, François Durvaux, Nicolas Veyrat-Charvillon, Francesco Regazzoni 0001, Guerric Meurice de Dormale, François-Xavier Standaert
CARDIS5
2007 Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA
Guerric Meurice de Dormale, Philippe Bulens, Jean-Jacques Quisquater
CHES1
2007 On Solving RC5 Challenges with FPGAs
abstract
This work explores a hardware design alternative and a cost assessment of an FPGA-based brute force attack against the challenge RC5-72. The aim is to develop an alternative to software-based solutions for distributed.net. Hardware platforms, particularly reconfigurable hardware, can offer significant cost, flexibility and performance advantages, while significantly reducing environmental energy costs and impacts. Implementation results show that an 80 US$ FPGA can yield a throughput of 145 Mkeys/sec with a power consumption of 10 Watts. This is roughly an order of magnitude faster, cheaper and lower power, when compared with fully dedicated general purpose computers.
Guerric Meurice de Dormale, John Bass, Jean-Jacques Quisquater
FCCM1
2007 Integer Factorization Based on Elliptic Curve Method: Towards Better Exploitation of Reconfigurable Hardware
abstract
Currently, the best known algorithm for factorizing modulus of the RSA public key cryptosystem is the Number Field Sieve. One of its important phases usually combines a sieving technique and a method for checking smoothness of mid-size numbers. For this factorization, the Elliptic Curve Method (ECM) is an attractive solution. As ECM is highly regular and many parallel computations are required, hardware-based platforms were shown to be more cost-effective than software solutions. The few papers dealing with implementation of ECM on FPGA are all based on bit-serial architectures. They use only general-purpose logic and low-cost FPGAs which appear as the best performance/cost solution. This work explores another approach, based on the exploitation of embedded multipliers available in modern FPGAs and the use of high-performances FPGAs. The proposed architecture - based on a fully parallel and pipelined modular multiplier circuit - exhibits a 15-fold improvement over throughput/hardware cost ratio of previously published results.
Giacomo de Meulenaer, François Gosset, Guerric Meurice de Dormale, Jean-Jacques Quisquater
FCCM3
2007 Solving RC5 Challenges with Hardware -- a Distributed.net Perspective --
abstract
Encryption is the basic means to enforce confidentiality in digital communications. This work explores a hardware design alternative and a cost assessment of an FPGA-based brute force attack against RSA Secret-Key Challenge RC5-72. The aim is to develop an alternative to software-based solutions for distributed. net. Implementation results show that an 80 US$ FPGA can yield a throughput of 145 Mkeys/sec with a power consumption of 10 Watts. This is roughly an order of magnitude faster, cheaper and lower power, when compared with fully dedicated general purpose computers.
Guerric Meurice de Dormale, John Bass, Jean-Jacques Quisquater
FPL1
2007 High-speed hardware implementations of Elliptic Curve Cryptography: A survey
Guerric Meurice de Dormale, Jean-Jacques Quisquater
J. Syst. Archit.1
2006 Low-Cost Elliptic Curve Digital Signature Coprocessor for Smart Cards
abstract
This paper proposes different low-cost coprocessors for public key authentication on 8-bit smart cards. Elliptic curve cryptography is used for its efficiency per bit of key and the Elliptic Curve Digital Signature Algorithm is chosen. For this functionality, an area constrained coprocessor is probably the best approach to perform the most computer-intensive operations at an acceptable speed considering the limited memory and power of the selected platform. For that purpose, the scalar point multiplication in GF(2m) in both affine and projective coordinates was implemented in order to compare their performances with the same level of optimization and the same technology. A hardware/ software co-design strategy was also used to avoid the need of a dedicated register file.
Guerric Meurice de Dormale, Renaud Ambroise, David Bol, Jean-Jacques Quisquater, Jean-Didier Legat
ASAP1
2004 Efficient Modular Division Implementation: ECC over GF(p) Affine Coordinates Application
Guerric Meurice de Dormale, Philippe Bulens, Jean-Jacques Quisquater
FPL1
2004 An improved Montgomery modular inversion targeted for efficient implementation on FPGA
abstract
Modular multiplication and inversion/division are the most common primitives in today's public key cryptography. Elliptic curve public key cryptosystems (ECPKC) are becoming increasingly popular for use in mobile appliances where bandwidth and chip area are strongly constrained. For the same level of security, ECPKC use much smaller key length than the commonly used RSA but need modular inversion/division. This work presents an improved algorithm for prime field Montgomery modular inversion. The first important contribution lies in the reduction of the number of operations needed. Resource sharing is also used to lighten the control part of the algorithm. The second contribution is the minimization of the set of different instructions to enable powerful FPGA implementations. Resulting 256-bit circuit achieves a ratio throughput/area improved by at least 70% compared to the only known Montgomery inverse design in FPGA technology. Though the implementations are first oriented towards FPGA, some improvements are generic. So, they could prove to be also efficient for ASIC designs in terms of area and power consumption.
Guerric Meurice de Dormale, Philippe Bulens, Jean-Jacques Quisquater
FPT1