EVP_SHA1(3ossl)

πŸ’– EVP_SHA1 β€” it's giving SHA-1 for EVP πŸ’–

okay bestie, welcome to the EVP_SHA1(3ossl) page, aka the little corner of OpenSSL where the legendary (and, ngl, a lil problematic in 2024) SHA-1 lives πŸ’…


✨ NAME ✨

EVP_sha1 β€” SHA-1 For EVP πŸŽ€


🌸 SYNOPSIS 🌸

#include <openssl/evp.h>

const EVP_MD *EVP_sha1(void);

πŸ¦‹ DESCRIPTION πŸ¦‹

SHA-1 (Secure Hash Algorithm 1) is a cryptographic hash function standardized in NIST FIPS 180-4. The algorithm was designed by the United States National Security Agency and initially published in 1995. so it's literally older than most of us and yet here we are 🫢

  • EVP_sha1() β€” the SHA-1 algorithm which produces a 160-bit output from a given input. cute, compact, iconic ✨

πŸ‘‘ NOTES πŸ‘‘

bestie, listen up, this is the part where I hold your hand πŸ™ˆ

Developers should be aware of the negative performance implications of calling this function multiple times and should consider using EVP_MD_fetch(3) with EVP_MD-SHA1(7) instead. See "Performance" in crypto(7) for further information.

not me begging you to use EVP_MD_fetch(3) instead of calling this over and over πŸ’€ the performance implications are real, fr fr

πŸ’œ RETURN VALUES πŸ’œ

These functions return a EVP_MD structure that contains the implementation of the message digest. See EVP_MD_meth_new(3) for details of the EVP_MD structure.

so like… you get an EVP_MD back. that's the whole vibe check 🌈


⭐ CONFORMING TO ⭐

NIST FIPS 180-4. periodt πŸ’…


πŸŽ€ SEE ALSO πŸŽ€

go read those next, iykyk πŸ‘‘


Copyright 2017-2023 The OpenSSL Project Authors. All Rights Reserved.

Licensed under the Apache License 2.0 (the "License"). You may not use this file except in compliance with the License. You can obtain a copy in the file LICENSE in the source distribution or at <https://www.openssl.org/source/license.html>.


okay that's the whole page, you ate that πŸ“ this was OpenSSL 3.5.9, dated 2026-09-29, and the manual name is EVP_SHA1(3ossl) β€” mwah, love u, go hash responsibly πŸ§šπŸ’–

πŸ“¦ where this page comes from