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

Michael Horst

dblp:137/6966 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

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

Systems, architecture and hardware · 1Security and privacy · 1 · 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
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › encryption › property-preserving encryption
format-preserving encryption
0.512021
FAST: Secure and High Performance Format-Preserving Encryption and Tokenization · ASIACRYPT (3) 2021
Cryptographic primitives and cryptanalysis
symmetric cryptography
0.512021
FAST: Secure and High Performance Format-Preserving Encryption and Tokenization · ASIACRYPT (3) 2021

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

tweakable block cipher · 0.5
YearPublicationVenuePosition
2021 FAST: Secure and High Performance Format-Preserving Encryption and Tokenization
F. Betül Durak, Henning Horst, Michael Horst, Serge Vaudenay
ASIACRYPT (3)3
2017 Comparing parallel hardware architectures for visually guided robot navigation
abstract
Summary Local visual homing methods are a family of algorithms for visually guided navigation on mobile robots. Within this family, the so‐called min‐warping algorithm yields very precise results but is rather compute‐intensive. For this reason, we developed several implementations of this algorithm for different parallel hardware architectures (multi‐core CPUs with SIMD extensions, graphics processing units (GPUs), field‐programmable gate array) to arrive at a fast and energy‐efficient solution which is suited for real‐time performance on mobile platforms with limited battery capacity. Because the min‐warping algorithm is also well suited as a general benchmark, we carried out a comprehensive comparison study which includes both speed and real‐power measurements and covers both low‐power processors and high‐end devices. Our findings suggest that field‐programmable gate arrays offer the most energy‐efficient platform for min‐warping in the area of low‐power processors, while GPUs take the lead in the area of high‐end devices. However, as soon as the full capabilities of modern CPUs (like vector execution units and multiple hardware threads) are used, the speedup advantage of GPUs goes down to the single digit range. Copyright © 2016 John Wiley & Sons, Ltd.
Wolfram Schenck, Michael Horst, Tim Tiedemann, Sergius Gaulik, Ralf Möller 0002
Concurr. Comput. Pract. Exp.2