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.

Mathematics & Statistics

Search Publications

Search Title, Abstract, Conference, Citation, Keyword or Author

Title

Author

NIST Pub Series

Report Number

Published Date

Min

Max

Displaying 301 - 325 of 872

Estimating t-way Fault Profile Evolution During Testing

June 10, 2016

Author(s)

Raghu N. Kacker, David R. Kuhn

Empirical studies have shown that most software interaction faults involve one or two variables interacting, with progressively fewer triggered by three or more, and no failure has been reported involving more than six variables interacting. This paper

Indifferentiability Security of the Fast Widepipe Hash: Breaking the Birthday Barrier

June 1, 2016

Author(s)

Dustin Moody, Souradyuti Paul, Daniel C. Smith-Tone

A hash function secure in the indi fferentiability framework is able to resist all generic attacks. Such hash functions also play a crucial role in the security of the protocols that use hash functions as random functions. The rate of a hash mode is the

Removing divergence of JCGM documents from the GUM (1993)

June 1, 2016

Author(s)

Raghu N. Kacker

The stated mission of the Joint Committee for Guides in Metrology (JCGM) is to maintain and promote the use of the Guide to the Expression of Uncertainty in Measurement (GUM) and the International Vocabulary of Metrology (VIM, 2nd edition). The JCGM has

An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication

May 10, 2016

Author(s)

Fern Y. Hunt

In a model of network communication based on a random walk in an undirected graph, what subset of nodes (subject to constraints on its size), enable the fastest spread of information? The dynamics of spread is described by a process dual to the movement

Applied and Computational Mathematics Division: Summary of Activities for Fiscal Year 2015

May 3, 2016

Author(s)

Ronald F. Boisvert

This report summarizes recent technical work of the Applied and Computational Sciences Division of the Information Technology Laboratory at the National Institute of Standards and Technology (NIST). Part I (Overview) provides a high-level overview of the

Report on Post-Quantum Cryptography

April 28, 2016

Author(s)

Lidong Chen, Stephen P. Jordan, Yi-Kai Liu, Dustin Moody, Rene C. Peralta, Ray A. Perlner, Daniel C. Smith-Tone

In recent years, there has been a substantial amount of research on quantum computers - machines that exploit quantum mechanical phenomena to solve mathematical problems that are difficult or intractable for conventional computers. If large-scale quantum

Predicting Structures of Ru-Centered Dyes: A Computational Screening Tool

March 16, 2016

Author(s)

Lisa A. Fredin, Thomas C. Allison

Dye-sensitized solar cells (DSCs) represent a viable means for harvesting solar energy to produce electrical power. Though a number of light harvesting dyes are in use, the search continues for more efficient and effective compounds to make commercially

Linear Time Vertex Partitioning on Massive Graphs

March 7, 2016

Author(s)

Peter M. Mell, Richard Harang, Assane Gueye

The problem of optimally removing a set of vertices from a graph to minimize the size of the largest resultant component is known to be NP-complete. Prior work has provided near optimal heuristics with a high time complexity that function on up to hundreds

Vulnerabilities of "McEliece in the World of Escher"

March 3, 2016

Author(s)

Dustin Moody, Ray A. Perlner

Recently, Gligoroski et al. proposed code-based encryption and signature schemes using list decoding, blockwise triangular private keys, and a nonuniform error pattern based on "generalized error sets." The general approach was referred to as "McEliece in

Q-matrix: an algebraic formulation for the analysis and visual characterization of network graphs

February 8, 2016

Author(s)

Roldan Pozo

Given an undirected network, we describe a two- dimensional graphical measure based on the con- nected component distribution of its degree-limited subgraphs. This process yields an unambiguous vi- sual portrait which reveals important network proper- ties

Using Combinatorial Testing to Build Navigation Graphs for Dynamic Web Applications

February 2, 2016

Author(s)

Wenhua Wang, Sreedevi Sampath, Yu Lei, Raghu N. Kacker, D. Richard Kuhn, James F. Lawrence

Modelling a software system is often a challenging prerequisite to automatic test case generation. Modelling the navigation structure of a dynamic web application is particularly challenging because of the presence of a large number of pages that are

Polymer Glass-Formation in Variable Dimension

January 14, 2016

Author(s)

Jack F. Douglas, Freed Karl, Wensheng Xu

We explore the nature of glass-formation in variable spatial dimensionality (d) based on the generalized entropy theory, a synthesis of the Adam-Gibbs model with direct computation of the conﬁgurational entropy of polymer ﬂuids using an established

Improving the Computational Efficiency of the BlitzsteinDiaconis Algorithm for Generating Random Graphs of Prescribed Degree

January 6, 2016

Author(s)

Elizabeth R. Moseman

When generating a random graph, if more structure is desired than is given in the popular Erd\H{o}s Renyi model, one method is to generate a degree sequence first then create a graph with this degree sequence. Blitzstein and Diaconis (among others)