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 376 - 400 of 873

Improved Indifferentiability Security Bound for the JH Mode

February 15, 2015
Author(s)
Dustin Moody, Daniel C. Smith-Tone, Souradyuti Paul
Indifferentiability security of a hash mode of operation guarantees the mode's resistance against all generic attacks. It is also useful to establish the security of protocols that use hash functions as random functions. The JH hash function was one of the

Randomized methods for rank-deficient linear systems

February 13, 2015
Author(s)
Josef Sifuentes, Zydrunas Gimbutas, Leslie Greengard
We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without additional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the eigenvectors of a matrix

Report on Pairing-based Cryptography

February 3, 2015
Author(s)
Dustin Moody, Rene C. Peralta, Ray A. Perlner, Andrew R. Regenscheid, Allen L. Roginsky, Lidong Chen
This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST’s position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in

Elliptic Curves arising from Brahmagupta Quadrilaterals

August 1, 2014
Author(s)
Farzali Izadi, Foad Khoshnam, Dustin Moody, Arman Zargar
A Brahmagupta quadrilateral is a cyclic quadrilateral whose sides, diagonals, and area are all integer values. In this article, we characterize the notions of Brahmagupta, introduced by K. R. S. Sastry, by means of elliptic curves. Motivated by these

A Binomial Approximation Method for the Ising Model

May 21, 2014
Author(s)
Isabel M. Beichl, Amanda A. Streib, Noah S. Streib, Francis Sullivan
A large portion of the complexity inherent to the Ising model can be captures with a trivial amount of computation. in this work, we support this claim by defining an approximation to the partition function and other thermodynamic quantities of the Ising
Displaying 376 - 400 of 873
Was this page helpful?