Ludo Tolhuizen

According to our database1, Ludo Tolhuizen authored at least 60 papers between 1987 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Shorter Messages and Faster Post-Quantum Encryption with Round5 on Cortex M.
IACR Cryptology ePrint Archive, 2018

Round5: Compact and Fast Post-Quantum Public-Key Encryption.
IACR Cryptology ePrint Archive, 2018

Maximum weight spectrum codes with reduced length.
CoRR, 2018

A Multi-layer Recursive Residue Number System.
CoRR, 2018

A Multi-layer Recursive Residue Number System.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Improved key-reconciliation method.
IACR Cryptology ePrint Archive, 2017

spKEX: An optimized lattice-based key exchange.
IACR Cryptology ePrint Archive, 2017

Round2: KEM and PKE based on GLWR.
IACR Cryptology ePrint Archive, 2017

2016
Attacks and parameter choices in HIMMO.
IACR Cryptology ePrint Archive, 2016

Efficient quantum-resistant trust Infrastructure based on HIMMO.
IACR Cryptology ePrint Archive, 2016

2015
A comprehensive and lightweight security architecture to secure the IoT throughout the lifecycle of a device based on HIMMO.
IACR Cryptology ePrint Archive, 2015

Results on polynomial interpolation with mixed modular operations and unknown moduli.
IACR Cryptology ePrint Archive, 2015

HIMMO: a collusion-resistant identity-based scheme for symmetric key generation.
ACM Comm. Computer Algebra, 2015

DTLS-HIMMO: Achieving DTLS Certificate Security with Symmetric Key Overhead.
Proceedings of the Computer Security - ESORICS 2015, 2015

A Comprehensive and Lightweight Security Architecture to Secure the IoT Throughout the Lifecycle of a Device Based on HIMMO.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
HIMMO - A Lightweight, Fully Collusion Resistant Key Pre-Distribution Scheme.
IACR Cryptology ePrint Archive, 2014

DTLS-HIMMO: Efficiently Securing a Post-Quantum World with a Fully-Collusion Resistant KPS.
IACR Cryptology ePrint Archive, 2014

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

The MMO problem.
CoRR, 2014

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

The MMO problem.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

An Algorithm to Analyze Non-injective S-Boxes.
Proceedings of the Information and Communication Technology, 2014

2012
Lighting systems control for demand response.
Proceedings of the IEEE PES Innovative Smart Grid Technologies Conference, 2012

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

2010
Bounds for codes for a non-symmetric ternary channel
CoRR, 2010

2009
Candle in the woods: asymptotic bounds on minimum blocking sets.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Quaternary Unequal Error Protection Codes.
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.
IEEE Trans. Information Theory, 2007

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

2006
Generic erasure correcting sets: Bounds and constructions.
J. Comb. Theory, Ser. A, 2006

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

Generating parity check equations for bounded-distance iterative erasure decoding
CoRR, 2006

2005
Polynomial time algorithms for multicast network code construction.
IEEE Trans. Information Theory, 2005

XOR-based Visual Cryptography Schemes.
Des. Codes Cryptography, 2005

On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size
CoRR, 2005

2003
Common coordinates in consecutive addresses.
IEEE Trans. Information Theory, 2003

Polynomial time algorithms for network information flow.
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.
IEEE Trans. Information Theory, 2002

A polarisation based Visual Crypto System and its Secret Sharing Schemes.
IACR Cryptology ePrint Archive, 2002

An addition to the paper: A polarisation based visual crypto system and its secret sharing schemes.
IACR Cryptology ePrint Archive, 2002

2000
New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback.
IEEE Trans. Information Theory, 2000

1999
Efficient encoding for a class of subspace subcodes.
IEEE Trans. Information Theory, 1999

On Perfect Ternary Constant Weight Codes.
Des. Codes Cryptography, 1999

1998
Correction to 'The Generalized Gilbert-Varshamov Bound is Implied by Turin's Theorem'.
IEEE Trans. Information Theory, 1998

Comment on "Error rate performance of the projection code".
IEEE Trans. Communications, 1998

On Codes with the Identifiable Parent Property.
J. Comb. Theory, Ser. A, 1998

1997
The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction].
IEEE Trans. Information Theory, 1997

On Diamond codes.
IEEE Trans. Information Theory, 1997

Protection of software algorithms executed on secure modules.
Future Generation Comp. Syst., 1997

1995
On the realizability of biorthogonal, m-dimensional two-band filter banks.
IEEE Trans. Signal Processing, 1995

Constructions and properties of block codes for partial-response channels.
IEEE Trans. Information Theory, 1995

1994
On constructing regular filter banks from domain bounded polynomials.
IEEE Trans. Signal Processing, 1994

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

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

1992
On the weight enumerator of product codes.
Discrete Mathematics, 1992

1991
Two new binary codes obtained by shortening a generalized concatenated code.
IEEE Trans. Information Theory, 1991

1990
On the minimum distance of combinatorial codes.
IEEE Trans. Information 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.
IEEE Trans. Information Theory, 1988

1987
New binary linear block codes.
IEEE Trans. Information Theory, 1987


  Loading...