The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack. - René Struik; Johan van Tilburg (CRYPTO, 1987)

An improvement of the Van Wee bound for binary linear covering codes. - René Struik (IEEE Trans. Inf. Theory, 1994)

On the structure of linear codes with covering radius two and three. - René Struik (IEEE Trans. Inf. Theory, 1994)

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)

Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms. - Fabian Kuhn; René Struik (Selected Areas in Cryptography, 2001)

Validation of Elliptic Curve Public Keys. - Adrian Antipa; Daniel R. L. Brown; Alfred Menezes; René Struik; Scott A. Vanstone (Public Key Cryptography, 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 (SASN, 2003)

Accelerated Verification of ECDSA Signatures. - Adrian Antipa; Daniel R. L. Brown; Robert P. Gallant; Robert J. Lambert; René Struik; Scott A. Vanstone (Selected Areas in Cryptography, 2005)

Batch Computations Revisited: Combining Key Computations and Batch Verifications. - René Struik (Selected Areas in Cryptography, 2010)

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, 2012)

Address-Protected Neighbor Discovery for Low-Power and Lossy Networks. - Pascal Thubert; Behçet Sarikaya; Mohit Sethi; René Struik (RFC, 2020)