EDBT 2026 Demo / reviewers in the wild / expert
Alexei V. Ourivski
dblp:14/3134
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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
1 paper |
Cryptographic primitives and cryptanalysis · 100% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › post-quantum cryptography
code-based cryptography |
0.0 | 1 | 2003 | Reducible rank codes and their applications to cryptography · IEEE Trans. Inf. Theory 2003 |
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption |
0.0 | 1 | 2003 | Reducible rank codes and their applications to cryptography · IEEE Trans. Inf. Theory 2003 |
Cryptographic primitives and cryptanalysis › symmetric-key cryptanalysis
structural attack |
0.0 | 1 | 2003 | Reducible rank codes and their applications to cryptography · IEEE Trans. Inf. Theory 2003 |
Methods — techniques the papers use, named apart from their topics
encoding · 0.1decoding · 0.1column scrambler · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Column Scrambler for the GPT Cryptosystem
Alexei V. Ourivski, Ernst M. Gabidulin |
Discret. Appl. Math. | 1 |
| 2003 | Reducible rank codes and their applications to cryptographyabstractWe present a new family of so-called reducible rank codes which are a generalization of rank product codes . This family includes maximal rank distance (MRD) codes for lengths n>N in the field F/sub N/. We give methods for encoding and decoding reducible rank codes. A public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler "mixes" columns of a generator (parity-check) matrix of a code. It makes the system more resistant to structural attacks such as Gibson's attacks. Possible attacks on the system are thoroughly studied. The system is found to be secure against known attacks for public keys of about 16 kbits and greater. Ernst M. Gabidulin, Alexei V. Ourivski, Bahram Honary, Bassem Ammar |
IEEE Trans. Inf. Theory | 2 |