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

H. Gregor Molter

dblp:17/4205 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2012
0000-0002-6896-1591ORCID · verified

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

Systems, architecture and hardware · 5 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorSecurity and privacy · 1

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
Hardware accelerators and domain-specific architectures · 77% Reconfigurable computing and FPGAs · 23%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography › code-based cryptography
mceliece cryptosystem
0.112010
A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem · IEEE Trans. Computers 2010
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.112010
A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem · IEEE Trans. Computers 2010
Hardware accelerators and domain-specific architectures
cryptographic accelerator
0.112010
A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem · IEEE Trans. Computers 2010

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

key generation · 0.2encryption · 0.2decryption · 0.2NP-hard decoding problem · 0.2
YearPublicationVenuePosition
2012 Automated Generation of Embedded Systems Software from Timed DEVS Model of Computation Specifications
abstract
This paper addresses the software transformation part of a comprehensive hardware/software co-design flow for the Discrete Event System Specification Model of Computation. The transformation methodology of such timed abstract models into embedded systems source code is the main contribution of this paper. Furthermore, the integration of legacy source code and communication interface instantiation is detailed. Thus, the advocated approach allows to reuse legacy source code within a hardware/software co-design flow based on model transformations. The feasibility of the approach is demonstrated by means of a realistic distributed real-time application example.
H. Gregor Molter, Johannes Kohlmann, Sorin A. Huss
DSD1
2011 State space optimization within the DEVS model of computation for timing efficiency
abstract
This paper presents a state optimization approach within the Discrete Event System Specification Model of Computation. The goal of state optimization is to significantly soften the timing requirements of the model when transformed to a hardware implementation. The algorithm presented relocates the behaviour of zero-timeout states into adjacent states. Thus, the resulting model has much better timing properties, which considerably increase the amount of suitable target hardware architectures. The feasibility of the approach is demonstrated by means of a complex Digital Visual Interface controller application example.
H. Gregor Molter, André Seffrin, Sorin A. Huss
VLSI-SoC1
2010 A Novel Cryptoprocessor Architecture for the McEliece Public-Key Cryptosystem
abstract
The McEliece public-key cryptosystem relies on the NP-hard decoding problem, and therefore, is regarded as a solution for postquantum cryptography. Though early known, this cryptosystem was not employed so far because of efficiency questions regarding performance and communication overhead. This paper presents a novel processor architecture as a high-performance platform to execute key generation, encryption, and decryption according to this cryptosystem. A prototype of this processor is realized on a reconfigurable device and tested via a dedicated software interface. A comparison with a similar software solution highlights the performance advantage of the proposed hardware solution.
Abdulhadi Shoufan, Thorsten Wink, H. Gregor Molter, Sorin A. Huss, Eike Kohnert
IEEE Trans. Computers3
2009 A Novel Processor Architecture for McEliece Cryptosystem and FPGA Platforms
abstract
McEliece scheme represents a code-based public-key cryptosystem. So far, this cryptosystem was not employed because of efficiency questions regarding performance and communication overhead.This paper presents a novel processor architecture as a high-performance platform to execute key generation, encryption and decryption according to this cryptosystem. A prototype of this processor is realized on Virtex-5 FPGA and tested via a software API. A comparison with a similar software solution highlights the performance advantage of the proposed hardware solution.
Abdulhadi Shoufan, Thorsten Wink, H. Gregor Molter, Sorin A. Huss, Falko Strenzke
ASAP3
2009 SC-DEVS: An efficient SystemC extension for the DEVS model of computation
abstract
This paper describes a systematic approach to integrate the Discrete Event Specified System (DEVS) methodology into SystemC. It thus combines Model of Computation (MoC) specific properties and the features of an advanced SystemC environment. The execution of abstract system level DEVS models is comparable to pure SystemC models and is significantly faster compared to other DEVS environments. Thus, system level models based on abstract MoCs may easily be executed in a SystemC environment. The proposed integration is realized as a non-introspective extension to the SystemC 2.2 kernel. The DEVS models are implemented on an additional software layer above the SystemC simulation kernel. Our approach may be used simultaneously with other layered extensions, e.g., SystemC-AMS or TLM.
Felix Madlener, H. Gregor Molter, Sorin A. Huss
DATE2
2009 DEVS2VHDL: Automatic transformation of XML-specified DEVS Model of Computation into synthesizable VHDL code
H. Gregor Molter, André Seffrin, Sorin A. Huss
FDL1
2008 Side Channels in the McEliece PKC
Falko Strenzke, Erik Tews, H. Gregor Molter, Raphael Overbeck, Abdulhadi Shoufan
PQCrypto3