Examples: Prince; Princeton University; Ken Follett; Follett,Ken
1shortlisttitle datasearch history  
results search [or] ISN:0000000108850569 | 1 hits
Person
ISNI: 
0000 0001 0885 0569
Name: 
Vanstone, S. A.
Vanstone, Scott
Vanstone, Scott A.
Vanstone, Scott Alexander
Dates: 
1947-2014
Creation class: 
article
Computer file
Language material
Manuscript language material
Text
txt
Creation role: 
author
editor
redactor
Related names: 
Fuji-Hara, R.
Fuji-Hara, Ryoh
Gilbert, William J. (1941- ))
Hankerson, Darrel R.
Jungnickel, D. (1952-)
Jungnickel, Dieter (1952-)
Menezes, A. J. (1965-) (Alfred J.))
Menezes, Alfred J. (1965- ))
Oorschot, Paul C. van
University of Waterloo
University of Waterloo. Department of Combinatorics and Optimization
University of Waterloo. Faculty of Mathematics
Van Oorschot, Paul C.
Titles: 
Advances in cryptology - CRYPTO '90 : proceedings
Classical algebra
Coding theory, design theory, group theory : proceedings of the Marshall Hall Conference
Conical embeddings of Steiner systems S(3,2a+1 ; 2ab+1)
Cryptoanalysis of the Sakazaki-Okamoto-Mambo ID-based key distribution system over elliptic curves (extended abstract)
Enumeration and design : [papers from a portion of the Silver Jubilee Conference on Combinatorics, University of Waterloo, June 14-July 2, 1982]
existence of Howell designs of side 2n and order 2n+2, The
existence of orthogonal resolutions of lines in AG(n, q), The
existence on non-trivial hyperfactorizations of K@[subsript]n, The
Faster point multiplication on elliptic curves with efficient endomorphisms
Graphical codes revisited
Guide to elliptic curve cryptography
Hanani triple systems
Handbook of applied cryptography
Hyperfactorizations of graphs and 5-designs
Improving the parallelized Pollard lambda search on binary anomalous curves
introduction to error correcting codes with applications, An
introduction to mathematical thinking, 2005:, An
Isomorphism classes of elliptic curves over finite fields
Isomorphism of strong starters in cyclic groups
Kryptografia stosowana
Message Authentication Codes with Error Correcting Capabilities
On the construction of low complexity normal bases
On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays
Postal revenue collection in the digital age
Provably secure implicit certificate schemes
(R,1)-Designs on projective planes and skew resolutions on AG(3,q)
Recursive constructions for skew resolutions in affine geometries
Selected papers in combinatorics a volume dedicated to R. G. Stanton
structure of regular pair-wise balanced designs, The
Subspaces and polynomial factorizations over finite fields
Transversal designs and doubly resolvable designs
Using block designs to analyze a root-finding algorithm of Berlekamp
Contributed to or performed: 
LECTURE NOTES IN COMPUTER SCIENCE
Notes: 
Thesis (Ph. D.)--University of Waterloo, 1974
Sources: 
VIAF BNC LAC LC NKC NLP NTA NUKAT SELIBR SUDOC WKP
ZETO