 |
|
NIST wants comments on proposed 'hash' competition
February 02, 2007The National Institute of Standards and Technology (NIST) is planning a competition to develop one or more cryptographic "hash" algorithms to augment and revise the current Secure Hash Standard (Federal Information Processing Standard 180-2). As a first step in this process, NIST is looking for comments on its recently published draft minimum acceptability requirements, submission requirements and evaluation criteria for candidate algorithms.
Hashing algorithms are mathematical procedures that take data, usually a message, and chop and combine it down into a much shorter number that is a "fingerprint" of the original data. Good hash algorithms have two features—two different inputs are overwhelmingly likely to generate two different fingerprints, and given a specific fingerprint, there is no practical way of calculating a set of input data that will have the same fingerprint. Hash algorithms are used widely by the federal government and others in various applications, such as digital signatures and message authentication. FIPS 180-2 specifies five cryptographic hash algorithms—SHA-1, SHA-224, SHA-256, SHA-384 and SHA-512. Because serious attacks have been reported in recent years against cryptographic hash algorithms, including SHA-1, NIST is preparing the groundwork for a more secure hash standard.
National Institute of Standards and Technology (NIST)
NIST issues call for a new 'hash' algorithm
The National Institute of Standards and Technology (NIST) has opened a competition to develop a new cryptographic "hash" algorithm, a tool that converts a file, message or block of data to a short "fingerprint" for use in digital signatures, message authentication and other computer security applications.
Data security: A problem in search of a mathematical theory
The need for security in electronic communications is crucial in today's world. The foundation for providing this security rests on mathematics.
More Hash Algorithm Current Events and Hash Algorithm News Articles
 |
Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn (Author), Peter Sanders (Author) Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems. This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and... |
 |
Cryptographic hash function: Algorithm, Data, Bit, Computational complexity theory, Information security, Digital signature, Message authentication code, ... Hash table, Fingerprint (computing) by Frederic P. Miller (Editor), Agnes F. Vandome (Editor), John McBrewster (Editor) High Quality Content by WIKIPEDIA articles! A cryptographic hash function is a deterministic procedure that takes an arbitrary block of data and returns a fixed-size bit string, the (cryptographic) hash value, such that an accidental or intentional change to the data will change the hash value. The data to be encoded is often called the "message", and the hash value is sometimes called the message digest or simply digest. The ideal cryptographic hash function has four main properties: it is easy to compute the hash value for any given message, it is infeasible to find a message that has a given hash, it is infeasible to modify a message without changing its hash, it is infeasible to find two different messages with the same hash. Cryptographic hash functions have many information security... |
 |
Quantum Electrodynamics: Quantum Electrodynamics, Quantum Digital Signature, Digital Signature, RSA, Shor's Algorithm, Cryptographic Hash Function, One-way ... Public-key Cryptography, Fredkin Gate by Lambert M. Surhone (Editor), Miriam T. Timpledon (Editor), Susan F. Marseken (Editor) High Quality Content by WIKIPEDIA articles! Quantum electrodynamics (QED) is the relativistic quantum field theory of electrodynamics. QED was developed by a number of physicists, beginning in the late 1920s. It basically describes how light and matter interact. QED mathematically describes all phenomena involving electrically charged particles interacting by means of exchange of photons. Physicist Richard Feynman has called it "the jewel of physics" for its extremely accurate predictions of quantities like the anomalous magnetic moment of the electron, and the Lamb shift of the energy levels of hydrogen. In technical terms, QED can be described as a perturbation theory of the electromagnetic quantum vacuum. |
 |
Quantum Gauge Theory: Quantum Gauge Theory, Quantum Fingerprinting, Quantum Electrodynamics, Quantum Digital Signature, Digital Signature, RSA, Shor's Algorithm, Cryptographic Hash Function by Lambert M. Surhone (Editor), Miriam T. Timpledon (Editor), Susan F. Marseken (Editor) High Quality Content by WIKIPEDIA articles! In order to quantize a gauge theory, like for example Yang-Mills theory, Chern-Simons or BF model, one method is to perform a gauge fixing. This is done in the BRST and Batalin-Vilkovisky formulation. Another is to factor out the symmetry by dispensing with vector potentials altogether (they're not physically observable anyway) and work directly with Wilson loops, Wilson lines contracted with other charged fields at its endpoints and spin networks. Older approaches to quantization for Abelian models use the Gupta-Bleuler formalism with a "semi-Hilbert space" with an indefinite sesquilinear form. However, it is much more elegant to just work with the quotient space of vector field configurations by gauge transformations. |
 |
Quantum Digital Signature: Quantum Digital Signature, Digital Signature, RSA, Shor's Algorithm, Cryptographic Hash Function, One-way Function, Public-key Cryptography, Fredkin Gate by Lambert M. Surhone (Editor), Miriam T. Timpledon (Editor), Susan F. Marseken (Editor) High Quality Content by WIKIPEDIA articles! A Quantum Digital Signature (QDS) refers to the quantum mechanical equivalent of either a classical digital signature or, more generally, a handwritten signature on a paper document. Like a handwritten signature, a digital signature is used to protect a document, such as a digital contract, against forgery by another party or by one of the participating parties. As e-commerce has become more important in society, the need to certify the origin of exchanged information has arisen. Modern digital signatures enhance security based on the difficulty of solving a mathematical problem, such as finding the factors of large numbers (as used in the RSA algorithm). Unfortunately, the task of solving these problems becomes feasible when a quantum computer... |
 |
Quantum Fingerprinting: Quantum Fingerprinting, Quantum Electrodynamics, Quantum Digital Signature, Digital Signature, RSA, Shor's Algorithm, Cryptographic Hash Function, One-way Function by Lambert M. Surhone (Editor), Miriam T. Timpledon (Editor), Susan F. Marseken (Editor) High Quality Content by WIKIPEDIA articles! Quantum fingerprinting is a proposed technique that uses a quantum computer to generate a string with a similar function to the cryptographic hash function. If unconditional guarantees of security are needed, and if it is impractical for the communicating parties to arrange to share a secret that can be used in a Carter-Wegman MAC, this technique might one day be faster than classical techniques given a quantum computer with 5 to 10 qubits. However, these circumstances are very unusual and it is unlikely the technique will ever have a practical application; it is largely of theoretical interest. |
|
The adaptive-hash join algorithm for a hypercube multicomputer (GIT-ICS) by Edward Robert Omiecinski (Author) | |
|
The correctness proof of a quadratic-hash algorithm by A. Nico Habermann (Author) | |
|
LEND and faster algorithms for constructing minimal perfect hash functions by E. A Fox (Author) | |
|
An O(n log n) algorithm for finding minimal perfect hash functions (TR) by E. A Fox (Author) |
| © 2010 BrightSurf.com |