René Struik

According to our database, René Struik authored at least 11 papers between 1987 and 2020.

Collaborative distances:

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

2020

Address-Protected Neighbor Discovery for Low-Power and Lossy Networks.

Pascal Thubert, Behçet Sarikaya, Mohit Sethi, René Struik

RFC, November, 2020

2012

RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks.

Tim Winter, Pascal Thubert, Anders Brandt, Jonathan W. Hui, Richard Kelsey, Philip Alexander Levis, Kris Pister, René Struik, Jean-Philippe Vasseur, Roger K. Alexander

RFC, March, 2012

2010

Batch Computations Revisited: Combining Key Computations and Batch Verifications.

René Struik

Proceedings of the Selected Areas in Cryptography - 17th International Workshop, 2010

2005

Accelerated Verification of ECDSA Signatures.

Adrian Antipa, Daniel R. L. Brown, Robert P. Gallant, Robert J. Lambert, René Struik, Scott A. Vanstone

Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

2003

A security design for a general purpose, self-organizing, multihop ad hoc wireless network.

Thomas S. Messerges, Johnas Cukier, Tom A. M. Kevenaar, Larry Puhl, René Struik, Ed Callaway

Proceedings of the 1st ACM Workshop on Security of ad hoc and Sensor Networks, 2003

Validation of Elliptic Curve Public Keys.

Adrian Antipa, Daniel R. L. Brown, Alfred Menezes, René Struik, Scott A. Vanstone

Proceedings of the Public Key Cryptography, 2003

2001

Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms.

Fabian Kuhn, René Struik

Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

1998

On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance.

Simon Litsyn, Patrick Solé, René Struik

Discret. Appl. Math., 1998

1994

On the structure of linear codes with covering radius two and three.

René Struik

IEEE Trans. Inf. Theory, 1994

An improvement of the Van Wee bound for binary linear covering codes.

René Struik

IEEE Trans. Inf. Theory, 1994

1987

The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack.

René Struik, Johan van Tilburg

Proceedings of the Advances in Cryptology, 1987