René Struik - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2020

Address-Protected Neighbor Discovery for Low-Power and Lossy NetworksPascal Thubert, Behçet Sarikaya, Mohit Sethi, René Struik. rfc, 8928:1-29, November 2020. [doi]

2012

RPL: IPv6 Routing Protocol for Low-Power and Lossy NetworksTim Winter, Pascal Thubert, Anders Brandt, Jonathan W. Hui, Richard Kelsey, Philip Levis, Kris Pister, René Struik, Jean-Philippe Vasseur, Roger K. Alexander. rfc, 6550:1-157, March 2012. [doi]

2010

Batch Computations Revisited: Combining Key Computations and Batch VerificationsRené Struik. sacrypt 2011: 130-142 [doi]

2005

Accelerated Verification of ECDSA SignaturesAdrian Antipa, Daniel R. L. Brown, Robert P. Gallant, Robert J. Lambert, René Struik, Scott A. Vanstone. sacrypt 2006: 307-318 [doi]

2003

Validation of Elliptic Curve Public KeysAdrian Antipa, Daniel R. L. Brown, Alfred Menezes, René Struik, Scott A. Vanstone. pkc 2002: 211-223 [doi]

A security design for a general purpose, self-organizing, multihop ad hoc wireless networkThomas S. Messerges, Johnas Cukier, Tom A. M. Kevenaar, Larry Puhl, René Struik, Ed Callaway. sasn 2003: 1-11 [doi]

2001

Random Walks Revisited: Extensions of Pollard s Rho Algorithm for Computing Multiple Discrete LogarithmsFabian Kuhn, René Struik. sacrypt 2001: 212-229 [doi]

1998

On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual DistanceSimon Litsyn, Patrick Solé, René Struik. DAM, 82(1-3):177-191, 1998. [doi]

1994

An improvement of the Van Wee bound for binary linear covering codesRené Struik. TIT, 40(4):1280, 1994.

On the structure of linear codes with covering radius two and threeRené Struik. TIT, 40(5):1406-1416, 1994.

1987

The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext AttackRené Struik, Johan van Tilburg. crypto 1988: 445-457 [doi]

Sign in or sign up to see more results.

runs on WebDSL