Coding Theory and Cryptology

Onderzoeksoutput

Onderzoeksoutput per jaar 1986 2005 2006 2009 2010 2011 2012 2013 2014 2015 2017 2019 2020 2021 2024

• 320 Conferentiebijdrage
• 224 Tijdschriftartikel
• 160 Rapport
• 91 Hoofdstuk
• 126 Meer
  • 25 Dissertatie 1 (Onderzoek TU/e / Promotie TU/e)
  • 23 Overige bijdrage
  • 19 Octrooi-publicatie
  • 17 Boekredactie
  • 9 Paper
  • 8 Boek
  • 6 Boek bespreking
  • 3 Vermelding in encyclopedie / woordenboek
  • 3 Voorwoord/editorial
  • 3 Dissertatie 4 (Onderzoek NIET TU/e / Promotie NIET TU/e)
  • 3 Werkdocument
  • 2 Poster
  • 2 Editorial
  • 1 Artikel recenseren
  • 1 Dissertatie 2 (Onderzoek NIET TU/e / Promotie TU/e)
  • 1 Preprint

Onderzoeksoutput per jaar

Onderzoeksoutput per jaar

Zoekresultaten

• 2010

  Cryptanalysis of Skein

  Bernstein, D. J. & Lange, T., 2010, IACR. 10 blz. (Cryptology ePrint Archive; vol. 2010/623)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

  • Cryptanalysis 100%
  1 Downloads (Pure)

• ECC2K-130 on Cell CPUs

  Bos, J. W., Kleinjung, T., Niederhagen, R. F. & Schwabe, P., 2010, s.n. 17 blz. (Cryptology ePrint Archive; vol. 2010/077)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Discrete Logarithm 100%
  • Optimization Technique 100%
  • Elliptic Curve 66%
  • Gaming Console 33%

• Fast exhaustive search for polynomial systems in F2

  Bouillaguet, C., Chen, H.-C., Cheng, C. M., Chou, T., Niederhagen, R. F., Shamir, A. & Yang, B. Y., 2010, s.n. 17 blz. (Cryptology ePrint Archive; vol. 2010/313)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Polynomial 100%
  • Solving System 100%
  • Exhaustive Search 100%
  • Cryptanalysis 50%
  • Parallelization 50%
  2 Downloads (Pure)

• New software speed records for cryptographic pairings

  Naehrig, M., Niederhagen, R. F. & Schwabe, P., 2010, IACR. 13 blz. (Cryptology ePrint Archive; vol. 2010/186)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

  Bestand

  • Optimization Technique 100%
  • SIMD 100%
  • Floating Point 100%
  • Double Precision 100%
  257 Downloads (Pure)

• Perfectly secure multiparty computation and the computational overhead of cryptography

  Damgård, I., Ishai, Y. & Krøigård, M., 2010, s.n. 32 blz. (Cryptology ePrint Archive; vol. 2010/106)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Knowledge Proof 100%
  • Perfect Security 100%
  • secure multiparty computation 100%
  • Security Parameter 50%
  • Soundness 50%

• Starfish on strike

  Bernstein, D. J., Birkner, P. & Lange, T., 2010, IACR. 17 blz. (Cryptology ePrint Archive; vol. 2010/367)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

  • Integer 100%
  • Elliptic Curve 100%
  • Factorization 100%
  • Torsion Point 100%

• Type-II optimal polynomial bases

  Bernstein, D. J. & Lange, T., 2010, IACR. 17 blz. (Cryptology ePrint Archive; vol. 2010/069)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

  • Polynomial Basis 100%
  • Normal Basis 100%
  • Elliptic Curve 100%
  • Simple Algorithm 50%
  • Speed-up 50%
  1 Downloads (Pure)

• Wild McEliece

  Bernstein, D. J., Lange, T. & Peters, C. P., 2010, IACR. 17 blz. (Cryptology ePrint Archive; vol. 2010/410)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

  • Finite Field 100%
  • Decoding Algorithm 100%
  • Cryptography 100%
  • Rm Field 20%
  • security level 20%
