Publications Portal

You searched on:
Topic Area: Math

Displaying records 11 to 20 of 183 records.
Resort by: Date / Title

11. Improved Indifferentiability Security Bound for the JH Mode
Topic: Math
Published: 3/22/2012
Authors: Dustin Moody, Souradyuti Paul, Daniel Smith
Abstract: The JH hash function is one of the five finalists of the ongoing NIST SHA3 hash function competition. Despite several earlier attempts, and years of analysis, the indifferentiability security bound of the JH mode has so far remained remarkably lo ...
http://www.nist.gov/manuscript-publication-search.cfm?pub_id=910702

12. An Evaluation of Local Shape Descriptors for 3D Shape Retrieval
Series: NIST Interagency/Internal Report (NISTIR)
Report Number: 7812
Topic: Math
Published: 3/8/2012
Author: Sarah Y. Tang
Abstract: As the usage of 3D models increases, so does the importance of developing accurate 3D shape retrieval algorithms. Most prominently, shape descriptors are used to describe the geometric and topological properties of objects and compared to determine t ...
http://www.nist.gov/manuscript-publication-search.cfm?pub_id=909219

13. Families of Elliptic Curves with Rational 3-torsion
Topic: Math
Published: 1/30/2012
Authors: Dustin Moody, Hongfeng Wu
Abstract: In this paper we look at three families of elliptic curves with rational 3-torsion over a finite field. These families include Hessian curves, twisted Hessian curves, and a new family we call generalized DIK curves. We find the number of Fq-isogeny ...
http://www.nist.gov/manuscript-publication-search.cfm?pub_id=909543

14. Fourier, Gauss, Fraunhofer, Porod and the Shape from Moments Problem
Topic: Math
Published: 1/17/2012
Author: Gregg M. Gallatin
Abstract: We show how the Fourier transform of a shape in any number of dimensions can be simplified using Gauss' law and evaluated explicitly for polygons in two dimensions, polyhedra three dimensions, etc. We also show how this combination of Fourier and Gau ...
http://www.nist.gov/manuscript-publication-search.cfm?pub_id=909668

15. Counting the Leaves of Trees
Topic: Math
Published: 12/19/2011
Authors: Brian Dale Cloteaux, Luis A. Valentin
Abstract: A number of important combinatorial counting problems can be reformulated into the problem of counting the number of leaf nodes on a tree. Since the basic leaf-counting problem is #P-complete, there is strong evidence that no polynomial time algorith ...
http://www.nist.gov/manuscript-publication-search.cfm?pub_id=908869

16. Linear Algebra and Sequential Importance Ssampling for Network Reliability
Topic: Math
Published: 12/11/2011
Authors: David G. Harris, Francis Sullivan, Isabel M Beichl
Abstract: The reliability polynomial of a graph gives the probability that a graph is connected as a function of the probability that each edge is connected. The coefficients of the reliability polynomial count the number of connected subgraphs of various size ...
http://www.nist.gov/manuscript-publication-search.cfm?pub_id=909109

17. Combining Results from Multiple Evaluations of the Same Measurand
Series: Journal of Research (NIST JRES)
Topic: Math
Published: 12/1/2011
Authors: Raghu N Kacker, Klaus-Dieter Sommer
Abstract: According to the Guide to the Expression of Uncertainty in Measurement (GUM), a result of measurement consists of a measured value together with its associated standard uncertainty. The measured value and the standard uncertainty are interpreted as ...
http://www.nist.gov/manuscript-publication-search.cfm?pub_id=905068

18. Computing Network Reliability Coefficients
Topic: Math
Published: 12/1/2011
Authors: Elizabeth R Moseman, Isabel M Beichl, Francis Sullivan
Abstract: When a network is modeled by a graph and edges of the graph remain reliable with a given probability p, the probability of the graph remaining connected is called the reliability of the network. One form of the reliability polynomial has as coefficie ...
http://www.nist.gov/manuscript-publication-search.cfm?pub_id=908418

19. Mean Value Formulas for Twisted Edwards Curves
Topic: Math
Published: 11/3/2011
Author: Dustin Moody
Abstract: R. Feng and H.Wu recently established a certain mean-value formula for the coordinates of the n-division points on an elliptic curve given inWeierstrass form (A mean value formula for elliptic curves, 2010, available at http://eprint.iacr.org/2009/58 ...
http://www.nist.gov/manuscript-publication-search.cfm?pub_id=907010

20. A Special Functions Handbook for the Digital Age
Topic: Math
Published: 8/1/2011
Authors: Ronald F Boisvert, Charles W Clark, Daniel W Lozier, Frank William John Olver
Abstract: The NIST Digital Library of Mathematical Functions (DLMF) is a reference work providing information on the properties of the special functions of applied mathematics. It is a successor to the highly successful NBS Handbook of Mathematical Functions ( ...
http://www.nist.gov/manuscript-publication-search.cfm?pub_id=906771