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.

Björn Haase

dblp:161/6293 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0002-9413-5226ORCID · corroborated

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

Security and privacy · 3 · 1 first-author · 1 since 2021

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
2 papers
Cryptographic protocols and secure computation · 95% Cryptographic primitives and cryptanalysis · 5%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
key exchange
0.822021
Security Analysis of CPace · ASIACRYPT (4) 2021
Making Password Authenticated Key Exchange Suitable for Resource-Constrained Industrial Control Devices · CHES 2017
Cryptographic protocols and secure computation › key exchange › authenticated key exchange
password-authenticated key exchange
0.822021
Security Analysis of CPace · ASIACRYPT (4) 2021
Making Password Authenticated Key Exchange Suitable for Resource-Constrained Industrial Control Devices · CHES 2017
Embedded and real-time systems
industrial control systems
0.112017
Making Password Authenticated Key Exchange Suitable for Resource-Constrained Industrial Control Devices · CHES 2017

Methods — techniques the papers use, named apart from their topics

protocol design · 0.6
YearPublicationVenuePosition
2021 Security Analysis of CPace
Michel Abdalla, Björn Haase, Julia Hesse
ASIACRYPT (4)2
2017 Making Password Authenticated Key Exchange Suitable for Resource-Constrained Industrial Control Devices
Björn Haase, Benoît Labrique
CHES1
2015 High-speed Curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers
abstract
This paper presents new speed records for 128-bit secure elliptic-curve Diffie–Hellman key-exchange software on three different popular microcontroller architectures. We consider a 255-bit curve proposed by Bernstein known as Curve25519, which has also been adopted by the IETF. We optimize the X25519 key-exchange protocol proposed by Bernstein in 2006 for AVR ATmega 8-bit microcontrollers, MSP430X 16-bit microcontrollers, and for ARM Cortex-M0 32-bit microcontrollers. Our software for the AVR takes only 13,900,397 cycles for the computation of a Diffie–Hellman shared secret, and is the first to perform this computation in less than a second if clocked at 16 MHz for a security level of 128 bits. Our MSP430X software computes a shared secret in 5,301,792 cycles on MSP430X microcontrollers that have a 32-bit hardware multiplier and in 7,933,296 cycles on MSP430X microcontrollers that have a 16-bit multiplier. It thus outperforms previous constant-time ECDH software at the 128-bit security level on the MSP430X by more than a factor of 1.2 and 1.15, respectively. Our implementation on the Cortex-M0 runs in only 3,589,850 cycles and outperforms previous 128-bit secure ECDH software by a factor of 3.
Michael Düll, Björn Haase, Gesine Hinterwälder, Michael Hutter, Christof Paar, Ana Helena Sánchez, Peter Schwabe
Des. Codes Cryptogr.2