Institution
National Security Agency
Government•Fort George Meade, Maryland, United States•
About: National Security Agency is a government organization based out in Fort George Meade, Maryland, United States. It is known for research contribution in the topics: Signal & Encryption. The organization has 393 authors who have published 485 publications receiving 15916 citations. The organization is also known as: NSA & N.S.A..
Topics: Signal, Encryption, Finite field, Error detection and correction, Security information and event management
Papers published on a yearly basis
Papers
More filters
••
[...]
TL;DR: Several properties of the graph-theoretic complexity are proved which show, for example, that complexity is independent of physical size and complexity depends only on the decision structure of a program.
Abstract: This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graph-theoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program.
5,097 citations
••
TL;DR: This paper proposes an efficient two-pass protocol for authenticated key agreement in the asymmetric (public-key) setting based on Diffie-Hellman key agreement and can be modified to work in an arbitrary finite group and, in particular, elliptic curve groups.
Abstract: This paper proposes an efficient two-pass protocol for authenticated key agreement in the asymmetric (public-key) setting. The protocol is based on Diffie-Hellman key agreement and can be modified to work in an arbitrary finite group and, in particular, elliptic curve groups. Two modifications of this protocol are also presented: a one-pass authenticated key agreement protocol suitable for environments where only one entity is on-line, and a three-pass protocol in which key confirmation is additionally provided. Variants of these protocols have been standardized in IEEE P1363 [17], ANSI X9.42 [2], ANSI X9.63 [4] and ISO 15496-3 [18], and are currently under consideration for standardization and by the U.S. government's National Institute for Standards and Technology [30].
559 citations
••
TL;DR: In this article, the authors show that nanoelectromechanical structures are starting to approach the ultimate quantum mechanical limits for detecting and exciting motion at the nanoscale, and nonclassical states of a mechanical resonator are also on the horizon.
Abstract: Nanoelectromechanical structures are starting to approach the ultimate quantum mechanical limits for detecting and exciting motion at the nanoscale. Nonclassical states of a mechanical resonator are also on the horizon.
546 citations
••
07 Jun 2015TL;DR: Simplicity, security, and flexibility are ever-present yet conflicting goals in cryptographic design and these goals were balanced in the design of Simon and Speck.
Abstract: The Simon and Speck families of block ciphers were designed specifically to offer security on constrained devices, where simplicity of design is crucial. However, the intended use cases are diverse and demand flexibility in implementation. Simplicity, security, and flexibility are ever-present yet conflicting goals in cryptographic design. This paper outlines how these goals were balanced in the design of Simon and Speck.
504 citations
••
[...]
TL;DR: It is shown that if only the sender can transmit, the number of bits required is a conditional entropy of a naturally defined graph.
Abstract: A sender communicates with a receiver who wishes to reliably evaluate a function of their combined data. We show that if only the sender can transmit, the number of bits required is a conditional entropy of a naturally defined graph. We also determine the number of bits needed when the communicators exchange two messages. Reference is made to the results of rate distortion in evaluating the function of two random variables.
455 citations
Authors
Showing all 394 results
Name | H-index | Papers | Citations |
---|---|---|---|
Linda M. Wasiczko | 3 | 3 | 18 |
E. Swing | 3 | 5 | 114 |
Alan Ratner | 3 | 5 | 51 |
Brian D. Snow | 3 | 3 | 49 |
John Petro | 3 | 4 | 35 |
David Lassen | 3 | 5 | 22 |
David T. Moore | 3 | 3 | 45 |
Brenton D. Walker | 3 | 3 | 43 |
Scott C. Horst | 3 | 8 | 31 |
Cathleen L. Civiello | 3 | 5 | 20 |
Paul Burkhardt | 3 | 6 | 40 |
Bikash Koley | 3 | 4 | 23 |
Frederick G. Johnson | 3 | 3 | 18 |
Arthur A. Drisko | 3 | 3 | 46 |
Clinton Brooks | 3 | 3 | 46 |