• 2009

  A complete set of addition laws for incomplete Edwards curves

  Bernstein, D. J. & Lange, T., 2009, IACR. 13 blz. (Cryptology ePrint Archive; vol. 2009/580)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

  • Complete Set 100%

• Breaking ECC2K-130

  Bailey, D. V., Batina, L., Bernstein, D. J., Birkner, P., Bos, J. W., Chen, H.-C., Cheng, C. M., Damme, van, G., De Meulenaer, G., Dominguez Perez, L. J., Fan, J., Güneysu, T., Gurkaynak, F., Lange, T., Mentens, N., Niederhagen, R. F., Paar, C., Regazzoni, F., Schwabe, P. & Uhsadel, L. & 2 anderen, Van Herrewege, A. & Yang, B. Y., 2009, IACR. 19 blz. (Cryptology ePrint Archive; vol. 2009/541)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

• Computing the endomorphism ring of an ordinary elliptic curve over a finite field

  Bisson, G. & Sutherland, A. V., 2009, s.n. 16 blz. (Cryptology ePrint Archive; vol. 2009/100)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Finite Field 100%
  • Elliptic Curve 100%
  • Endomorphism 100%

• Designing an ASIP for cryptographic pairings over Barreto-Naehrig curves

  Kammler, D., Zhang, D., Schwabe, P., Scharwaechter, H., Langenberg, M., Auras, D., Ascheid, G., Leupers, R., Mathar, R. & Meyr, H., 2009, IACR. 18 blz. (Cryptology ePrint Archive; vol. 2009/056)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Elliptic Curve 100%
  • Set Processor 100%
  • Embedded Systems 50%
  • Speed-up 50%
  • Data Memory 50%

• Efficient halving for genus 3 curves over binary fields

  Birkner, P. & Thériault, N., 2009, IACR. 45 blz. (Cryptology ePrint Archive; vol. 2009/157)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Binary Field 100%
  • Picard Group 50%
  • Scalar Multiple 50%
  • Odd Number 50%

• Fast elliptic-curve cryptography on the Cell Broadband Engine

  Costigan, N. & Schwabe, P., 2009, IACR. 18 blz. (Cryptology ePrint Archive; vol. 2009/016)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Elliptic Curve 100%
  • Public Key Cryptography 100%
  • Scalar Multiplication 60%
  • Cost Performance 50%
  • Performance Ratio 50%

• Faster and timing-attack resistant AES-GCM

  Käsper, E. & Schwabe, P., 2009, IACR. 15 blz. (Cryptology ePrint Archive; vol. 2009/129)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Timing Analysis 100%
  • Table Lookup 100%
  • Authentication Mode 100%

• Faster computation of Tate pairings

  Arène, C., Lange, T., Naehrig, M. & Ritzenthaler, C., 2009, IACR. 21 blz. (Cryptology ePrint Archive; vol. 2009/155)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

  • Weierstrass 100%
  • Explicit Formula 50%
  • Group Law 50%
  • Geometric Interpretation 50%
  2 Downloads (Pure)

• Faster pairing computations on curves with high-degree twists

  Costello, C., Lange, T. & Naehrig, M., 2009, IACR. 16 blz. (Cryptology ePrint Archive; vol. 2009/615)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

  • Elliptic Curve 100%
  • Explicit Formula 50%

• FSBday : Implementing Wagner's generalized birthday attack against the SHA-3 round-1 candidate FSB

  Bernstein, D. J., Lange, T., Niederhagen, R. F., Peters, C. P. & Schwabe, P., 2009, IACR. 19 blz. (Cryptology ePrint Archive; vol. 2009/292)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

  • Linear Code 100%
  • Hash Function 100%
  • Birthday Attack 100%
  • Error Correcting Codes 50%
  • Compression Function 50%
  1 Downloads (Pure)

• Information-set decoding for linear codes over Fq

  Peters, C. P., 2009, IACR. 11 blz. (Cryptology ePrint Archive; vol. 2009/589)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Cryptography 100%
  • Decoding Algorithm 100%
  • Linear Code 100%
  • Information Set Decoding 100%
  • Goppa Code 50%
  3 Downloads (Pure)

