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

Jürg Treichler

dblp:10/9547 · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 1Security 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 · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › cryptographic implementation
block cipher implementation
0.012002
2Gbit/s Hardware Realizations of RIJNDAEL and SERPENT: A Comparative Analysis · CHES 2002
Cryptographic primitives and cryptanalysis › cryptographic implementation
hardware implementation
0.012002
2Gbit/s Hardware Realizations of RIJNDAEL and SERPENT: A Comparative Analysis · CHES 2002
Cryptographic primitives and cryptanalysis
symmetric cryptography
0.012002
2Gbit/s Hardware Realizations of RIJNDAEL and SERPENT: A Comparative Analysis · CHES 2002
Hardware accelerators and domain-specific architectures
cryptographic accelerator
0.012002
2Gbit/s Hardware Realizations of RIJNDAEL and SERPENT: A Comparative Analysis · CHES 2002

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

serpent · 0.1rijndael · 0.1
YearPublicationVenuePosition
2011 Design and failure analysis of logic-compatible multilevel gain-cell-based dram for fault-tolerant VLSI systems
abstract
This paper considers the problem of increasing the storage density in fault-tolerant VLSI systems which require only limited data retention times. To this end, the concept of storing many bits per memory cell is applied to area-efficient and fully logic-compatible gain-cell-based dynamic memories. A memory macro in 90-nm CMOS technology including multilevel write and read circuits is proposed and analyzed with respect to its read failure probability due to within-die process variations by means of Monte Carlo simulations.
Pascal Andreas Meinerzhagen, Onur Andiç, Jürg Treichler, Andreas Peter Burg
ACM Great Lakes Symposium on VLSI3
2002 2Gbit/s Hardware Realizations of RIJNDAEL and SERPENT: A Comparative Analysis
Adrian K. Lutz, Jürg Treichler, Frank K. Gürkaynak, Hubert Kaeslin, Gérard Basler, Antonia Albani, Stephan Reichmuth, Pieter Rommens, Stephan Oetiker, Wolfgang Fichtner
CHES2