default search action
Scott A. Vanstone
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [i1]Daniel R. L. Brown, Matthew J. Campagna, Scott A. Vanstone:
Security of ECQV-Certified ECDSA Against Passive Adversaries. IACR Cryptol. ePrint Arch. 2009: 620 (2009) - 2005
- [c18]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
- [j61]Scott A. Vanstone:
Next generation security for wireless: elliptic curve cryptography. Comput. Secur. 22(5): 412-415 (2003) - [j60]Laurie Law, Alfred Menezes, Minghua Qu, Jerome A. Solinas, Scott A. Vanstone:
An Efficient Protocol for Authenticated Key Agreement. Des. Codes Cryptogr. 28(2): 119-134 (2003) - [c17]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 - 2002
- [c16]Charles C. Y. Lam, Guang Gong, Scott A. Vanstone:
Message Authentication Codes with Error Correcting Capabilities. ICICS 2002: 354-366 - 2001
- [j59]Don Johnson, Alfred Menezes, Scott A. Vanstone:
The Elliptic Curve Digital Signature Algorithm (ECDSA). Int. J. Inf. Sec. 1(1): 36-63 (2001) - [c15]Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone:
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. CRYPTO 2001: 190-200 - [c14]Daniel R. L. Brown, Robert P. Gallant, Scott A. Vanstone:
Provably Secure Implicit Certificate Schemes. Financial Cryptography 2001: 147-156 - 2000
- [j58]Neal Koblitz, Alfred Menezes, Scott A. Vanstone:
The State of Elliptic Curve Cryptography. Des. Codes Cryptogr. 19(2/3): 173-193 (2000) - [j57]Robert P. Gallant, Robert J. Lambert, Scott A. Vanstone:
Improving the parallelized Pollard lambda search on anomalous binary curves. Math. Comput. 69(232): 1699-1705 (2000) - [c13]Leon A. Pintsov, Scott A. Vanstone:
Postal Revenue Collection in the Digital Age. Financial Cryptography 2000: 105-120
1990 – 1999
- 1999
- [j56]Dieter Jungnickel, Scott A. Vanstone:
q-ary graphical codes. Discret. Math. 208-209: 375-386 (1999) - 1998
- [j55]Volker Müller, Scott A. Vanstone, Robert J. Zuccherato:
Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2. Des. Codes Cryptogr. 14(2): 159-178 (1998) - 1997
- [j54]Scott A. Vanstone:
Elliptic curve cryptosystem - The answer to strong, fast public-key cryptography for securing constrained environments. Inf. Secur. Tech. Rep. 2(2): 78-87 (1997) - [j53]Dieter Jungnickel, Scott A. Vanstone:
Graphical codes revisited. IEEE Trans. Inf. Theory 43(1): 136-146 (1997) - [j52]Scott A. Vanstone, Robert J. Zuccherato:
Elliptic curve cryptosystems using curves of smooth order over the ring Zn. IEEE Trans. Inf. Theory 43(4): 1231-1237 (1997) - 1996
- [b1]Alfred Menezes, Paul C. van Oorschot
, Scott A. Vanstone:
Handbook of Applied Cryptography. CRC Press 1996, ISBN 0-8493-8523-7 - [j51]Dieter Jungnickel, Marialuisa J. de Resmini, Scott A. Vanstone:
Codes Based on Complete Graphs. Des. Codes Cryptogr. 8(1-2): 159-165 (1996) - 1995
- [j50]Therese C. Y. Lee, Scott A. Vanstone:
Subspaces and polynomial factorizations over finite fields. Appl. Algebra Eng. Commun. Comput. 6: 147-157 (1995) - [j49]Scott A. Vanstone, Robert J. Zuccherato:
Short RSA Keys and Their Generation. J. Cryptol. 8(2): 101-114 (1995) - 1994
- [j48]Minghua Qu, Scott A. Vanstone:
Factorizations in the Elementary Abelian p-Group and Their Cryptographic Significance. J. Cryptol. 7(4): 201-212 (1994) - [c12]Shuhong Gao, Scott A. Vanstone:
On orders of optimal normal basis generators. ANTS 1994: 220 - 1993
- [j47]Esther R. Lamken, Scott A. Vanstone:
Existence results for doubly near resolvable (upsilon, 3, 2)-BIBDs. Discret. Math. 120(1-3): 135-148 (1993) - [j46]Gordon B. Agnew, Thomas Beth, Ronald C. Mullin, Scott A. Vanstone:
Arithmetic Operations in GF(2m). J. Cryptol. 6(1): 3-13 (1993) - [j45]Alfred Menezes, Scott A. Vanstone:
Elliptic Curve Cryptosystems and Their Implementations. J. Cryptol. 6(4): 209-224 (1993) - [j44]Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
An Implementation of Elliptic Curve Cryptosystems Over F2155. IEEE J. Sel. Areas Commun. 11(5): 804-813 (1993) - [j43]Alfred Menezes, Tatsuaki Okamoto, Scott A. Vanstone:
Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inf. Theory 39(5): 1639-1646 (1993) - 1992
- [j42]Alfred Menezes, Scott A. Vanstone:
A Note on Cycloc Groups, Finite Fields, and the Discrete Logarithm Problem. Appl. Algebra Eng. Commun. Comput. 3: 67-74 (1992) - [j41]Vladimir D. Tonchev
On Kirkman triple systems of order 33. Discret. Math. 106-107: 493-496 (1992) - [j40]Alfred Menezes, Paul C. van Oorschot
Subgroup Refinement Algorithms for Root Finding in GF(q). SIAM J. Comput. 21(2): 228-239 (1992) - [j39]Albrecht Beutelspacher, Dieter Jungnickel, Paul C. van Oorschot, Scott A. Vanstone:
Pair-Splitting Sets in AG(m, q). SIAM J. Discret. Math. 5(4): 451-459 (1992) - [c11]Greg Harper, Alfred Menezes, Scott A. Vanstone:
Public-Key Cryptosystems with Very Small Key Length. EUROCRYPT 1992: 163-173 - [c10]Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
On the Development of a Fast Elliptic Curve Cryptosystem. EUROCRYPT 1992: 482-487 - 1991
- [j38]Endre Boros
The existence of non-trivial hyperfactorization of K2n. Comb. 11(1): 9-15 (1991) - [j37]Brendan D. McKay, Jennifer Seberry, Scott A. Vanstone:
Ralph Gordon Stanton. Discret. Math. 92(1-3): 1-8 (1991) - [j36]Dieter Jungnickel, Scott A. Vanstone:
Triple systems in PG(2, q). Discret. Math. 92(1-3): 131-135 (1991) - [j35]Esther R. Lamken, Rolf S. Rees, Scott A. Vanstone:
Class-uniformly resolvable pairwise balanced designs with block sizes two and three. Discret. Math. 92(1-3): 197-209 (1991) - [j34]Dieter Jungnickel, Ronald C. Mullin, Scott A. Vanstone:
The spectrum of alpha-resolvable block designs with block size 3. Discret. Math. 97(1-3): 269-277 (1991) - [j33]Kevin T. Phelps, Scott A. Vanstone:
Isomorphism of strong starters in cyclic groups. J. Comb. Theory A 57(2): 287-293 (1991) - [j32]Gordon B. Agnew, Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone:
An Implementation for a Fast Public-Key Cryptosystem. J. Cryptol. 3(2): 63-79 (1991) - [c9]Kenji Koyama, Ueli M. Maurer, Tatsuaki Okamoto, Scott A. Vanstone:
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn. CRYPTO 1991: 252-266 - [c8]Alfred Menezes, Scott A. Vanstone, Tatsuaki Okamoto:
Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. STOC 1991: 80-89 - [e1]Alfred Menezes, Scott A. Vanstone:
Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings. Lecture Notes in Computer Science 537, Springer 1991, ISBN 3-540-54508-5 [contents] - 1990
- [j31]Esther R. Lamken, Scott A. Vanstone:
Balanced tournament designs and resolvable (upsilon, 3, 2)-bibds. Discret. Math. 83(1): 37-47 (1990) - [j30]Paul C. van Oorschot
On splitting sets in block designs and finding roots of polynomials. Discret. Math. 84(1): 71-85 (1990) - [j29]Esther R. Lamken, Scott A. Vanstone:
The existence of skew Howell designs of side 2n and order 2n + 2. J. Comb. Theory A 54(1): 20-40 (1990) - [c7]Alfred Menezes, Scott A. Vanstone:
The Implementation of Elliptic Curve Cryptosystems. AUSCRYPT 1990: 2-13
1980 – 1989
- 1989
- [j28]Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone, R. M. Wilson:
Optimal normal bases in GF(pn). Discret. Appl. Math. 22(2): 149-161 (1989) - [j27]David W. Ash
Low complexity normal bases. Discret. Appl. Math. 25(3): 191-210 (1989) - [j26]D. J. Curran, Scott A. Vanstone:
Doubly resolvable designs from generalized Bhaskar Rao designs. Discret. Math. 73(1-2): 49-63 (1989) - [j25]Esther R. Lamken, Scott A. Vanstone:
Balanced tournament designs and related topics. Discret. Math. 77(1-3): 159-176 (1989) - [j24]Kevin T. Phelps, Douglas R. Stinson, Scott A. Vanstone:
The existence of simple S3(3, 4, v). Discret. Math. 77(1-3): 255-258 (1989) - [j23]Paul C. van Oorschot
A geometric approach to root finding in GF(qm). IEEE Trans. Inf. Theory 35(2): 444-453 (1989) - [c6]Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
A Fast Elliptic Curve Cryptosystem. EUROCRYPT 1989: 706-708 - 1988
- [j22]Esther R. Lamken, Scott A. Vanstone:
Orthogonal resolutions in odd balanced tournament designs. Graphs Comb. 4(1): 241-255 (1988) - [j21]Ryoh Fuji-Hara, Scott A. Vanstone:
Hyperplane skew resolutions and their applications. J. Comb. Theory A 47(1): 134-144 (1988) - [j20]Marshall Hall Jr., Robert Roth, G. H. John van Rees, Scott A. Vanstone:
On designs (22, 33, 12, 8, 4). J. Comb. Theory A 47(2): 157-175 (1988) - [j19]Douglas R. Stinson, Scott A. Vanstone:
A Combinatorial Approach to Threshold Schemes. SIAM J. Discret. Math. 1(2): 230-236 (1988) - [c5]Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
An Interactive Data Exchange Protocol Based on Discrete Exponentiation. EUROCRYPT 1988: 159-166 - [c4]Gordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone:
Fast Exponentiation in GF(2n). EUROCRYPT 1988: 251-255 - [c3]Alfred Menezes, Paul C. van Oorschot
Some Computational Aspects of Root Finding in GF(qm). ISSAC 1988: 259-270 - 1987
- [j18]Esther R. Lamken, W. H. Mills, Ronald C. Mullin, Scott A. Vanstone:
Coverings of Pairs by Quintuples. J. Comb. Theory A 44(1): 49-68 (1987) - [j17]Ryoh Fuji-Hara, Scott A. Vanstone:
The existence of orthogonal resolutions of lines in AG(n, q). J. Comb. Theory A 45(1): 139-147 (1987) - [c2]Douglas R. Stinson, Scott A. Vanstone:
A Combinatorial Approach to Threshold Schemes. CRYPTO 1987: 330-339 - 1986
- [j16]Esther R. Lamken, Scott A. Vanstone:
Existence results for KS3(v; 2, 4)s. Discret. Math. 62(2): 197-210 (1986) - [j15]Esther R. Lamken, Scott A. Vanstone:
Designs With Mutually Orthogonal Resolutions. Eur. J. Comb. 7(3): 249-257 (1986) - [j14]Dieter Jungnickel, Scott A. Vanstone:
On resolvable designs S3(3; 4, v). J. Comb. Theory A 43(2): 334-337 (1986) - 1985
- [j13]Douglas R. Stinson, Scott A. Vanstone:
A Kirkman square of order 51 and block size 3. Discret. Math. 55(1): 107-111 (1985) - [j12]William L. Kocay, Douglas R. Stinson, Scott A. Vanstone:
On strong starters in cyclic groups. Discret. Math. 56(1): 45-60 (1985) - 1984
- [c1]Ian F. Blake, Ronald C. Mullin, Scott A. Vanstone:
Computing Logarithms in GF(2n). CRYPTO 1984: 73-82 - 1982
- [j11]Ryoh Fuji-Hara, Scott A. Vanstone:
Orthogonal resolutions of lines in AG(n, q). Discret. Math. 41(1): 17-28 (1982) - 1981
- [j10]Paul J. Schellenberg, Douglas R. Stinson, Scott A. Vanstone, J. W. Yates:
The existence of Howell designs of side n+1 and order 2n. Comb. 1(3): 289-301 (1981) - [j9]Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, W. D. Wallis:
On the existence of frames. Discret. Math. 37(1): 79-104 (1981) - 1980
- [j8]Scott A. Vanstone:
Doubly resolvable designs. Discret. Math. 29(1): 77-86 (1980) - [j7]Rudolf Mathon, Scott A. Vanstone:
On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays. Discret. Math. 30(2): 157-172 (1980) - [j6]Ryoh Fuji-Hara, Scott A. Vanstone:
Transversal Designs and Doubly-resolvable Designs. Eur. J. Comb. 1(3): 219-223 (1980)
1970 – 1979
- 1979
- [j5]David McCarthy, Scott A. Vanstone:
On the structure of regular pairwise balanced designs. Discret. Math. 25(3): 237-244 (1979) - 1978
- [j4]Scott A. Vanstone:
Extremal (r, λ)-designs. Discret. Math. 23(1): 57-66 (1978) - [j3]Scott A. Vanstone:
Pairwise "Orthogonal Generalized Room Squares" and Equidistant Permutation Arrays. J. Comb. Theory A 25(1): 84-89 (1978) - 1977
- [j2]David McCarthy, Scott A. Vanstone:
Embedding (r, 1)-designs in finite projective planes. Discret. Math. 19(1): 67-76 (1977) - [j1]Scott A. Vanstone, Paul J. Schellenberg:
A Construction for Equidistant Permutation Arrays of Index One. J. Comb. Theory A 23(2): 180-186 (1977)
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-06-10 20:27 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: