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

Alain P. Hiltgen

dblp:64/5762 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2003
—ORCID · none

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

Theory of computation · 3 · 3 first-authorSecurity and privacy · 2 · 1 first-author

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
Network security · 62% Cryptographic primitives and cryptanalysis · 24% Cryptographic protocols and secure computation · 14%
Theoretical computer science
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › combinatorial coding theory
gray codes
0.022001
Single-track circuit codes · IEEE Trans. Inf. Theory 2001
Single-track Gray codes · IEEE Trans. Inf. Theory 1996
Network security
traffic analysis
0.012003
Password Interception in a SSL/TLS Channel · CRYPTO 2003
Coding theory › constrained coding
circuit codes
0.012001
Single-track circuit codes · IEEE Trans. Inf. Theory 2001
Cryptographic primitives and cryptanalysis
one-way functions
0.011998
Towards a Better Understanding of One-Wayness: Facing Linear Permutations · EUROCRYPT 1998
Cryptographic protocols and secure computation
key exchange
0.012003
Password Interception in a SSL/TLS Channel · CRYPTO 2003
Network security › secure communication › secure communication protocol
TLS
0.012003
Password Interception in a SSL/TLS Channel · CRYPTO 2003

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

combinatorial construction · 0.0chosen-ciphertext attack · 0.0linear permutations · 0.0
YearPublicationVenuePosition
2003 Password Interception in a SSL/TLS Channel
Brice Canvel, Alain P. Hiltgen, Serge Vaudenay, Martin Vuagnoux
CRYPTO2
2001 Single-track circuit codes
abstract
Single-track circuit codes (STTCs) are circuit codes with codewords of length n such that all the n tracks which correspond to the n distinct coordinates of the codewords are cyclic shifts of the first track. These codes simultaneously generalize single-track Gray codes and ordinary circuit codes. They are useful in angular quantization applications in which error detecting and/or correcting capabilities are needed. A parameter k, called the spread of the code, measures the strength of this error control capability. We consider the existence of STCCs for small lengths n/spl les/17 and spreads k/spl les/6, constructing some optimal and many good examples. We then give a general construction method for STCCs which makes use of ordinary circuit codes. We use this construction to construct examples of codes with 360 and 1000 codewords which are of practical importance. We also use the construction to prove a general result on the existence of STCCs for general spreads.
Alain P. Hiltgen, Kenneth G. Paterson
IEEE Trans. Inf. Theory1
1998 Towards a Better Understanding of One-Wayness: Facing Linear Permutations
Alain P. Hiltgen
EUROCRYPT1
1996 Single-track Gray codes
abstract
A particular class of Gray codes, called single-track Gray codes, is introduced. These codes have advantages over conventional Gray codes in certain practical applications. A simple construction for single-track Gray codes is given and it is shown how to obtain such codes for a large range of parameters of practical interest.
Alain P. Hiltgen, Kenneth G. Paterson, M. Brandestini
IEEE Trans. Inf. Theory1
1995 PIk Mass Production and an Optimal Circuit for the Neciporuk Slice
Alain P. Hiltgen, Mike Paterson
Comput. Complex.1