Allen Roginsky

1.2k total citations
30 papers, 251 citations indexed

About

Allen Roginsky is a scholar working on Computer Networks and Communications, Computer Vision and Pattern Recognition and Artificial Intelligence. According to data from OpenAlex, Allen Roginsky has authored 30 papers receiving a total of 251 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computer Networks and Communications, 11 papers in Computer Vision and Pattern Recognition and 11 papers in Artificial Intelligence. Recurrent topics in Allen Roginsky's work include Chaos-based Image/Signal Encryption (10 papers), Cryptographic Implementations and Security (8 papers) and Interconnection Networks and Systems (7 papers). Allen Roginsky is often cited by papers focused on Chaos-based Image/Signal Encryption (10 papers), Cryptographic Implementations and Security (8 papers) and Interconnection Networks and Systems (7 papers). Allen Roginsky collaborates with scholars based in United States and Egypt. Allen Roginsky's co-authors include Ken Christensen, Miguel Jimeno, Elaine B. Barker, Mohammad Peyravian, Andrew Regenscheid, Lily Chen, René Peralta, Dustin Moody, Ray Perlner and Kenneth J. Christensen and has published in prestigious journals such as Electronics Letters, Computer Communications and Computers & Security.

In The Last Decade

Allen Roginsky

27 papers receiving 230 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Allen Roginsky United States 9 136 108 71 50 25 30 251
Pelle Jakovits Estonia 8 154 1.1× 48 0.4× 170 2.4× 50 1.0× 13 0.5× 17 273
Paulo Sérgio Almeida Portugal 11 342 2.5× 78 0.7× 78 1.1× 13 0.3× 21 0.8× 36 384
Lingfan Yu China 4 62 0.5× 188 1.7× 40 0.6× 114 2.3× 26 1.0× 6 316
Xuying Meng China 10 72 0.5× 176 1.6× 68 1.0× 28 0.6× 13 0.5× 26 269
Fangfang Liu China 9 48 0.4× 160 1.5× 115 1.6× 25 0.5× 20 0.8× 43 282
Gopinath Chennupati United States 9 92 0.7× 85 0.8× 39 0.5× 18 0.4× 6 0.2× 36 231
Keqiu Li China 9 386 2.8× 84 0.8× 80 1.1× 15 0.3× 11 0.4× 24 452
Yilei Wang China 9 50 0.4× 140 1.3× 87 1.2× 31 0.6× 29 1.2× 49 268
Marc Manzano Spain 6 149 1.1× 95 0.9× 128 1.8× 24 0.5× 3 0.1× 12 288

Countries citing papers authored by Allen Roginsky

Since Specialization
Citations

This map shows the geographic impact of Allen Roginsky'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 Allen Roginsky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Allen Roginsky more than expected).

Fields of papers citing papers by Allen Roginsky

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Allen Roginsky. 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 Allen Roginsky. The network helps show where Allen Roginsky may publish in the future.

Co-authorship network of co-authors of Allen Roginsky

This figure shows the co-authorship network connecting the top 25 collaborators of Allen Roginsky. A scholar is included among the top collaborators of Allen Roginsky 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 Allen Roginsky. Allen Roginsky 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.
Yashchuk, Valeriy V., Stefano Cabrini, Weilun Chao, et al.. (2020). Binary pseudorandom array test standard optimized for characterization of large field-of-view optical interferometers. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). 30–30. 10 indexed citations
2.
Moody, Dustin, René Peralta, Ray Perlner, et al.. (2015). Report on Pairing-based Cryptography. Journal of Research of the National Institute of Standards and Technology. 120. 11–11. 28 indexed citations
3.
Barker, Elaine B. & Allen Roginsky. (2011). SP 800-131A. Transitions: Recommendation for Transitioning the Use of Cryptographic Algorithms and Key Lengths. 30 indexed citations
4.
Barker, Elaine B. & Allen Roginsky. (2010). Recommendation for the Transitioning of Cryptographic Algorithms and Key Sizes. 10 indexed citations
5.
Jimeno, Miguel, Kenneth J. Christensen, & Allen Roginsky. (2008). Two-tier Bloom filter to achieve faster membership testing. Electronics Letters. 44(7). 503–504. 5 indexed citations
6.
Jimeno, Miguel, Ken Christensen, & Allen Roginsky. (2007). A Power Management Proxy with a New Best-of-N Bloom Filter Design to Reduce False Positives. 125–133. 12 indexed citations
7.
Christensen, Ken, et al.. (2005). Targeted search: reducing the time and cost for searching for objects in multiple-server networks. 2004. 143–149. 1 indexed citations
8.
Christensen, Ken, Kenji Yoshigoe, Allen Roginsky, & Neil J. Günther. (2004). Performance of packet-to-cell segmentation schemes in input buffered packet switches. 1097–1102 Vol.2. 4 indexed citations
9.
Peyravian, Mohammad, et al.. (2003). Methods for preventing unauthorized software distribution. Computers & Security. 22(4). 316–321. 4 indexed citations
10.
Roginsky, Allen, et al.. (2002). Determining cell loss bounds for ATM quality-of-service. 191–197. 1 indexed citations
11.
Peyravian, Mohammad, et al.. (2000). Multiparty Biometric-Based Authentication. Computers & Security. 19(4). 369–374. 1 indexed citations
12.
Peyravian, Mohammad, et al.. (2000). Generation of RSA Keys That Are Guaranteed to be Unique for Each User. Computers & Security. 19(3). 282–288. 2 indexed citations
13.
Bhanu, S. Vijay, Allen Roginsky, & Kenneth J. Christensen. (1999). Reducing ATM CAC overhead by utilising aggregated traffic statistics. IEE Proceedings - Communications. 146(4). 209–209. 1 indexed citations
14.
Peyravian, Mohammad, et al.. (1999). Generating user-based cryptographic keys and random numbers. Computers & Security. 18(7). 619–626. 13 indexed citations
15.
Peyravian, Mohammad, et al.. (1999). Hash-based encryption system. Computers & Security. 18(4). 345–350. 10 indexed citations
16.
Roginsky, Allen, et al.. (1999). New methods for shortest path selection for multimedia traffic with two delay constraints. Computer Communications. 22(17). 1531–1539.
17.
Peyravian, Mohammad, Allen Roginsky, & Ajay D. Kshemkalyani. (1998). On probabilities of hash value matches. Computers & Security. 17(2). 171–176. 9 indexed citations
18.
Gennaro, Rosario, Paul A. Karger, Stephen M. Matyas, et al.. (1997). Two-phase cryptographic key recovery system. Computers & Security. 16(6). 481–506. 3 indexed citations
19.
Roginsky, Allen, et al.. (1997). Analysis of ATM cell loss for systems with on/off traffic sources. IEE Proceedings - Communications. 144(3). 129–129. 3 indexed citations
20.
Roginsky, Allen. (1994). A Central Limit Theorem for Cumulative Processes. Advances in Applied Probability. 26(1). 104–121. 7 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

Rankless by CCL
2026