scispace - formally typeset
Search or ask a question
Institution

National Security Agency

GovernmentFort 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..


Papers
More filters
Journal ArticleDOI
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

Journal ArticleDOI
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

Journal ArticleDOI
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

Proceedings ArticleDOI
07 Jun 2015
TL;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

Journal ArticleDOI
17 Sep 1995
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

NameH-indexPapersCitations
Robert L. Grossman5232015551
Dianne P. O'Leary4422311469
Keith Schwab37917617
Chris A. Mack312314592
Young H. Kwark281233133
Christopher J. K. Richardson231221535
Akin Akturk191021272
Julius Goldhar19921218
Kevin Osborn19652153
Patrick W. Dowd18611437
Kevin Borders17261314
David G. Harris171021055
R. W. R. Darling16541762
Gail Letzter1532986
Benjamin Palmer1537659
Network Information
Related Institutions (5)
IBM
253.9K papers, 7.4M citations

75% related

Microsoft
86.9K papers, 4.1M citations

75% related

AT&T
21.2K papers, 949K citations

74% related

Google
39.8K papers, 2.1M citations

72% related

University of Trento
30.9K papers, 896.6K citations

72% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20222
20218
202014
201914
20184
20178