Scott A. Vanstone

14.2k total citations · 3 hit papers
94 papers, 6.1k citations indexed

About

Scott A. Vanstone is a scholar working on Electrical and Electronic Engineering, Artificial Intelligence and Information Systems. According to data from OpenAlex, Scott A. Vanstone has authored 94 papers receiving a total of 6.1k indexed citations (citations by other indexed papers that have themselves been cited), including 55 papers in Electrical and Electronic Engineering, 46 papers in Artificial Intelligence and 24 papers in Information Systems. Recurrent topics in Scott A. Vanstone's work include graph theory and CDMA systems (53 papers), Coding theory and cryptography (36 papers) and Cryptography and Residue Arithmetic (24 papers). Scott A. Vanstone is often cited by papers focused on graph theory and CDMA systems (53 papers), Coding theory and cryptography (36 papers) and Cryptography and Residue Arithmetic (24 papers). Scott A. Vanstone collaborates with scholars based in Canada, United States and Germany. Scott A. Vanstone's co-authors include Alfred Menezes, Paul C. van Oorschot, Don B. Johnson, R. C. Mullin, Neal Koblitz, Takuya Okamoto, Gordon B. Agnew, Ian F. Blake, I. Onyszchuk and D. M. Jackson and has published in prestigious journals such as IEEE Transactions on Information Theory, Annals of the New York Academy of Sciences and IEEE Journal on Selected Areas in Communications.

In The Last Decade

Scott A. Vanstone

89 papers receiving 5.5k citations

Hit Papers

The Elliptic Curve Digital Signature Algorithm (ECDSA) 2001 2026 2009 2017 2001 2010 2018 400 800 1.2k
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. The Elliptic Curve Digital Signature Algorithm (ECDSA)
    2001 1.4k citations Scott A. Vanstone et al. profile →
  2. Handbook of Applied Cryptography
    2010 962 citations Scott A. Vanstone et al. profile →
  3. Handbook of Applied Cryptography
    2018 402 citations Scott A. Vanstone et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Scott A. Vanstone Canada 26 4.4k 3.2k 1.7k 1.2k 1.2k 94 6.1k
Alfred Menezes Canada 25 4.2k 1.0× 3.2k 1.0× 1.9k 1.1× 1.3k 1.1× 675 0.6× 76 5.8k
Mihir Bellare United States 36 5.6k 1.3× 2.3k 0.7× 2.4k 1.4× 1.1k 0.9× 454 0.4× 93 6.9k
Shafi Goldwasser United States 30 7.3k 1.7× 2.2k 0.7× 1.7k 1.0× 1.2k 1.0× 513 0.4× 90 8.3k
Whitfield Diffie United States 15 6.5k 1.5× 3.6k 1.1× 4.0k 2.4× 2.6k 2.2× 1.1k 0.9× 35 9.4k
Michael O. Rabin United States 28 3.2k 0.7× 771 0.2× 1.7k 1.0× 330 0.3× 323 0.3× 59 5.5k
Ran Canetti United States 38 5.9k 1.3× 2.3k 0.7× 3.3k 2.0× 744 0.6× 663 0.6× 121 7.6k
Shimon Even Israel 33 1.7k 0.4× 360 0.1× 2.3k 1.3× 467 0.4× 891 0.8× 94 5.5k
Kristin Lauter United States 25 2.9k 0.7× 1.1k 0.3× 539 0.3× 520 0.4× 293 0.2× 88 3.7k
Michael L. Fredman United States 26 1.7k 0.4× 472 0.1× 1.6k 1.0× 557 0.5× 475 0.4× 56 4.9k
Miklós Ajtai United States 30 2.5k 0.6× 356 0.1× 1.0k 0.6× 344 0.3× 505 0.4× 85 4.3k

Countries citing papers authored by Scott A. Vanstone

Since Specialization
Citations

This map shows the geographic impact of Scott A. Vanstone's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Scott A. Vanstone with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Scott A. Vanstone more than expected).

Fields of papers citing papers by Scott A. Vanstone

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Scott A. Vanstone. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Scott A. Vanstone. The network helps show where Scott A. Vanstone may publish in the future.

Co-authorship network of co-authors of Scott A. Vanstone

