Hans Dobbertin

According to our database, Hans Dobbertin authored at least 26 papers between 1994 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

Bent functions embedded into the recursive framework of ℤ-bent functions.

Hans Dobbertin, Gregor Leander

Des. Codes Cryptogr., 2008

2006

Niho type cross-correlation functions via dickson polynomials and Kloosterman sums.

Hans Dobbertin, Patrick Felke, Tor Helleseth, Petri Rosendahl

IEEE Trans. Inf. Theory, 2006

Construction of bent functions via Niho power functions.

Hans Dobbertin, Gregor Leander, Anne Canteaut, Claude Carlet, Patrick Felke, Philippe Gaborit

J. Comb. Theory A, 2006

Finding nonnormal bent functions.

Anne Canteaut, Magnus Daum, Hans Dobbertin, Gregor Leander

Discret. Appl. Math., 2006

2005

Cryptographer's Toolkit for Construction of 8-Bit Bent Functions.

Hans Dobbertin, Gregor Leander

IACR Cryptol. ePrint Arch., 2005

2004

Normal Extensions of Bent Functions.

Claude Carlet, Hans Dobbertin, Gregor Leander

IEEE Trans. Inf. Theory, 2004

New cyclic difference sets with Singer parameters.

J. F. Dillon, Hans Dobbertin

Finite Fields Their Appl., 2004

A Survey of Some Recent Results on Bent Functions.

Hans Dobbertin, Gregor Leander

Proceedings of the Sequences and Their Applications, 2004

The Cryptanalysis of the AES - A Brief Survey.

Hans Dobbertin, Lars R. Knudsen, Matthew J. B. Robshaw

Proceedings of the Advanced Encryption Standard - AES, 4th International Conference, 2004

2003

APN functions in odd characteristic.

Hans Dobbertin, Donald Mills, Eva Nuria Müller, Alexander Pott, Wolfgang Willems

Discret. Math., 2003

2001

Ternary m-sequences with three-valued cross-correlation function: New decimations of Welch and Niho type.

Hans Dobbertin, Tor Helleseth, P. Vijay Kumar, Halvard Martinsen

IEEE Trans. Inf. Theory, 2001

Uniformly Representable Permutation Polynomials.

Hans Dobbertin

Proceedings of the Sequences and their Applications, 2001

2000

Binary m-sequences with three-valued crosscorrelation: A proof of Welch's conjecture.

Anne Canteaut, Pascale Charpin, Hans Dobbertin

IEEE Trans. Inf. Theory, 2000

Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F_2^<i>m</i>, and Crosscorrelation of Maximum-Length Sequences.

Anne Canteaut, Pascale Charpin, Hans Dobbertin

SIAM J. Discret. Math., 2000

1999

Almost Perfect Nonlinear Power Functions on GF(2ⁿ): The Welch Case.

Hans Dobbertin

IEEE Trans. Inf. Theory, 1999

Secure hashing in practice.

Hans Dobbertin

Inf. Secur. Tech. Rep., 1999

Almost Perfect Nonlinear Power Functions on GF(2n): The Niho Case.

Hans Dobbertin

Inf. Comput., 1999

Another Proof of Kasami's Theorem.

Hans Dobbertin

Des. Codes Cryptogr., 1999

A New Characterization of Almost Bent Functions.

Anne Canteaut, Pascale Charpin, Hans Dobbertin

Proceedings of the Fast Software Encryption, 6th International Workshop, 1999

1998

Cryptanalysis of MD4.

Hans Dobbertin

J. Cryptol., 1998

One-to-One Highly Nonlinear Power Functions on GF(2ⁿ).

Hans Dobbertin

Appl. Algebra Eng. Commun. Comput., 1998

The First Two Rounds of MD4 are Not One-Way.

Hans Dobbertin

Proceedings of the Fast Software Encryption, 5th International Workshop, 1998

1997

RIPEMD with Two-Round Compress Function is Not Collision-Free.

Hans Dobbertin

J. Cryptol., 1997

1996

Some new three-valued crosscorrelation functions for binary m-sequences.

Thomas W. Cusick, Hans Dobbertin

IEEE Trans. Inf. Theory, 1996

RIPEMD-160: A Strengthened Version of RIPEMD.

Hans Dobbertin, Antoon Bosselaers, Bart Preneel

Proceedings of the Fast Software Encryption, 1996

1994

Construction of Bent Functions and Balanced Boolean Functions with High Nonlinearity.

Hans Dobbertin

Proceedings of the Fast Software Encryption: Second International Workshop. Leuven, 1994