Skip to main content
U.S. flag

An official website of the United States government

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.

Search Publications

NIST Authors in Bold

Displaying 26 - 50 of 391

An Initial Look at Federal Offices of Research and Technology Applications

November 19, 2020
Author(s)
Nicole K. Gingrich, Michael J. Hall, Isaac Patterson
In Science—the Endless Frontier, Vannevar Bush wrote that reaping the potential benefits of science conducted at federal laboratories requires the discoveries made in the labs be transferred to society. In federal laboratories, Offices of Research and

Comparing Instruments

September 30, 2020
Author(s)
James H. Yen, Dennis D. Leber, Leticia S. Pibida
This document details methods to compare instrument performance. Comparison methods for instruments outputting binary (0-1) responses as well as for instruments outputting continuous numeric responses are shown, first for two instruments and then for

Diffusion-limited reactions in nanoscale electronics

September 22, 2020
Author(s)
Ryan Evans, Arvind Balijepalli, Anthony J. Kearsley
To quantify interactions between drug molecules and target receptors, a novel nanoscale electronics instrument is under development. The instrument consists of two regions: a biological region, and an electronics region. The biological region consists of a

NIST Interactions: Fiscal Year 2015 through Fiscal Year 2018

September 16, 2020
Author(s)
Nicole K. Gingrich, Isaac Patterson, Jimmy Nazario-Negron, Michael J. Hall
This study analyzes data from fiscal years 2015 through 2018 of eighteen interaction types in which NIST participates annually. To describe the volume of direct relationships NIST has with the U.S. economy, it calculates the average number of interactions

Measuring Microfluidic Flow Rates: Monotonicity, Convexity and Uncertainty

August 20, 2020
Author(s)
Paul Patrone, Qing Hai Li, Gregory A. Cooksey, Anthony J. Kearsley
A class of non-linear integro-differential equations characterizing microfluidic measurements is considered. Under reasonable conditions, these non-linear integro-differential equations admit solutions that are convex functions of an interesting flow-rate

Status Report on the Second Round of the NIST Post-Quantum Cryptography Standardization Process

July 22, 2020
Author(s)
Dustin Moody, Gorjan Alagic, Daniel C. Apon, David A. Cooper, Quynh H. Dang, John M. Kelsey, Yi-Kai Liu, Carl A. Miller, Rene C. Peralta, Ray A. Perlner, Angela Y. Robinson, Daniel C. Smith-Tone, Jacob Alperin-Sheriff
The National Institute of Standards and Technology is in the process of selecting one or more public-key cryptographic algorithms through a public, competition-like process. The new public-key cryptography standards will specify one or more additional

Microwave radiometer instability due to infrequent calibration

April 16, 2020
Author(s)
Kevin J. Coakley, Jolene D. Splett, Dave K. Walker, Mustafa Aksoy, Paul E. Racette
We directly quantify the effect of infrequent calibration on the stability of microwave radiometer temperature measurements (where a power measurement for the unknown source is acquired at a fixed time but calibration data are acquired at variable earlier

Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme

April 10, 2020
Author(s)
Dustin Moody, Ray A. Perlner, Daniel C. Smith-Tone, Daniel C. Apon, Javier Verbel
In 2013, Tao et al. introduced the ABC Simple Matrix Scheme for Encryption, a multivariate public key encryption scheme. The scheme boasts great efficiency in encryption and decryption, though it suffers from very large public keys. It was quickly noted

Discovering Mathematical Objects of Interest - A Study of Mathematical Notations

April 1, 2020
Author(s)
Howard S. Cohl, Andre Greiner Petter, Moritz Schubotz, Corinna Breitinger, Fabian Muller, Akiko Aizawa, Bela Gipp
Mathematical notation, i.e., the writing system used to communicate concepts in mathematics, encodes valuable information for a variety of information search and retrieval systems. Yet, mathematical notations remain mostly unutilized by today's systems. In

Workshop on Applied Category Theory: Bridging Theory and Practice

February 7, 2020
Author(s)
Spencer J. Breiner, Blake S. Pollard, Eswaran Subrahmanian
This report presents the summary of a workshop held at NIST on March 15-16, 2018 on the topic of applied category theory (ACT). The meeting had two main goals: (i) mapping the current ACT landscape and (ii) developing a roadmap for transitioning the field

Moment subset sums over finite fields

February 1, 2020
Author(s)
Tim LAI, Alicia Marino, Angela Robinson, Daqing Wan
The k-subset sum problem over finite fields is a classical NP-complete problem. Motivated by coding theory applications, a more complex problem is the higher m-th moment k-subset sum problem over finite fields. We show that there is a deterministic

Characterization and Computation of Matrices of Maximal Trace over Rotations

October 19, 2019
Author(s)
Javier Bernal, James F. Lawrence
The constrained orthogonal Procrustes problem is the least-squares problem that calls for a rotation matrix that optimally aligns two corresponding sets of points in d-dimensional Euclidean space. This problem generalizes to the so-called Wahba's problem

A Purely Algebraic Justification of the Kabsch-Umeyama Algorithm

October 9, 2019
Author(s)
James F. Lawrence, Javier Bernal, Christoph J. Witzgall
The constrained orthogonal Procrustes problem is the least-squares problem that calls for a rotation matrix that optimally aligns two matrices of the same order. Over past decades, the algorithm of choice for solving this problem has been the Kabsch

Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions

August 17, 2019
Author(s)
Luis Brandao, Cagdas Calik, Meltem Sonmez Turan, Rene Peralta
A special metric of interest about Boolean functions is multiplicative complexity (MC): the minimum number of AND gates sufficient to implement a function with a Boolean circuit over the basis XOR, AND, NOT}. In this paper we study the MC of symmetric
Displaying 26 - 50 of 391