Most cited papers from Cryptomathic (Denmark)
What are the most cited papers from Cryptomathic (Denmark)?
The most cited paper from Cryptomathic (Denmark) is "A Side-Channel Analysis Resistant Description of the AES S-Box" (Elisabeth Oswald, Stefan Mangard, Norbert Pramstaller et al., 2005), with 323 citations. Next come "On Gorenstein projective, injective and flat dimensions—A functorial description with applications" (310) and "Practical continuous-variable quantum key distribution with composable security" (154).
Showing 26 of 26 papers. Every paper is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | A Side-Channel Analysis Resistant Description of the AES S-Box Elisabeth Oswald, Stefan Mangard, Norbert Pramstaller et al. · Lecture notes in computer science | 2005 | 323 |
| 2 | On Gorenstein projective, injective and flat dimensions—A functorial description with applications Lars Winther Christensen, Anders Frankild, Henrik Holm · Journal of Algebra | 19 Jan 2006 | 310 |
| 3 | Practical continuous-variable quantum key distribution with composable security Nitin Jain, Hou-Man Chin, Hossein Mani et al. · Nature Communications | 12 Aug 2022 | 154 |
| 4 | A Verifiable Secret Shuffe of Homomorphic Encryptions Jens Groth · Lecture notes in computer science | 18 Dec 2002 | 146 |
| 5 | Non-interactive and reusable non-malleable commitment schemes Ivan Damgård, Jens Groth | 9 Jun 2003 | 121 |
| 6 | Update on SHA-1 Vincent Rijmen, Elisabeth Oswald · Lecture notes in computer science | 2005 | 113 |
| 7 | Electronic payments of small amounts Torben Pryds Pedersen · Lecture notes in computer science | 1997 | 112 |
| 8 | Homodyne-based quantum random number generator at 2.9 Gbps secure against quantum side-information Tobias Gehring, Cosmo Lupo, Arne Kordts et al. · Nature Communications | 27 Jan 2021 | 105 |
| 9 | Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast Jens Groth · Lecture notes in computer science | 2004 | 105 |
| 10 | On the existence of statistically hiding bit commitment schemes and fail-stop signatures Ivan Damgård, Torben Pryds Pedersen, Birgit Pfitzmann · Journal of Cryptology | Jun 1997 | 71 |
| 11 | Evaluating Security of Voting Schemes in the Universal Composability Framework Jens Groth · Lecture notes in computer science | 2004 | 69 |
| 12 | Statistical secrecy and multibit commitments Ivan Damgård, Torben Pryds Pedersen, B. Pfitzmann · IEEE Transactions on Information Theory | May 1998 | 68 |
| 13 | Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems Jens Groth · Lecture notes in computer science | 2004 | 59 |
| 14 | Classical codes as ideals in group algebras Peter Landrock, Olaf Manz · Designs Codes and Cryptography | Sep 1992 | 57 |
| 15 | Badger – A Fast and Provably Secure MAC Martin Boesgaard, Thomas Christensen, Erik Zenner · Lecture notes in computer science | 2005 | 29 |
| 16 | Scattering theory for the Laplacian on manifolds with bounded curvature Werner Müller, Gorm Salomonsen · Journal of Functional Analysis | 24 Jul 2007 | 28 |
| 17 | On the Difficulty of Software Key Escrow Lars Ramkilde Knudsen, Torben Pryds Pedersen · Lecture notes in computer science | 1996 | 20 |
| 18 | Efficient and provable security amplifications Ronald Cramer, Ivan Damgård, Torben Pryds Pedersen · Lecture notes in computer science | 1997 | 8 |
| 19 | Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting Rasmus Pagh, Jakob Illeborg Pagter · BRICS Report Series | 2 Jan 2001 | 6 |
| 20 | Signing Contracts and Paying Electronically Torben Pryds Pedersen · Lecture notes in computer science | 1999 | 4 |
| 21 | Periodic Properties of Counter Assisted Stream Ciphers Ove Scavenius, Martin Boesgaard, Thomas B. Pedersen et al. · Lecture notes in computer science | 2004 | 4 |
| 22 | WWW security and trusted third party services Bruno Crispo, Peter Landrock, Václav Matyáš · Future Generation Computer Systems | Feb 2000 | 2 |
| 23 | A New Concept in Protocols: Verifiable Computational Delegation Peter Landrock · Lecture notes in computer science | 1998 | 1 |
| 24 | Practical experiences with TTP schemes Peter Landrock · Information Security Technical Report | 1996 | 1 |
| 25 | Security verification for vacuum fluctuation based quantum random number generator Arne Kordts, Cosmo Lupo, Dino Solar Nikolic et al. · Conference on Lasers and Electro-Optics | 2018 | 0 |
| 26 | Interactive Identification Protocols Peter Landrock · Lecture notes in computer science | 2001 | 0 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for an institution when any of its authors gave it as an affiliation; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.