This figure shows the co-authorship network connecting the top 25 collaborators of Scott A. Vanstone. A scholar is included among the top collaborators of Scott A. Vanstone based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Scott A. Vanstone. Scott A. Vanstone is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Gao, Shuhong & Scott A. Vanstone. (1995). On Orders of Optimal Normal Basis Generators. Mathematics of Computation. 64(211). 1227–1227. 32 indexed citations
2.
Gao, Shuhong & Scott A. Vanstone. (1995). On orders of optimal normal basis generators. Mathematics of Computation. 64(211). 1227–1233. 20 indexed citations
3.
Jungnickel, D., et al.. (1993). Coding theory, design theory, group theory : proceedings of the Marshall Hall Conference. Wiley eBooks. 5 indexed citations
4.
Tonchev, Vladimir D. & Scott A. Vanstone. (1992). On Kirkman triple systems of order 33. Discrete Mathematics. 106-107. 493–496. 4 indexed citations
5.
Lamken, E. R., Rolf S. Rees, & Scott A. Vanstone. (1991). Class-uniformly resolvable pairwise balanced designs with block sizes two and three. Discrete Mathematics. 92(1-3). 197–209. 20 indexed citations
6.
Lamken, E. R. & Scott A. Vanstone. (1990). The existence of skew Howell designs of side 2n and order 2n + 2. Journal of Combinatorial Theory Series A. 54(1). 20–40. 4 indexed citations
7.
Ash, David, Ian F. Blake, & Scott A. Vanstone. (1989). Low complexity normal bases. Discrete Applied Mathematics. 25(3). 191–210. 92 indexed citations
8.
Phelps, Kevin T., Douglas R. Stinson, & Scott A. Vanstone. (1989). The existence of simple S3(3, 4, v). Discrete Mathematics. 77(1-3). 255–258. 16 indexed citations
9.
Lamken, E. R. & Scott A. Vanstone. (1989). Balanced tournament designs and related topics. Discrete Mathematics. 77(1-3). 159–176. 9 indexed citations
10.
Jungnickel, Dieter & Scott A. Vanstone. (1989). On primitive polynomials over finite fields. Journal of Algebra. 124(2). 337–353. 25 indexed citations
11.
Mullin, R. C., I. Onyszchuk, Scott A. Vanstone, & R. Wilson. (1988). Optimal normal bases in GF(pn). Discrete Applied Mathematics. 22(2). 149–161. 197 indexed citations
12.
Fuji‐Hara, Ryoh & Scott A. Vanstone. (1987). The existence of orthogonal resolutions of lines in AG(n, q). Journal of Combinatorial Theory Series A. 45(1). 139–147. 9 indexed citations
13.
Lamken, E. R., W. H. Mills, R. C. Mullin, & Scott A. Vanstone. (1987). Coverings of Pairs by Quintuples. Journal of Combinatorial Theory Series A. 44(1). 49–68. 14 indexed citations
14.
Lamken, E. R. & Scott A. Vanstone. (1986). Designs With Mutually Orthogonal Resolutions. European Journal of Combinatorics. 7(3). 249–257. 6 indexed citations
15.
Jungnickel, Dieter & Scott A. Vanstone. (1986). On resolvable designs S3(3; 4, v). Journal of Combinatorial Theory Series A. 43(2). 334–337. 9 indexed citations
16.
Jimbo, Masakazu & Scott A. Vanstone. (1984). Recursive constructions for resolvable and doubly resolvable 1-rotational Steiner 2-designs. 26. 45–61. 11 indexed citations
17.
Jackson, D. M. & Scott A. Vanstone. (1984). Enumeration and design. Academic Press eBooks. 100 indexed citations
18.
Fuji‐Hara, Ryoh & Scott A. Vanstone. (1982). Orthogonal resolutions of lines in AG(n,q). Discrete Mathematics. 41(1). 17–28. 3 indexed citations
19.
Mathon, Rudolf & Scott A. Vanstone. (1980). On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays. Discrete Mathematics. 30(2). 157–172. 21 indexed citations
20.
Vanstone, Scott A. & P. J. Schellenberg. (1977). A construction for equidistant permutation arrays of index one. Journal of Combinatorial Theory Series A. 23(2). 180–186. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Alfred Menezes Breakdown of academic impact, for papers by Mihir Bellare Breakdown of academic impact, for papers by Shafi Goldwasser Breakdown of academic impact, for papers by Whitfield Diffie Breakdown of academic impact, for papers by Michael O. Rabin Breakdown of academic impact, for papers by Ran Canetti Breakdown of academic impact, for papers by Shimon Even Breakdown of academic impact, for papers by Kristin Lauter Breakdown of academic impact, for papers by Michael L. Fredman Breakdown of academic impact, for papers by Miklós Ajtai
Rankless by CCL
2026