hero image
Wayne Patterson, Ph.D. - Fielding Graduate University. Washington, DC, UNITED STATES

Wayne Patterson, Ph.D.

Public Trustee | Fielding Graduate University

Washington, DC, UNITED STATES

Professor of Computer Science at Howard University; expert in cryptography and computer security

Media

Publications:

Wayne Patterson, Ph.D. Publication

Documents:

Photos:

Videos:

Audio/Podcasts:

Social

Biography

Dr. Patterson is a Professor of Computer Science at Howard University. He is also currently Co-Principal Investigator for the GEAR UP project at Howard. He has also been Director of the Cybersecurity Research Center, Associate Vice Provost for Research, and Senior Fellow for Research and International Affairs in the Graduate School at Howard. He has also been Chair of the Department of Computer Science at the University of New Orleans, and in 1988 Associate Vice Chancellor for Research at that university.

In 1993, he was appointed Vice President for Research and Professional and Community Services, and Dean of the Graduate School at the College of Charleston and the University of Charleston, South Carolina. In 1998, he was selected by the Council of Graduate Schools, the national organization of graduate deans and graduate schools, as the Dean in Residence at the national office in Washington, DC. His other service to the graduate community in the United States has included being elected to the Presidency of the Conference of Southern Graduate Schools, and also to the Board of Directors of the Council of Graduate Schools.

Dr. Patterson has published more than 50 scholarly articles primarily related to cybersecurity, and a leading textbook, Mathematical Cryptology (Rowman and Littlefield, 1986). He has been the principal investigator on over 35 external grants valued at over $6,000,000. In August 2006, he was loaned by Howard University to the US National Science Foundation to serve as the Foundation’s Program Manager for International Science and Engineering in Developing Countries.

Industry Expertise (5)

Computer Software

Computer Hardware

Computer/Network Security

Education/Learning

Research

Areas of Expertise (7)

Computer Security

Scientific Computing

Information Security

Theory of Computation

Numerical Methods

Cryptography

Algorithms

Education (4)

University of Michigan, Ann Arbor: PhD, Mathematics 1971

University of New Brunswick: MSc, Computer Science 1982

University of Toronto: MSc, Mathematicw 1967

University of Toronto: BSc, Honors Mathematics 1966

Articles (5)

On the Development of Digital Signatures for Author Identification


Biometrics: Theory, Applications, and Systems

2007 With the increasing numbers of books converted to a digital format, represented generally with underlying ASCII text, it is now feasible to perform frequency analyses on the components of a book. This leads to the question of whether or not frequency analysis can ...

view more


RSA as a Benchmark for Multiprocessor Machines


Advances in Cryptology

1990 The authors have undertaken a project to develop benchmarks for RSA encryption on various pipelined and parallel machines. The initial machines selected for the analysis are the IBM 3090 Vector Computer, the Inmos T800 Transputer Development System, and the ...

view more


An implementation of a zero-knowledge protocol for a secure network login procedure


Energy and Information Technologies in the Southeast

1989 The concept of a zero-knowledge protocol has led to the consideration of the feasibility of implementing a secure password protocol, one that does not involve the transmission of any information concerning the password during the logon process. ...

view more


A More Efficient Public-Key Cryptosystem Using the Pascal Triangle


World Prosperity Through Communications

1989 The authors propose a public-key cryptosystem that uses a knapsack model based on the structure of a Pascal triangle or a super-Pascal triangle as defined herein. Most knapsack cryptosystems are based on superincreasing knapsack sets and are low density. Such low-density sets have been effectively cryptoanalyzed by the methods of Lagarias and Odlyzko (1985) and Brickell (1983)...

view more


A generalization of the knapsack algorithm using Galois fields


Cryptologia

1984 The authors suggest a generalization of the knapsack method proposed by Merkle and Hellman for the encryption of data...

view more


 Your profile is not published.

Contact