An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
https://www.nist.gov/people/morris-j-dworkin
Morris J. Dworkin (Fed)
Computer Scientist
Projects:
AES
Interests:
Block Ciphers
Cryptanalysis
Algebraic Combinatorics
Professional Publications:
E. Roback and M. Dworkin, First Advanced Encryption Standard Candidate Conference, to appear in NIST Journal of Research.
M. Dworkin, An Interpretation for Garsia and Remmel’s q-Hit Numbers, Journal of Combinatorial Theory, Series A, 81 (1998), 149-175.
M. Dworkin, Factorization of the Cover Polynomial, Journal of Combinatorial Theory, Series B, 71 (1997), 17-53.
This Recommendation specifies the Galois/Counter Mode (GCM), an algorithm for authenticated encryption with associated data, and its specialization, GMAC, for
This Recommendation specifies a message authentication code (MAC) algorithm based on a symmetric key block cipher. This block cipher-based MAC algorithm, called
This Recommendation defines a mode of operation, called Counter with Cipher Block Chaining-Message Authentication Code (CCM), for a symmetric key block cipher
This report focuses on the NIST-recommended block cipher modes of operation specified in NIST Special Publications (SP) 800-38A through 800-38F. The goal is to
National Institute of Standards and Technology (NIST), Morris J. Dworkin, Meltem Sonmez Turan, Nicky Mouha
In 2000, NIST announced the selection of the Rijndael block cipher family as the winner of theAdvanced Encryption Standard (AES) competition. Three members of
The field of cryptography continues to advance at a very rapid pace, leading to new insights that may impact the security properties of cryptographic algorithms
David Cooper, Daniel Apon, Quynh H. Dang, Michael S. Davidson, Morris Dworkin, Carl Miller
This recommendation specifies two algorithms that can be used to generate a digital signature, both of which are stateful hash-based signature schemes: the
Efficient circuits for multiplication of binary polynomials use what are known as Karatsuba recurrences. These methods divide the polynomials of size kn into k