2009 |
24 | EE | Mathias Herrmann,
Gregor Leander:
A Practical Key Recovery Attack on Basic TCHo.
Public Key Cryptography 2009: 411-424 |
23 | EE | Carl Bracken,
Gregor Leander:
A Highly Nonlinear Differentially 4 Uniform Power Mapping That Permutes Fields of Even Degree
CoRR abs/0901.1824: (2009) |
22 | EE | Gregor Leander,
François Rodier:
Bounds on the degree of APN polynomials The Case of $x^{-1}+g(x)$
CoRR abs/0901.4322: (2009) |
2008 |
21 | EE | Andy Rupp,
Gregor Leander,
Endre Bangerter,
Alexander W. Dent,
Ahmad-Reza Sadeghi:
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems.
ASIACRYPT 2008: 489-505 |
20 | EE | Carsten Rolfes,
Axel Poschmann,
Gregor Leander,
Christof Paar:
Ultra-Lightweight Implementations for Smart Devices - Security for 1000 Gate Equivalents.
CARDIS 2008: 89-103 |
19 | EE | Andrey Bogdanov,
Gregor Leander,
Christof Paar,
Axel Poschmann,
Matthew J. B. Robshaw,
Yannick Seurin:
Hash Functions and RFID Tags: Mind the Gap.
CHES 2008: 283-299 |
18 | EE | Marcus Brinkmann,
Gregor Leander:
On the classification of APN functions up to dimension five.
Des. Codes Cryptography 49(1-3): 273-288 (2008) |
17 | EE | Hans Dobbertin,
Gregor Leander:
Bent functions embedded into the recursive framework of \mathbbZ{\mathbb{Z}} -bent functions.
Des. Codes Cryptography 49(1-3): 3-22 (2008) |
16 | EE | Ronald Cramer,
Vanesa Daza,
Ignacio Gracia,
Jorge Jiménez Urroz,
Gregor Leander,
Jaume Martí-Farré,
Carles Padró:
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes.
IEEE Transactions on Information Theory 54(6): 2644-2657 (2008) |
15 | EE | Lilya Budaghyan,
Claude Carlet,
Gregor Leander:
Two Classes of Quadratic APN Binomials Inequivalent to Power Functions.
IEEE Transactions on Information Theory 54(9): 4218-4229 (2008) |
2007 |
14 | EE | Andrey Bogdanov,
Lars R. Knudsen,
Gregor Leander,
Christof Paar,
Axel Poschmann,
Matthew J. B. Robshaw,
Yannick Seurin,
C. Vikkelsoe:
PRESENT: An Ultra-Lightweight Block Cipher.
CHES 2007: 450-466 |
13 | EE | Gregor Leander,
Christof Paar,
Axel Poschmann,
Kai Schramm:
New Lightweight DES Variants.
FSE 2007: 196-210 |
12 | EE | Axel Poschmann,
Gregor Leander,
Kai Schramm,
Christof Paar:
New Light-Weight Crypto Algorithms for RFID.
ISCAS 2007: 1843-1846 |
11 | EE | Gregor Leander,
Axel Poschmann:
On the Classification of 4 Bit S-Boxes.
WAIFI 2007: 159-176 |
10 | EE | Philippe Langevin,
Gregor Leander,
Gary McGuire:
A Counterexample to a Conjecture of Niho.
IEEE Transactions on Information Theory 53(12): 4785-4786 (2007) |
2006 |
9 | EE | Gregor Leander,
Andy Rupp:
On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms.
ASIACRYPT 2006: 241-251 |
8 | EE | Anne Canteaut,
Magnus Daum,
Hans Dobbertin,
Gregor Leander:
Finding nonnormal bent functions.
Discrete Applied Mathematics 154(2): 202-218 (2006) |
7 | EE | Gregor Leander,
Alexander Kholosha:
Bent Functions With 2r Niho Exponents.
IEEE Transactions on Information Theory 52(12): 5529-5532 (2006) |
6 | EE | Hans Dobbertin,
Gregor Leander,
Anne Canteaut,
Claude Carlet,
Patrick Felke,
Philippe Gaborit:
Construction of bent functions via Niho power functions.
J. Comb. Theory, Ser. A 113(5): 779-798 (2006) |
2005 |
5 | EE | Ronald Cramer,
Vanesa Daza,
Ignacio Gracia,
Jorge Jiménez Urroz,
Gregor Leander,
Jaume Martí-Farré,
Carles Padró:
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes.
CRYPTO 2005: 327-343 |
4 | EE | Eike Kiltz,
Gregor Leander,
John Malone-Lee:
Secure Computation of the Mean and Related Statistics.
TCC 2005: 283-302 |
2004 |
3 | EE | Kai Schramm,
Gregor Leander,
Patrick Felke,
Christof Paar:
A Collision-Attack on AES: Combining Side Channel- and Differential-Attack.
CHES 2004: 163-175 |
2 | EE | Hans Dobbertin,
Gregor Leander:
A Survey of Some Recent Results on Bent Functions.
SETA 2004: 1-29 |
1 | | Claude Carlet,
Hans Dobbertin,
Gregor Leander:
Normal Extensions of Bent Functions.
IEEE Transactions on Information Theory 50(11): 2880-2885 (2004) |