default search action
René Struik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [i2]Pascal Thubert, Behçet Sarikaya, Mohit Sethi, René Struik:
Address-Protected Neighbor Discovery for Low-Power and Lossy Networks. RFC 8928: 1-29 (2020)
2010 – 2019
- 2012
- [i1]Tim Winter, Pascal Thubert, Anders Brandt, Jonathan W. Hui, Richard Kelsey, Philip Alexander Levis, Kris Pister, René Struik, Jean-Philippe Vasseur, Roger K. Alexander:
RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks. RFC 6550: 1-157 (2012) - 2010
- [c6]René Struik:
Batch Computations Revisited: Combining Key Computations and Batch Verifications. Selected Areas in Cryptography 2010: 130-142
2000 – 2009
- 2005
- [c5]Adrian Antipa, Daniel R. L. Brown, Robert P. Gallant, Robert J. Lambert, René Struik, Scott A. Vanstone:
Accelerated Verification of ECDSA Signatures. Selected Areas in Cryptography 2005: 307-318 - 2003
- [c4]Adrian Antipa, Daniel R. L. Brown, Alfred Menezes, René Struik, Scott A. Vanstone:
Validation of Elliptic Curve Public Keys. Public Key Cryptography 2003: 211-223 - [c3]Thomas S. Messerges, Johnas Cukier, Tom A. M. Kevenaar, Larry Puhl, René Struik, Ed Callaway:
A security design for a general purpose, self-organizing, multihop ad hoc wireless network. SASN 2003: 1-11 - 2001
- [c2]Fabian Kuhn, René Struik:
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms. Selected Areas in Cryptography 2001: 212-229
1990 – 1999
- 1998
- [j3]Simon Litsyn, Patrick Solé, René Struik:
On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance. Discret. Appl. Math. 82(1-3): 177-191 (1998) - 1994
- [j2]René Struik:
An improvement of the Van Wee bound for binary linear covering codes. IEEE Trans. Inf. Theory 40(4): 1280-1284 (1994) - [j1]René Struik:
On the structure of linear codes with covering radius two and three. IEEE Trans. Inf. Theory 40(5): 1406-1416 (1994)
1980 – 1989
- 1987
- [c1]René Struik, Johan van Tilburg:
The Rao-Nam Scheme is Insecure Against a Chosen-Plaintext Attack. CRYPTO 1987: 445-457
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: