 |
|
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... |
 |
Cryptography for Developers by Tom St Denis (Author) The only guide for software developers who must learn and implement cryptography safely and cost effectively. The book begins with a chapter that introduces the subject of cryptography to the reader. The second chapter discusses how to implement large integer arithmetic as required by RSA and ECC public key algorithms The subsequent chapters discuss the implementation of symmetric ciphers, one-way hashes, message authentication codes, combined authentication and encryption modes, public key cryptography and finally portable coding practices. Each chapter includes in-depth discussion on memory/size/speed performance trade-offs as well as what cryptographic problems are solved with the specific topics at hand. * The author is the... |
|
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) | |
 |
Fast Software Encryption: Cambridge Security Workshop, Cambridge, U.K., December 9 - 11, 1993. Proceedings (Lecture Notes in Computer Science) by Ross Anderson (Editor) This volume contains the refereed papers presented at the International Workshop on Software Encryption Algorithms, held at Cambridge University, U.K. in December 1993.The collection of papers by representatives of all relevant research centers gives a thorough state-of-the-art report on all theoretical aspects of encryption algorithms and takes into account the new demands from new applications, as for example from the data-intensive multimedia applications. The 26 papers are organized in sections on block ciphers, stream ciphers, software performance, cryptanalysis, hash functions and hybrid ciphers, and randomness and nonlinearity. |
 |
Fast Software Encryption: 10th International Workshop, FSE 2003, LUND, Sweden, February 24-26, 2003, Revised Papers (Lecture Notes in Computer Science) by Thomas Johansson (Editor) This book constitutes the thoroughly refereed postproseedings of the 10th International Workshop on Fast Software Encryption, FSE 2003, held in Lund, Sweden in February 2003. The 27 revised full papers presented were carefully reviewed, improved, and selected from 71 submissions. The papers are organized in topical sections on block cipher cryptanalysis, Boolean functions and S-boxes, stream cipher cryptanalysis, MACs, block cipher theory, side channel attacks, new designs, and modes of operation. |
 |
Fast Software Encryption: 11th International Workshop, FSE 2004, Delhi, India, February 5-7, 2004, Revised Papers (Lecture Notes in Computer Science) by Bimal Roy (Editor), Willi Meier (Editor) This book constitutes the refereed proceedings of the 11th International Workshop on Fast Software Encryption, FSE 2004, held in Delhi, India in February 2004. The 28 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. The papers are organized in topical sections on algebraic attacks, stream cipher cryptanalysis, Boolean functions, stream cipher design, design and analysis of block ciphers, cryptographic primitives-theory, modes of operation, and analysis of MACs and hash functions. |
|
An O(n log n) algorithm for finding minimal perfect hash functions (TR) by E. A Fox (Author) | |
|
LEND and faster algorithms for constructing minimal perfect hash functions by E. A Fox (Author) | |
|
Un algorithme parallele de fermeture transitive utilisant un placement par hachage =: A parallel transitive closure algorithm using hash-based clustering ... Recherche en Informatique et en Automatique) by Jean-Pierre Cheiney (Author) |
| © 2009 BrightSurf.com |