• Key extraction from general non-discrete signals

  Verbitskiy, E. A., Tuyls, P. T., Obi, C., Schoenmakers, B. & Skoric, B., 2009, IACR. 16 blz. (Cryptology ePrint Archive; vol. 2009/303)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Attackers 100%
  • Security Properties 100%
  • Incomplete Knowledge 100%
  • Privacy Property 100%
  • Security Implication 100%

• Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate

  Stevens, M. M. J., Sotirov, A., Appelbaum, J. R., Lenstra, A. K., Molnar, D., Osvik, D. A. & Weger, de, B. M. M., 2009, s.n. 17 blz. (Cryptology ePrint Archive; vol. 2009/111)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • End-Users 100%
  • Serial Number 100%
  • Search Space 100%
  • Certification Authority 100%
  • Function Call 66%
  1 Downloads (Pure)

• Some Diophantine equations from finite group theory: $\Phi_m (x) = 2p^n -1$

  Luca, F., Moree, P. & Weger, de, B. M. M., 2009, s.n. 17 blz. (arXiv.org; vol. 0907.5323)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Integer 100%
  • Diophantine Equation 100%
  • Finite Group Theory 100%
  • Cyclotomic Polynomial 100%
• 2008

  Attacking and defending the McEliece cryptosystem

  Bernstein, D. J., Lange, T. & Peters, C. P., 2008, IACR. 16 blz. (Cryptology ePrint Archive; vol. 2008/318)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

• CM construction of genus 2 curves with p-rank 1

  Hitt O'Connor, L., McGuire, G., Naehrig, M. & Streng, M., 2008, IACR. 19 blz. (Cryptology ePrint Archive; vol. 2008/491)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• Description and analysis of the RIES Internet voting system

  Hubbers, E., Jacobs, B. P. F., Schoenmakers, B., Tilborg, van, H. C. A. & Weger, de, B. M. M., 2008, Eindhoven: EIPSI Eindhoven Institute for the Protection of Systems and Information. 53 blz.

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

  Bestand

  • Organizational Control 100%
  • Source Codes 100%
  • Insider Attack 100%
  • Cryptographic Primitive 100%
  • Key Generation 100%
  126 Downloads (Pure)

• ECM on graphics cards

  Bernstein, D. J., Chen, T. R., Cheng, C. M., Lange, T. & Yang, B. Y., 2008, IACR. 19 blz. (Cryptology ePrint Archive; vol. 2008/480)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

• ECM using Edwards curves

  Bernstein, D. J., Birkner, P., Lange, T. & Peters, C. P., 2008, IACR. 16 blz. (Cryptology ePrint Archive; vol. 2008/016)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

• Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation

  Castryck, W., Galbraith, S. & Rezaeian Farashahi, R., 2008, s.n. 4 blz. (Cryptology ePrint Archive; vol. 2008/218)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• More discriminants with the Brezing-Weng method

  Bisson, G. & Satoh, T., 2008, s.n. 13 blz. (Cryptology ePrint Archive; vol. 2008/137)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• New AES software speed records

  Bernstein, D. J. & Schwabe, P., 2008, IACR. 18 blz. (Cryptology ePrint Archive; vol. 2008/381)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• Secure multiparty computation goes live

  Bogetoft, P., Christensen, D. L., Damgard, I., Geisler, M., Jakobsen, T., Kroigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J., Schwartzbach, M. & Toft, T., 2008, IACR. 7 blz. (Cryptology ePrint Archive; vol. 2008/068)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• Sharp lower bounds on the extractable randomness from non-uniform sources

  Skoric, B., Obi, C., Verbitskiy, E. A. & Schoenmakers, B., 2008, IACR. 17 blz. (Cryptology ePrint Archive; vol. 2008/484)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• Twisted Edwards curves

  Bernstein, D. J., Birkner, P., Joye, M., Lange, T. & Peters, C. P., 2008, IACR. 13 blz. (Cryptology ePrint Archive; vol. 2008/013)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access
