Christian Forler

484 total citations
8 papers, 47 citations indexed

About

Christian Forler is a scholar working on Artificial Intelligence, Computer Vision and Pattern Recognition and Computer Networks and Communications. According to data from OpenAlex, Christian Forler has authored 8 papers receiving a total of 47 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Artificial Intelligence, 3 papers in Computer Vision and Pattern Recognition and 2 papers in Computer Networks and Communications. Recurrent topics in Christian Forler's work include Cryptographic Implementations and Security (7 papers), Coding theory and cryptography (5 papers) and Cryptography and Data Security (3 papers). Christian Forler is often cited by papers focused on Cryptographic Implementations and Security (7 papers), Coding theory and cryptography (5 papers) and Cryptography and Data Security (3 papers). Christian Forler collaborates with scholars based in Germany. Christian Forler's co-authors include Stefan Lucks, Jakob Wenzel, Eik List and Ewan Fleischmann and has published in prestigious journals such as Computer Science Review, Cryptography and Communications and IACR Cryptology ePrint Archive.

In The Last Decade

Christian Forler

8 papers receiving 46 citations

Peers

Christian Forler

AI

CNC

IS

CVPR

SP

Quynh Dang United States

M. Murphy United States

Ravin Ahuja India

Andrew Regenscheid United States

Erik Zenner Denmark

André Adelsbach Germany

Mohammad Mahdi Kamani United States

Katsuyuki Okeya Japan

R. St. Denis United Kingdom

François Koeune Belgium

Quynh Dang United States

Christian Forler

31 ×1.1

AI

23 ×1.0

CNC

27 ×1.4

IS

17 ×1.0

CVPR

13 ×2.2

SP

Citations per year, relative to Christian Forler Christian Forler (= 1×) peers Quynh Dang

Countries citing papers authored by Christian Forler

Since Specialization

Citations

This map shows the geographic impact of Christian Forler's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Christian Forler with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Christian Forler more than expected).

Fields of papers citing papers by Christian Forler

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Christian Forler. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Christian Forler. The network helps show where Christian Forler may publish in the future.

Co-authorship network of co-authors of Christian Forler

This figure shows the co-authorship network connecting the top 25 collaborators of Christian Forler. A scholar is included among the top collaborators of Christian Forler based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Christian Forler. Christian Forler is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

8 of 8 papers shown

1.

Forler, Christian, Eik List, Stefan Lucks, & Jakob Wenzel. (2017). POEx: A beyond-birthday-bound-secure on-line cipher. Cryptography and Communications. 10(1). 177–193. 3 indexed citations

2.

Forler, Christian, et al.. (2016). General classification of the authenticated encryption schemes for the CAESAR competition. Computer Science Review. 22. 13–26. 32 indexed citations

3.

Forler, Christian, Stefan Lucks, & Jakob Wenzel. (2015). The Catena Password-Scrambling Framework. 3 indexed citations

4.

Forler, Christian, Eik List, Stefan Lucks, & Jakob Wenzel. (2014). Overview of the Candidates for the Password Hashing Competition - And their Resistance against Garbage-Collector Attacks.. IACR Cryptology ePrint Archive. 2014. 881. 4 indexed citations

5.

Forler, Christian, et al.. (2014). The POET Family of On-Line Authenticated Encryption Schemes Submission to the CAESAR competition. 1 indexed citations

6.

Fleischmann, Ewan, Christian Forler, Stefan Lucks, & Jakob Wenzel. (2011). McOE: A Family of Almost Foolproof On-Line Authenticated Encryption Schemes. IACR Cryptology ePrint Archive. 2 indexed citations

7.

Fleischmann, Ewan, et al.. (2010). TWISTER<SUB align=right>π – a framework for secure and fast hash functions. 2(1). 68–68. 1 indexed citations

8.

Fleischmann, Ewan, et al.. (2009). Classification of the SHA-3 Candidates. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2008. 0. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact