Ludo Tolhuizen

According to our database, Ludo Tolhuizen authored at least 60 papers between 1987 and 2023.

Collaborative distances:

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

2023

Coding and bounds for partially defective memory cells.

Haider Al Kim, Sven Puchinger, Ludo Tolhuizen, Antonia Wachter-Zeh

Des. Codes Cryptogr., December, 2023

2019

Achieving secure and efficient lattice-based public-key encryption: the impact of the secret-key distribution.

Sauvik Bhattacharya, Óscar García-Morchón, Rachel Player, Ludo Tolhuizen

IACR Cryptol. ePrint Arch., 2019

Round5: Compact and Fast Post-Quantum Public-Key Encryption.

Hayo Baan, Sauvik Bhattacharya, Scott R. Fluhrer, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang

IACR Cryptol. ePrint Arch., 2019

2018

Shorter Messages and Faster Post-Quantum Encryption with Round5 on Cortex M.

Markku-Juhani O. Saarinen, Sauvik Bhattacharya, Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen, Zhenfei Zhang

IACR Cryptol. ePrint Arch., 2018

Round5: Compact and Fast Post-Quantum Public-Key Encryption.

Sauvik Bhattacharya, Óscar García-Morchón, Thijs Laarhoven, Ronald Rietman, Markku-Juhani O. Saarinen, Ludo Tolhuizen, Zhenfei Zhang

IACR Cryptol. ePrint Arch., 2018

Maximum weight spectrum codes with reduced length.

Gérard D. Cohen, Ludo Tolhuizen

CoRR, 2018

A Multi-layer Recursive Residue Number System.

Henk D. L. Hollmann, Ronald Rietman, Sebastiaan de Hoogh, Ludo Tolhuizen, Paul Gorissen

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Improved key-reconciliation method.

Ludo Tolhuizen, Ronald Rietman, Óscar García-Morchón

IACR Cryptol. ePrint Arch., 2017

spKEX: An optimized lattice-based key exchange.

Sauvik Bhattacharya, Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen

IACR Cryptol. ePrint Arch., 2017

Round2: KEM and PKE based on GLWR.

Hayo Baan, Sauvik Bhattacharya, Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen, Jose Luis Torre-Arce, Zhenfei Zhang

IACR Cryptol. ePrint Arch., 2017

2016

Attacks and parameter choices in HIMMO.

Oscar García Morchon, Ronald Rietman, Ludo Tolhuizen, Jose Luis Torre-Arce, Moon Sung Lee, Domingo Gómez-Pérez, Jaime Gutierrez, Berry Schoenmakers

IACR Cryptol. ePrint Arch., 2016

Efficient quantum-resistant trust Infrastructure based on HIMMO.

Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen, Jose Luis Torre-Arce, Sauvik Bhattacharya, Maarten P. Bodlaender

IACR Cryptol. ePrint Arch., 2016

2015

A comprehensive and lightweight security architecture to secure the IoT throughout the lifecycle of a device based on HIMMO.

Oscar García Morchon, Ronald Rietman, Sahil Sharma, Ludo Tolhuizen, Jose Luis Torre-Arce

IACR Cryptol. ePrint Arch., 2015

Results on polynomial interpolation with mixed modular operations and unknown moduli.

Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen

IACR Cryptol. ePrint Arch., 2015

HIMMO: a collusion-resistant identity-based scheme for symmetric key generation.

Óscar García-Morchón, Ronald Rietman, Ludo Tolhuizen, Domingo Gómez, Jaime Gutierrez

ACM Commun. Comput. Algebra, 2015

DTLS-HIMMO: Achieving DTLS Certificate Security with Symmetric Key Overhead.

Oscar García Morchon, Ronald Rietman, Sahil Sharma, Ludo Tolhuizen, Jose Luis Torre-Arce

Proceedings of the Computer Security - ESORICS 2015, 2015

2014

HIMMO - A Lightweight, Fully Collusion Resistant Key Pre-Distribution Scheme.

Oscar García Morchon, Ronald Rietman, Ludo Tolhuizen, Domingo Gómez-Pérez, Jaime Gutierrez

IACR Cryptol. ePrint Arch., 2014

DTLS-HIMMO: Efficiently Securing a Post-Quantum World with a Fully-Collusion Resistant KPS.

Oscar García Morchon, Ronald Rietman, Sahil Sharma, Ludo Tolhuizen, Jose Luis Torre-Arce

IACR Cryptol. ePrint Arch., 2014

Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values.

Oscar García Morchon, Ronald Rietman, Igor E. Shparlinski, Ludo Tolhuizen

Exp. Math., 2014

The MMO problem.

Oscar García Morchon, Ronald Rietman, Ludo Tolhuizen, Domingo Gómez, Jaime Gutierrez

CoRR, 2014

The <i>MMO</i> problem.

Oscar García Morchon, Domingo Gómez-Pérez, Jaime Gutierrez, Ronald Rietman, Ludo Tolhuizen

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

An Algorithm to Analyze Non-injective S-Boxes.

Leandro Marín, Ludo Tolhuizen

Proceedings of the Information and Communication Technology, 2014

2012

Lighting systems control for demand response.

Sri Andari Husen, Ashish Pandharipande, Ludo Tolhuizen, Ying Wang, Meng Zhao

Proceedings of the IEEE PES Innovative Smart Grid Technologies Conference, 2012

2011

A generalisation of the Gilbert-Varshamov bound and its asymptotic evaluation

Ludo Tolhuizen

CoRR, 2011

2010

Bounds for codes for a non-symmetric ternary channel

Ludo Tolhuizen

CoRR, 2010

2009

Candle in the woods: asymptotic bounds on minimum blocking sets.

Natasa Jovanovic, Jan H. M. Korst, Ramon Clout, Verus Pronk, Ludo Tolhuizen

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008

Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures.

Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Quaternary Unequal Error Protection Codes.

Ludo M. G. M. Tolhuizen

Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2007

On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size.

Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 2007

Optimal codes for correcting a single (wrap-around) burst of errors

Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen

CoRR, 2007

2006

Generic erasure correcting sets: Bounds and constructions.

Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen

J. Comb. Theory A, 2006

On q-ary codes correcting all unidirectional errors of a limited magnitude

Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian, Ludo M. G. M. Tolhuizen

CoRR, 2006

Generating parity check equations for bounded-distance iterative erasure decoding.

Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Polynomial time algorithms for multicast network code construction.

Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 2005

XOR-based Visual Cryptography Schemes.

Pim Tuyls, Henk D. L. Hollmann, Jack H. van Lint, Ludo M. G. M. Tolhuizen

Des. Codes Cryptogr., 2005

2004

On the entropy rate of a hidden Markov model.

Sebastian Egner, Vladimir B. Balakirsky, Ludo Tolhuizen, Stan Baggen, Henk D. L. Hollmann

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Common coordinates in consecutive addresses.

Ning Cai, Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann

IEEE Trans. Inf. Theory, 2003

Polynomial time algorithms for network information flow.

Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002

More results on the weight enumerator of product codes.

Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 2002

A polarisation based Visual Crypto System and its Secret Sharing Schemes.

Pim Tuyls, Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen

IACR Cryptol. ePrint Arch., 2002

An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes.

Henk D. L. Hollmann, Jacobus H. van Lint, Ludo M. G. M. Tolhuizen, Pim Tuyls

IACR Cryptol. ePrint Arch., 2002

2000

New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback.

Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 2000

1999

Efficient encoding for a class of subspace subcodes.

Marten van Dijk, Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 1999

On Perfect Ternary Constant Weight Codes.

Jack H. van Lint, Ludo M. G. M. Tolhuizen

Des. Codes Cryptogr., 1999

1998

Correction to 'The Generalized Gilbert-Varshamov Bound is Implied by Turin's Theorem'.

Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 1998

Comment on "Error rate performance of the projection code".

Arie G. C. Koppelaar, Ludo M. G. M. Tolhuizen

IEEE Trans. Commun., 1998

On Codes with the Identifiable Parent Property.

Henk D. L. Hollmann, Jack H. van Lint, Jean-Paul M. G. Linnartz, Ludo M. G. M. Tolhuizen

J. Comb. Theory A, 1998

1997

The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction].

Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 1997

On Diamond codes.

C. P. M. J. Baggen, Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 1997

Protection of software algorithms executed on secure modules.

Henk D. L. Hollmann, Jean-Paul M. G. Linnartz, Jacobus H. van Lint, Constant P. M. J. Baggen, Ludo M. G. M. Tolhuizen

Future Gener. Comput. Syst., 1997

1995

On the realizability of biorthogonal, m-dimensional two-band filter banks.

Ludo M. G. M. Tolhuizen, Henk D. L. Hollmann, Antonius A. C. M. Kalker

IEEE Trans. Signal Process., 1995

Constructions and properties of block codes for partial-response channels.

Ludo M. G. M. Tolhuizen, Kees A. Schouhamer Immink, Henk D. L. Hollmann

IEEE Trans. Inf. Theory, 1995

1994

On constructing regular filter banks from domain bounded polynomials.

Ludo M. G. M. Tolhuizen, Imran A. Shah, Antonius A. C. M. Kalker

IEEE Trans. Signal Process., 1994

A Note on "A Systematic (12, 8) Code for Correcting Single Errors and Detecting Adjacent Errors".

Mario Blaum, Jehoshua Bruck, Ludo M. G. M. Tolhuizen

IEEE Trans. Computers, 1994

1993

A Sharpening of the Johnson Bound for Binary Linear Codes and Nonexistence of Linear Codes with Preparata Parameters.

Andries E. Brouwer, Ludo M. G. M. Tolhuizen

Des. Codes Cryptogr., 1993

1992

On the weight enumerator of product codes.

Ludo M. G. M. Tolhuizen, C. P. M. J. Baggen

Discret. Math., 1992

1991

Two new binary codes obtained by shortening a generalized concatenated code.

Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 1991

1990

On the minimum distance of combinatorial codes.

Ludo M. G. M. Tolhuizen, Jacobus H. van Lint

IEEE Trans. Inf. Theory, 1990

1988

A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for a linear block code.

Ludo M. G. M. Tolhuizen, Wil J. van Gils

IEEE Trans. Inf. Theory, 1988

1987

New binary linear block codes.

Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 1987