• 2007

  Analysis and optimization of elliptic-curve single-scalar multiplication

  Bernstein, D. J. & Lange, T., 2007, IACR. 19 blz. (Cryptology ePrint Archive; vol. 2007/455)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

• Faster addition and doubling on elliptic curves

  Bernstein, D. J. & Lange, T., 2007, IACR. 22 blz. (Cryptology ePrint Archive; vol. 2007/286)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

• Inverted Edwards coordinates

  Bernstein, D. J. & Lange, T., 2007, IACR. 8 blz. (Cryptology ePrint Archive; vol. 2007/410)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

• Optimizing double-base elliptic-curve single-scalar multiplication

  Bernstein, D. J., Birkner, P., Lange, T. & Peters, C. P., 2007, IACR. 16 blz. (Cryptology ePrint Archive; vol. 2007/414)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

• Predicting the winner of the 2008 US Presidential Elections using a Sony PlayStation 3

  Stevens, M. M. J., Lenstra, A. K. & Weger, de, B. M. M., 2007, Eindhoven: Technische Universiteit Eindhoven.

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  • Cryptographic Hash 100%
  3 Downloads (Pure)

• Smooth Rényi entropy of ergodic quantum information sources

  Schoenmakers, B., Tjoelker, J., Tuyls, P. T. & Verbitskiy, E. A., 2007, s.n. 5 blz. (arXiv.ogr [quant-ph]; vol. 0704.3504)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic
• 2006

  Cryptanalysis of the dual elliptic curve pseudorandom generator

  Schoenmakers, B. & Sidorenko, A., 2006, s.n. 6 blz. (Cryptology ePrint Archive; vol. 2006/190)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• Efficient pseudorandom generators based on the DDH assumption

  Rezaeian Farashahi, R., Schoenmakers, B. & Sidorenko, A., 2006, s.n. 12 blz. (Cryptology ePrint Archive; vol. 2006/321)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• Scalable authenticated tree based group key exchange for ad-hoc groups

  Desmedt, Y., Lange, T. & Burmester, M., 2006, s.n. 16 blz. (Cryptology ePrint Archive; vol. 2006/443)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

  Open Access

• Target collisions for MD5 and colliding X.509 certificates for different identities

  Stevens, M. M. J., Lenstra, A. K. & Weger, de, B. M. M., 2006, s.n. 15 blz. (Cryptology ePrint Archive; vol. 2006/360)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic
• 2005

  Experiments with queries over encrypted data using secret sharing

  Brinkman, R., Schoenmakers, B., Doumen, J. M. & Jonker, W., 2005, Enschede, The Netherlands: Universiteit Twente. 12 blz. (TR-CTIT; vol. 05-38)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• VSH, an efficient and provable collision resistant hash function

  Contini, S. P., Lenstra, A. K. & Steinfeld, R., 2005, IACR. (Cryptology ePrint Archive; vol. 2005/193)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic
• 2004

  Constructing new monotone span programs from old

  Nikov, V. S. & Nikova, S. I., 2004, IACR. 17 blz. (Cryptology ePrint Archive; vol. 2004/282)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• New monotone span programs from old

  Nikov, V. S. & Nikova, S. I., 2004, IACR. 17 blz. (Cryptology ePrint Archive; vol. 2004/282)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• On cheating immune secret sharing

  Braeken, A., Nikova, S. I. & Nikov, V. S., 2004, IACR. 8 blz. (Cryptology ePrint Archive; vol. 2004/200)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic
• 2003

  Multi-party computation from any linear secret sharing scheme secure against adaptive adversary : the zero-error case

  Nikov, V. S., Nikova, S. I. & Preneel, B., 2003, IACR. 13 blz. (Cryptology ePrint Archive; vol. 2003/006)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic

• On a relation between verifiable secret sharing schemes and a class of error-correcting schemes

  Nikov, V. S. & Nikova, S. I., 2003, IACR. (Cryptology ePrint Archive; vol. 2003/210)

  Onderzoeksoutput: Boek/rapport › Rapport › Academic