The cryptographic hash function SHA-256 is one member of the SHA-2 hash family, which was proposed in 2000 and was standardized by NIST in 2002 as a successor of SHA-1. Although the differential fault attack on SHA-1compression function has been proposed, it seems hard to be directly adapted to SHA-256. In this paper, an efficient algebraic fault attack on SHA-256 compression function is propos...

Hardware implementation quality is an important factor in selecting the NIST SHA-3 competition finalists. However, a comprehensive methodology to benchmark five final round SHA-3 candidates in ASIC is challenging. Many factors need to be considered, including application scenarios, target technologies and optimization goals. This work describes detailed steps in the silicon implementation of a ...

To better understand how interactions with the air phase influence the movement of natural organic matter (NOM) through the vadose zone, we measured the transport of soil-humic acid (SHA) through laboratory columns packed with partially saturated sand. Our results demonstrate that sorptive reactions at air-water interfaces reduce SHA mobility and that the affinity of SHA for the air phase incre...

The cryptographic hash function provides the services of information security, authentication, integrity, non-reputation in a branch of information secret. A cryptographic hash function has been developed since MD4 was proposed by Rivest. In present, U.S standard of a hash function is SHA-1 with 160 bits of output length. It is difficult to be sure of a security of a hash function with 160 bits...

Draft FIPS PUB 202 [32] speci es the Secure Hash Algorithm-3 (SHA-3) family of functions. The SHA-3 functions are based on instances of the Keccak algorithm that NIST selected as the winner of the SHA-3 cryptographic hash algorithm competition. The SHA-3 family consists of four cryptographic hash functions, SHA3-224, SHA3-256, SHA3-384, and SHA3-512, and two extendableoutput functions (XOFs), S...

In this paper, we propose preimage attacks on 41-step SHA-256 and 46-step SHA-512, which drastically increase the number of attacked steps compared to the best previous preimage attack working for only 24 steps. The time complexity for 41-step SHA-256 is 2 compression function operations and the memory requirement is 2 × 10 words. The time complexity for 46-step SHA-512 is 2 compression functio...

The effects of breathing CO continuously at high altitude on the mean electrical axis of the heart, hematocrit ratio and body weight were studied in laboratory rats. Laboratory rats were exposed for 6 weeks to: 100 or 500 ppm CO; 15,000 feet stimulated high altitude (SHA); or 100 or 500 ppm CO at SHA. SHA decreased body weight significantly; CO and CO-SHA interaction had no significant effect o...

In this paper, we present a new technique to construct a collision attack from a particular preimage attack which is called a partial target preimage attack. Since most of the recent meet-in-the-middle preimage attacks can be regarded as the partial target preimage attack, a collision attack is derived from the meet-in-the-middle preimage attack. By using our technique, pseudo collisions of the...

We propose an improved implementation of the SHA-2 hash family, with minimal operator latency and reduced hardware requirements. We also propose a high frequency version at the cost of only two cycles of latency per message. Finally we present a multi-mode architecture able to perform either a SHA-384 or SHA-512 hash or to behave as two independent SHA-224 or SHA-256 operators. Such capability ...

BACKGROUND The recent swine-origin H1N1 pandemic illustrates the need to develop improved procedures for rapid production of influenza vaccines. One alternative to the current egg-based manufacture of influenza vaccine is to produce a hemagglutinin (HA) subunit vaccine using a recombinant expression system with the potential for high protein yields, ease of cloning new antigenic variants, and a...