Crates.io | rs_sha512_224 |
lib.rs | rs_sha512_224 |
version | 0.1.2 |
source | src |
created_at | 2023-05-30 11:26:31.120668 |
updated_at | 2023-06-12 16:47:24.071578 |
description | `rs_sha512_224` is a Rust implementation of the SHA-512/224 cryptographic hash algorithm, part of the larger `rs_shield` project. This package provides SHA-512/224 hashing functionality in a standalone manner, ideal for when only SHA-512/224 is required. Alternatively, for those seeking a comprehensive set of cryptographic functions, this same algorithm is included within the broader `rs_shield` library bundle. The focus of `rs_sha512_224` and the larger project is on performance, safety, and openness, with a commitment to ongoing maintenance and enhancement. |
homepage | https://docs.rs/rs_shield/latest/rs_shield/ |
repository | https://github.com/Azgrom/RustyShield |
max_upload_size | |
id | 877814 |
size | 38,176 |
rs_sha512_224
rs_sha512_224
is a Rust crate implementing the SHA-512/224 cryptographic hash algorithm. Configured for compatibility with Rust's libcore within a #![no_std]
context, it operates as a standalone crate for specialized use cases and is also compatible with a #![no_std]
, #![no_alloc]
environment, rendering it suitable for systems where dynamic memory allocation is untenable.
This implementation of SHA-512/224 is compliant with the Federal Information Processing Standards (FIPS) Publication 180-41. In line with the National Institute of Standards and Technology (NIST) guidelines, SHA-512/224 is recommended for several use cases:
"SHA-512/224 provides 112 bits of security against collision attacks and, therefore, is suitable for functions requiring a hash length of 112 bits."
Given this advice, NIST recommendations imply that SHA-512/224 is suitable for the following contexts:
Beyond these specific recommendations, SHA-512/224 could also find application in:
Given your overall security objectives and risk tolerance, these points should be carefully considered.
For access to a comprehensive range of cryptographic functions, rs_sha512_224
can be utilized as part of the rs_shield
library bundle.
Below are steps to use the rs_sha512_224
crate in your Rust projects:
Add the following line to your Cargo.toml
under the [dependencies]
section:
rs_sha512_224 = "0.1.*"
Use the functions provided by the rs_sha512_224
module in your code. Here's an example of how to create a SHA-512/224 hash from a string:
use rs_sha512_224::{HasherContext, Sha512_224Hasher};
let mut sha512_224hasher = Sha512_224Hasher::default();
sha512_224hasher.write(b"your string here");
let u64result = sha512_224hasher.finish();
let bytes_result = HasherContext::finish(&mut sha512_224hasher);
assert_eq!(u64result, 0x233E7E4F520121E4);
assert_eq!(format!("{bytes_result:02x}"), "233e7e4f520121e40eef63455e3b7f1815aabb985431e7afbbf880b3");
assert_eq!(format!("{bytes_result:02X}"), "233E7E4F520121E40EEF63455E3B7F1815AABB985431E7AFBBF880B3");
assert_eq!(
bytes_result,
[
0x23, 0x3E, 0x7E, 0x4F, 0x52, 0x01, 0x21, 0xE4, 0x0E, 0xEF, 0x63, 0x45, 0x5E, 0x3B, 0x7F, 0x18, 0x15, 0xAA,
0xBB, 0x98, 0x54, 0x31, 0xE7, 0xAF, 0xBB, 0xF8, 0x80, 0xB3
]
)
For a more detailed exploration of rs_sha512_224
, an overview of other available cryptographic functions, and an introduction to the broader rs_shield
project, please consult the RustyShield project page on crates.io.
Potential contributors are encouraged to consult the contribution guidelines on our GitHub page.
This project is licensed under GPL-2.0-only.
Note: The references have been provided as per the best knowledge as of Jun 02, 2023.
National Institute of Standards and Technology. (2015). Secure Hash Standard (SHS). FIPS PUB 180-4 ↩
Merkle, R. C. (1988). A Digital Signature Based on a Conventional Encryption Function. Link ↩
Linus Torvalds. (2005). Git: A distributed version control system. Software: Practice and Experience, 41(1), 79-88. DOI:10.1002/spe.1006 ↩
Krawczyk, H., Bellare, M., & Canetti, R. (1997). HMAC: Keyed-Hashing for Message Authentication. RFC 2104 ↩
Bloom, B. H. (1970). Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7), 422-426. DOI:10.1145/362686.362692 ↩