Gecko [ fernandoquevedodop.com ]

Name	Size	Permission
2to3.html	70.96 KB	-rw-r--r--
__future__.html	20.75 KB	-rw-r--r--
__main__.html	44.87 KB	-rw-r--r--
_thread.html	30.39 KB	-rw-r--r--
abc.html	46.87 KB	-rw-r--r--
aifc.html	35.56 KB	-rw-r--r--
allos.html	34.33 KB	-rw-r--r--
archiving.html	17 KB	-rw-r--r--
argparse.html	300.89 KB	-rw-r--r--
array.html	37.28 KB	-rw-r--r--
ast.html	293.08 KB	-rw-r--r--
asynchat.html	37.41 KB	-rw-r--r--
asyncio-api-index.html	27.68 KB	-rw-r--r--
asyncio-dev.html	36.1 KB	-rw-r--r--
asyncio-eventloop.html	204.43 KB	-rw-r--r--
asyncio-exceptions.html	17.11 KB	-rw-r--r--
asyncio-future.html	38.23 KB	-rw-r--r--
asyncio-llapi-index.html	61.97 KB	-rw-r--r--
asyncio-platforms.html	21.77 KB	-rw-r--r--
asyncio-policy.html	39.56 KB	-rw-r--r--
asyncio-protocol.html	118.33 KB	-rw-r--r--
asyncio-queue.html	31.86 KB	-rw-r--r--
asyncio-stream.html	69.98 KB	-rw-r--r--
asyncio-subprocess.html	49.25 KB	-rw-r--r--
asyncio-sync.html	42.79 KB	-rw-r--r--
asyncio-task.html	109.14 KB	-rw-r--r--
asyncio.html	17.31 KB	-rw-r--r--
asyncore.html	49.36 KB	-rw-r--r--
atexit.html	22.87 KB	-rw-r--r--
audioop.html	46 KB	-rw-r--r--
audit_events.html	72.85 KB	-rw-r--r--
base64.html	48.09 KB	-rw-r--r--
bdb.html	66 KB	-rw-r--r--
binary.html	15.97 KB	-rw-r--r--
binascii.html	36.3 KB	-rw-r--r--
binhex.html	15.97 KB	-rw-r--r--
bisect.html	43.38 KB	-rw-r--r--
builtins.html	14.87 KB	-rw-r--r--
bz2.html	50.68 KB	-rw-r--r--
calendar.html	69.35 KB	-rw-r--r--
cgi.html	59.95 KB	-rw-r--r--
cgitb.html	19.96 KB	-rw-r--r--
chunk.html	22.21 KB	-rw-r--r--
cmath.html	43.89 KB	-rw-r--r--
cmd.html	50.42 KB	-rw-r--r--
code.html	35.38 KB	-rw-r--r--
codecs.html	157.96 KB	-rw-r--r--
codeop.html	18.26 KB	-rw-r--r--
collections.abc.html	79.17 KB	-rw-r--r--
collections.html	189.43 KB	-rw-r--r--
colorsys.html	17.31 KB	-rw-r--r--
compileall.html	50.68 KB	-rw-r--r--
concurrency.html	24.15 KB	-rw-r--r--
concurrent.futures.html	79.03 KB	-rw-r--r--
concurrent.html	11.56 KB	-rw-r--r--
configparser.html	159.4 KB	-rw-r--r--
constants.html	22.41 KB	-rw-r--r--
contextlib.html	117.2 KB	-rw-r--r--
contextvars.html	38.38 KB	-rw-r--r--
copy.html	17.92 KB	-rw-r--r--
copyreg.html	18.63 KB	-rw-r--r--
crypt.html	28.29 KB	-rw-r--r--
crypto.html	13.93 KB	-rw-r--r--
csv.html	82.89 KB	-rw-r--r--
ctypes.html	295.49 KB	-rw-r--r--
curses.ascii.html	32.04 KB	-rw-r--r--
curses.html	221.24 KB	-rw-r--r--
curses.panel.html	22.16 KB	-rw-r--r--
custominterp.html	11.85 KB	-rw-r--r--
dataclasses.html	113.16 KB	-rw-r--r--
datatypes.html	31.82 KB	-rw-r--r--
datetime.html	374.92 KB	-rw-r--r--
dbm.html	51.16 KB	-rw-r--r--
debug.html	17 KB	-rw-r--r--
decimal.html	270.12 KB	-rw-r--r--
development.html	32.34 KB	-rw-r--r--
devmode.html	31.72 KB	-rw-r--r--
dialog.html	43.03 KB	-rw-r--r--
difflib.html	111.99 KB	-rw-r--r--
dis.html	136.07 KB	-rw-r--r--
distribution.html	13.67 KB	-rw-r--r--
distutils.html	14.73 KB	-rw-r--r--
doctest.html	199.32 KB	-rw-r--r--
email.charset.html	31.92 KB	-rw-r--r--
email.compat32-message.html	97.74 KB	-rw-r--r--
email.contentmanager.html	37.02 KB	-rw-r--r--
email.encoders.html	18.47 KB	-rw-r--r--
email.errors.html	24.45 KB	-rw-r--r--
email.examples.html	60.49 KB	-rw-r--r--
email.generator.html	48.79 KB	-rw-r--r--
email.header.html	37.61 KB	-rw-r--r--
email.headerregistry.html	66.26 KB	-rw-r--r--
email.html	30.75 KB	-rw-r--r--
email.iterators.html	18.23 KB	-rw-r--r--
email.message.html	99.75 KB	-rw-r--r--
email.mime.html	44.89 KB	-rw-r--r--
email.parser.html	57.39 KB	-rw-r--r--
email.policy.html	84.24 KB	-rw-r--r--
email.utils.html	42.57 KB	-rw-r--r--
ensurepip.html	23.9 KB	-rw-r--r--
enum.html	151 KB	-rw-r--r--
errno.html	60.17 KB	-rw-r--r--
exceptions.html	108.44 KB	-rw-r--r--
faulthandler.html	31.5 KB	-rw-r--r--
fcntl.html	36.67 KB	-rw-r--r--
filecmp.html	32.08 KB	-rw-r--r--
fileformats.html	13.52 KB	-rw-r--r--
fileinput.html	40.37 KB	-rw-r--r--
filesys.html	16.78 KB	-rw-r--r--
fnmatch.html	21.02 KB	-rw-r--r--
fractions.html	35.29 KB	-rw-r--r--
frameworks.html	16.15 KB	-rw-r--r--
ftplib.html	71.97 KB	-rw-r--r--
functional.html	12.19 KB	-rw-r--r--
functions.html	260.33 KB	-rw-r--r--
functools.html	92.96 KB	-rw-r--r--
gc.html	40.97 KB	-rw-r--r--
getopt.html	29.4 KB	-rw-r--r--
getpass.html	16.01 KB	-rw-r--r--
gettext.html	98.02 KB	-rw-r--r--
glob.html	27.2 KB	-rw-r--r--
graphlib.html	34.82 KB	-rw-r--r--
grp.html	16.03 KB	-rw-r--r--
gzip.html	45.65 KB	-rw-r--r--
hashlib.html	93.19 KB	-rw-r--r--
heapq.html	42.43 KB	-rw-r--r--
hmac.html	24.74 KB	-rw-r--r--
html.entities.html	14.91 KB	-rw-r--r--
html.html	14.81 KB	-rw-r--r--
html.parser.html	47.7 KB	-rw-r--r--
http.client.html	85.63 KB	-rw-r--r--
http.cookiejar.html	113.94 KB	-rw-r--r--
http.cookies.html	47.64 KB	-rw-r--r--
http.html	45.52 KB	-rw-r--r--
http.server.html	73.05 KB	-rw-r--r--
i18n.html	13.44 KB	-rw-r--r--
idle.html	77.18 KB	-rw-r--r--
imaplib.html	87.08 KB	-rw-r--r--
imghdr.html	17.94 KB	-rw-r--r--
imp.html	54.32 KB	-rw-r--r--
importlib.html	239.96 KB	-rw-r--r--
importlib.metadata.html	43.14 KB	-rw-r--r--
index.html	75.06 KB	-rw-r--r--
inspect.html	168.74 KB	-rw-r--r--
internet.html	29.89 KB	-rw-r--r--
intro.html	13.81 KB	-rw-r--r--
io.html	154.15 KB	-rw-r--r--
ipaddress.html	137.75 KB	-rw-r--r--
ipc.html	12.6 KB	-rw-r--r--
itertools.html	153.27 KB	-rw-r--r--
json.html	98.9 KB	-rw-r--r--
keyword.html	14.88 KB	-rw-r--r--
language.html	16.71 KB	-rw-r--r--
linecache.html	18.09 KB	-rw-r--r--
locale.html	77.35 KB	-rw-r--r--
logging.config.html	100.3 KB	-rw-r--r--
logging.handlers.html	146.28 KB	-rw-r--r--
logging.html	169.67 KB	-rw-r--r--
lzma.html	66.89 KB	-rw-r--r--
mailbox.html	176.34 KB	-rw-r--r--
mailcap.html	20.86 KB	-rw-r--r--
markup.html	22.31 KB	-rw-r--r--
marshal.html	24.43 KB	-rw-r--r--
math.html	85.82 KB	-rw-r--r--
mimetypes.html	40.27 KB	-rw-r--r--
mm.html	11.16 KB	-rw-r--r--
mmap.html	55.53 KB	-rw-r--r--
modulefinder.html	23.67 KB	-rw-r--r--
modules.html	15.88 KB	-rw-r--r--
msilib.html	78.38 KB	-rw-r--r--
msvcrt.html	29.22 KB	-rw-r--r--
multiprocessing.html	405.24 KB	-rw-r--r--
multiprocessing.shared_memory....	60 KB	-rw-r--r--
netdata.html	20.24 KB	-rw-r--r--
netrc.html	20.39 KB	-rw-r--r--
nis.html	16.76 KB	-rw-r--r--
nntplib.html	84.93 KB	-rw-r--r--
numbers.html	45.67 KB	-rw-r--r--
numeric.html	19.29 KB	-rw-r--r--
operator.html	107.32 KB	-rw-r--r--
optparse.html	256.96 KB	-rw-r--r--
os.html	594.39 KB	-rw-r--r--
os.path.html	65.54 KB	-rw-r--r--
ossaudiodev.html	56.35 KB	-rw-r--r--
pathlib.html	170.01 KB	-rw-r--r--
pdb.html	68.67 KB	-rw-r--r--
persistence.html	19.13 KB	-rw-r--r--
pickle.html	154.45 KB	-rw-r--r--
pickletools.html	22.92 KB	-rw-r--r--
pipes.html	21.7 KB	-rw-r--r--
pkgutil.html	42.76 KB	-rw-r--r--
platform.html	45.08 KB	-rw-r--r--
plistlib.html	30.06 KB	-rw-r--r--
poplib.html	41.42 KB	-rw-r--r--
posix.html	20.96 KB	-rw-r--r--
pprint.html	55.35 KB	-rw-r--r--
profile.html	84.63 KB	-rw-r--r--
pty.html	23.7 KB	-rw-r--r--
pwd.html	16.84 KB	-rw-r--r--
py_compile.html	29 KB	-rw-r--r--
pyclbr.html	24.06 KB	-rw-r--r--
pydoc.html	19.59 KB	-rw-r--r--
pyexpat.html	104.38 KB	-rw-r--r--
python.html	22.46 KB	-rw-r--r--
queue.html	43.39 KB	-rw-r--r--
quopri.html	18.64 KB	-rw-r--r--
random.html	86.31 KB	-rw-r--r--
re.html	214.24 KB	-rw-r--r--
readline.html	50.19 KB	-rw-r--r--
reprlib.html	30.85 KB	-rw-r--r--
resource.html	48.26 KB	-rw-r--r--
rlcompleter.html	18.06 KB	-rw-r--r--
runpy.html	30.99 KB	-rw-r--r--
sched.html	27.04 KB	-rw-r--r--
secrets.html	30.2 KB	-rw-r--r--
security_warnings.html	16.21 KB	-rw-r--r--
select.html	74.58 KB	-rw-r--r--
selectors.html	41.91 KB	-rw-r--r--
shelve.html	36.54 KB	-rw-r--r--
shlex.html	61.03 KB	-rw-r--r--
shutil.html	100.13 KB	-rw-r--r--
signal.html	95.39 KB	-rw-r--r--
site.html	38.16 KB	-rw-r--r--
smtpd.html	44.09 KB	-rw-r--r--
smtplib.html	81.4 KB	-rw-r--r--
sndhdr.html	16.4 KB	-rw-r--r--
socket.html	256.95 KB	-rw-r--r--
socketserver.html	91.95 KB	-rw-r--r--
spwd.html	16.71 KB	-rw-r--r--
sqlite3.html	225.51 KB	-rw-r--r--
ssl.html	328.83 KB	-rw-r--r--
stat.html	57.79 KB	-rw-r--r--
statistics.html	123.22 KB	-rw-r--r--
stdtypes.html	615.43 KB	-rw-r--r--
string.html	108.03 KB	-rw-r--r--
stringprep.html	24.94 KB	-rw-r--r--
struct.html	70.58 KB	-rw-r--r--
subprocess.html	199.03 KB	-rw-r--r--
sunau.html	39.84 KB	-rw-r--r--
superseded.html	26.21 KB	-rw-r--r--
symtable.html	33.26 KB	-rw-r--r--
sys.html	198.83 KB	-rw-r--r--
sysconfig.html	39.81 KB	-rw-r--r--
syslog.html	27.36 KB	-rw-r--r--
tabnanny.html	16.18 KB	-rw-r--r--
tarfile.html	161.92 KB	-rw-r--r--
telnetlib.html	38.21 KB	-rw-r--r--
tempfile.html	58.39 KB	-rw-r--r--
termios.html	22.86 KB	-rw-r--r--
test.html	222.85 KB	-rw-r--r--
text.html	16.8 KB	-rw-r--r--
textwrap.html	48.83 KB	-rw-r--r--
threading.html	128.33 KB	-rw-r--r--
time.html	107.46 KB	-rw-r--r--
timeit.html	52.63 KB	-rw-r--r--
tk.html	28.08 KB	-rw-r--r--
tkinter.colorchooser.html	14.49 KB	-rw-r--r--
tkinter.dnd.html	17.09 KB	-rw-r--r--
tkinter.font.html	22.21 KB	-rw-r--r--
tkinter.html	106.85 KB	-rw-r--r--
tkinter.messagebox.html	20.09 KB	-rw-r--r--
tkinter.scrolledtext.html	14.52 KB	-rw-r--r--
tkinter.tix.html	59.69 KB	-rw-r--r--
tkinter.ttk.html	138.37 KB	-rw-r--r--
token.html	45.73 KB	-rw-r--r--
tokenize.html	39.86 KB	-rw-r--r--
trace.html	38.85 KB	-rw-r--r--
traceback.html	75.61 KB	-rw-r--r--
tracemalloc.html	122.33 KB	-rw-r--r--
tty.html	14.46 KB	-rw-r--r--
turtle.html	271.71 KB	-rw-r--r--
types.html	64.85 KB	-rw-r--r--
typing.html	315.69 KB	-rw-r--r--
unicodedata.html	27.3 KB	-rw-r--r--
unittest.html	310.01 KB	-rw-r--r--
unittest.mock-examples.html	177.75 KB	-rw-r--r--
unittest.mock.html	363.51 KB	-rw-r--r--
unix.html	13.46 KB	-rw-r--r--
urllib.error.html	18.56 KB	-rw-r--r--
urllib.html	12.92 KB	-rw-r--r--
urllib.parse.html	104.65 KB	-rw-r--r--
urllib.request.html	208.87 KB	-rw-r--r--
urllib.robotparser.html	22.63 KB	-rw-r--r--
uu.html	18.2 KB	-rw-r--r--
uuid.html	42.88 KB	-rw-r--r--
venv.html	90.43 KB	-rw-r--r--
warnings.html	69.13 KB	-rw-r--r--
wave.html	36.12 KB	-rw-r--r--
weakref.html	73.36 KB	-rw-r--r--
webbrowser.html	33.98 KB	-rw-r--r--
windows.html	12.32 KB	-rw-r--r--
winreg.html	89.48 KB	-rw-r--r--
winsound.html	26.3 KB	-rw-r--r--
wsgiref.html	111.52 KB	-rw-r--r--
xdrlib.html	42.07 KB	-rw-r--r--
xml.dom.html	114.66 KB	-rw-r--r--
xml.dom.minidom.html	49.6 KB	-rw-r--r--
xml.dom.pulldom.html	30.06 KB	-rw-r--r--
xml.etree.elementtree.html	186.49 KB	-rw-r--r--
xml.html	22.34 KB	-rw-r--r--
xml.sax.handler.html	55.78 KB	-rw-r--r--
xml.sax.html	31.74 KB	-rw-r--r--
xml.sax.reader.html	56.23 KB	-rw-r--r--
xml.sax.utils.html	22.28 KB	-rw-r--r--
xmlrpc.client.html	79.73 KB	-rw-r--r--
xmlrpc.html	11.9 KB	-rw-r--r--
xmlrpc.server.html	63.56 KB	-rw-r--r--
zipapp.html	52.45 KB	-rw-r--r--
zipfile.html	116.59 KB	-rw-r--r--
zipimport.html	33.76 KB	-rw-r--r--
zlib.html	42.29 KB	-rw-r--r--
zoneinfo.html	57.25 KB	-rw-r--r--

Code Editor : hashlib.html

<!DOCTYPE html>

<title>hashlib — Secure hashes and message digests &#8212; Python 3.10.12 documentation</title><meta name="viewport" content="width=device-width, initial-scale=1.0">
 
 <link rel="stylesheet" type="text/css" href="../_static/pygments.css" />
 <link rel="stylesheet" type="text/css" href="../_static/pydoctheme.css?2022.1" />
 
 <script data-url_root="../" id="documentation_options" src="../_static/documentation_options.js"></script>
 <script src="../_static/jquery.js"></script>
 <script src="../_static/underscore.js"></script>
 <script src="../_static/doctools.js"></script>
 
 <script src="../_static/sidebar.js"></script>
 
 <link rel="search" type="application/opensearchdescription+xml"
 title="Search within Python 3.10.12 documentation"
 href="../_static/opensearch.xml"/>
 <link rel="author" title="About these documents" href="../about.html" />
 <link rel="index" title="Index" href="../genindex.html" />
 <link rel="search" title="Search" href="../search.html" />
 <link rel="copyright" title="Copyright" href="../copyright.html" />
 <link rel="next" title="hmac — Keyed-Hashing for Message Authentication" href="hmac.html" />
 <link rel="prev" title="Cryptographic Services" href="crypto.html" />
 <link rel="canonical" href="file:///usr/share/doc/python3.10/html/library/hashlib.html" />

</head>
<body>
<div class="mobile-nav">
 <input type="checkbox" id="menuToggler" class="toggler__input" aria-controls="navigation"
 aria-pressed="false" aria-expanded="false" role="button" aria-label="Menu" />
 <label for="menuToggler" class="toggler__label">
 
 </label>
 <nav class="nav-content" role="navigation">
 <a href="https://www.python.org/" class="nav-logo">
 <img src="../_static/py.svg" alt="Logo"/>
 </a>
 <div class="version_switcher_placeholder"></div>
 <form role="search" class="search" action="../search.html" method="get">
 <svg xmlns="http://www.w3.org/2000/svg" width="20" height="20" viewBox="0 0 24 24" class="search-icon">
 <path fill-rule="nonzero"
 d="M15.5 14h-.79l-.28-.27a6.5 6.5 0 001.48-5.34c-.47-2.78-2.79-5-5.59-5.34a6.505 6.505 0 00-7.27 7.27c.34 2.8 2.56 5.12 5.34 5.59a6.5 6.5 0 005.34-1.48l.27.28v.79l4.25 4.25c.41.41 1.08.41 1.49 0 .41-.41.41-1.08 0-1.49L15.5 14zm-6 0C7.01 14 5 11.99 5 9.5S7.01 5 9.5 5 14 7.01 14 9.5 11.99 14 9.5 14z" fill="#444"></path>
 </svg>
 <input type="text" name="q" aria-label="Quick search"/>
 <input type="submit" value="Go"/>
 </form>
 </nav>
 <div class="menu-wrapper">
 <nav class="menu" role="navigation" aria-label="main navigation">
 <div class="language_switcher_placeholder"></div>
 <h3><a href="../contents.html">Table of Contents</a></h3>
 <ul>
<li><a class="reference internal" href="#"><code class="xref py py-mod docutils literal notranslate">hashlib</code> — Secure hashes and message digests</a><ul>
<li><a class="reference internal" href="#hash-algorithms">Hash algorithms</a></li>
<li><a class="reference internal" href="#shake-variable-length-digests">SHAKE variable length digests</a></li>
<li><a class="reference internal" href="#key-derivation">Key derivation</a></li>
<li><a class="reference internal" href="#blake2">BLAKE2</a><ul>
<li><a class="reference internal" href="#creating-hash-objects">Creating hash objects</a></li>
<li><a class="reference internal" href="#constants">Constants</a></li>
<li><a class="reference internal" href="#examples">Examples</a><ul>
<li><a class="reference internal" href="#simple-hashing">Simple hashing</a></li>
<li><a class="reference internal" href="#using-different-digest-sizes">Using different digest sizes</a></li>
<li><a class="reference internal" href="#keyed-hashing">Keyed hashing</a></li>
<li><a class="reference internal" href="#randomized-hashing">Randomized hashing</a></li>
<li><a class="reference internal" href="#personalization">Personalization</a></li>
<li><a class="reference internal" href="#tree-mode">Tree mode</a></li>
</ul>
</li>
<li><a class="reference internal" href="#credits">Credits</a></li>
</ul>
</li>
</ul>
</li>
</ul>

<div class="related" role="navigation" aria-label="related navigation">
 <h3>Navigation</h3>
 <ul>
 <li class="right" style="margin-right: 10px">
 <a href="../genindex.html" title="General Index"
 accesskey="I">index</a></li>
 <li class="right" >
 <a href="../py-modindex.html" title="Python Module Index"
 >modules</a> |</li>
 <li class="right" >
 <a href="hmac.html" title="hmac — Keyed-Hashing for Message Authentication"
 accesskey="N">next</a> |</li>
 <li class="right" >
 <a href="crypto.html" title="Cryptographic Services"
 accesskey="P">previous</a> |</li>

<li><img src="../_static/py.svg" alt="python logo" style="vertical-align: middle; margin-top: -1px"/></li>
 <li><a href="https://www.python.org/">Python</a> &#187;</li>
 <li class="switchers">
 <div class="language_switcher_placeholder"></div>
 <div class="version_switcher_placeholder"></div>
 </li>
 <li>
 
 </li>
 <li id="cpython-language-and-version">
 <a href="../index.html">3.10.12 Documentation</a> &#187;
 </li>

<li class="nav-item nav-item-1"><a href="index.html" >The Python Standard Library</a> &#187;</li>
 <li class="nav-item nav-item-2"><a href="crypto.html" accesskey="U">Cryptographic Services</a> &#187;</li>
 <li class="nav-item nav-item-this"><a href=""><code class="xref py py-mod docutils literal notranslate">hashlib</code> — Secure hashes and message digests</a></li>
 <li class="right">

<div class="document">
 <div class="documentwrapper">
 <div class="bodywrapper">
 <div class="body" role="main">
 
 <section id="module-hashlib">
<h1><a class="reference internal" href="#module-hashlib" title="hashlib: Secure hash and message digest algorithms."><code class="xref py py-mod docutils literal notranslate">hashlib</code></a> — Secure hashes and message digests<a class="headerlink" href="#module-hashlib" title="Permalink to this headline">¶</a></h1>
Source code: <a class="reference external" href="https://github.com/python/cpython/tree/3.10/Lib/hashlib.py">Lib/hashlib.py</a>
<hr class="docutils" />
This module implements a common interface to many different secure hash and
message digest algorithms. Included are the FIPS secure hash algorithms SHA1,
SHA224, SHA256, SHA384, and SHA512 (defined in FIPS 180-2) as well as RSA’s MD5
algorithm (defined in internet <a class="rfc reference external" href="https://datatracker.ietf.org/doc/html/rfc1321.html">RFC 1321</a>). The terms “secure hash” and
“message digest” are interchangeable. Older algorithms were called message
digests. The modern term is secure hash.
<div class="admonition note">
Note
If you want the adler32 or crc32 hash functions, they are available in
the <a class="reference internal" href="zlib.html#module-zlib" title="zlib: Low-level interface to compression and decompression routines compatible with gzip."><code class="xref py py-mod docutils literal notranslate">zlib</code></a> module.
</div>
<div class="admonition warning">
Warning
Some algorithms have known hash collision weaknesses, refer to the “See
also” section at the end.
</div>
<section id="hash-algorithms">
<h2>Hash algorithms<a class="headerlink" href="#hash-algorithms" title="Permalink to this headline">¶</a></h2>
There is one constructor method named for each type of hash. All return
a hash object with the same simple interface. For example: use <code class="xref py py-func docutils literal notranslate">sha256()</code> to
create a SHA-256 hash object. You can now feed this object with <a class="reference internal" href="../glossary.html#term-bytes-like-object">bytes-like
objects</a> (normally <a class="reference internal" href="stdtypes.html#bytes" title="bytes"><code class="xref py py-class docutils literal notranslate">bytes</code></a>) using the <code class="xref py py-meth docutils literal notranslate">update()</code> method.
At any point you can ask it for the digest of the
concatenation of the data fed to it so far using the <code class="xref py py-meth docutils literal notranslate">digest()</code> or
<code class="xref py py-meth docutils literal notranslate">hexdigest()</code> methods.
<div class="admonition note">
Note
For better multithreading performance, the Python <a class="reference internal" href="../glossary.html#term-GIL">GIL</a> is released for
data larger than 2047 bytes at object creation or on update.
</div>
<div class="admonition note">
Note
Feeding string objects into <code class="xref py py-meth docutils literal notranslate">update()</code> is not supported, as hashes work
on bytes, not on characters.
</div>
Constructors for hash algorithms that are always present in this module are
<code class="xref py py-func docutils literal notranslate">sha1()</code>, <code class="xref py py-func docutils literal notranslate">sha224()</code>, <code class="xref py py-func docutils literal notranslate">sha256()</code>, <code class="xref py py-func docutils literal notranslate">sha384()</code>,
<code class="xref py py-func docutils literal notranslate">sha512()</code>, <a class="reference internal" href="#hashlib.blake2b" title="hashlib.blake2b"><code class="xref py py-func docutils literal notranslate">blake2b()</code></a>, and <a class="reference internal" href="#hashlib.blake2s" title="hashlib.blake2s"><code class="xref py py-func docutils literal notranslate">blake2s()</code></a>.
<code class="xref py py-func docutils literal notranslate">md5()</code> is normally available as well, though it
may be missing or blocked if you are using a rare “FIPS compliant” build of Python.
Additional algorithms may also be available depending upon the OpenSSL
library that Python uses on your platform. On most platforms the
<code class="xref py py-func docutils literal notranslate">sha3_224()</code>, <code class="xref py py-func docutils literal notranslate">sha3_256()</code>, <code class="xref py py-func docutils literal notranslate">sha3_384()</code>, <code class="xref py py-func docutils literal notranslate">sha3_512()</code>,
<code class="xref py py-func docutils literal notranslate">shake_128()</code>, <code class="xref py py-func docutils literal notranslate">shake_256()</code> are also available.
<div class="versionadded">
New in version 3.6: SHA3 (Keccak) and SHAKE constructors <code class="xref py py-func docutils literal notranslate">sha3_224()</code>, <code class="xref py py-func docutils literal notranslate">sha3_256()</code>,
<code class="xref py py-func docutils literal notranslate">sha3_384()</code>, <code class="xref py py-func docutils literal notranslate">sha3_512()</code>, <code class="xref py py-func docutils literal notranslate">shake_128()</code>, <code class="xref py py-func docutils literal notranslate">shake_256()</code>.
</div>
<div class="versionadded">
New in version 3.6: <a class="reference internal" href="#hashlib.blake2b" title="hashlib.blake2b"><code class="xref py py-func docutils literal notranslate">blake2b()</code></a> and <a class="reference internal" href="#hashlib.blake2s" title="hashlib.blake2s"><code class="xref py py-func docutils literal notranslate">blake2s()</code></a> were added.
</div>
<div class="versionchanged" id="hashlib-usedforsecurity">
Changed in version 3.9: All hashlib constructors take a keyword-only argument usedforsecurity
with default value <code class="docutils literal notranslate">True</code>. A false value allows the use of insecure and
blocked hashing algorithms in restricted environments. <code class="docutils literal notranslate">False</code> indicates
that the hashing algorithm is not used in a security context, e.g. as a
non-cryptographic one-way compression function.
Hashlib now uses SHA3 and SHAKE from OpenSSL 1.1.1 and newer.
</div>
For example, to obtain the digest of the byte string <code class="docutils literal notranslate">b'Nobody inspects the
spammish repetition'</code>:
<div class="highlight-python3 notranslate"><div class="highlight"><pre>&gt;&gt;&gt; import hashlib
&gt;&gt;&gt; m = hashlib.sha256()
&gt;&gt;&gt; m.update(b&quot;Nobody inspects&quot;)
&gt;&gt;&gt; m.update(b&quot; the spammish repetition&quot;)
&gt;&gt;&gt; m.digest()
b&#39;\x03\x1e\xdd}Ae\x15\x93\xc5\xfe\\\x00o\xa5u+7\xfd\xdf\xf7\xbcN\x84:\xa6\xaf\x0c\x95\x0fK\x94\x06&#39;
&gt;&gt;&gt; m.digest_size
32
&gt;&gt;&gt; m.block_size
64
</pre></div>
</div>
More condensed:
<div class="doctest highlight-default notranslate"><div class="highlight"><pre>&gt;&gt;&gt; hashlib.sha224(b&quot;Nobody inspects the spammish repetition&quot;).hexdigest()
&#39;a4337bc45a8fc544c03f52dc550cd6e1e87021bc896588bd79e901e2&#39;
</pre></div>
</div>
<dl class="py function">
<dt class="sig sig-object py" id="hashlib.new">
hashlib.new(name, [data, ]*, usedforsecurity=True)<a class="headerlink" href="#hashlib.new" title="Permalink to this definition">¶</a></dt>
<dd>Is a generic constructor that takes the string name of the desired
algorithm as its first parameter. It also exists to allow access to the
above listed hashes as well as any other algorithms that your OpenSSL
library may offer. The named constructors are much faster than <a class="reference internal" href="#hashlib.new" title="hashlib.new"><code class="xref py py-func docutils literal notranslate">new()</code></a>
and should be preferred.
</dd></dl>

Using <a class="reference internal" href="#hashlib.new" title="hashlib.new"><code class="xref py py-func docutils literal notranslate">new()</code></a> with an algorithm provided by OpenSSL:
<div class="doctest highlight-default notranslate"><div class="highlight"><pre>&gt;&gt;&gt; h = hashlib.new(&#39;sha256&#39;)
&gt;&gt;&gt; h.update(b&quot;Nobody inspects the spammish repetition&quot;)
&gt;&gt;&gt; h.hexdigest()
&#39;031edd7d41651593c5fe5c006fa5752b37fddff7bc4e843aa6af0c950f4b9406&#39;
</pre></div>
</div>
Hashlib provides the following constant attributes:
<dl class="py data">
<dt class="sig sig-object py" id="hashlib.algorithms_guaranteed">
hashlib.algorithms_guaranteed<a class="headerlink" href="#hashlib.algorithms_guaranteed" title="Permalink to this definition">¶</a></dt>
<dd>A set containing the names of the hash algorithms guaranteed to be supported
by this module on all platforms. Note that ‘md5’ is in this list despite
some upstream vendors offering an odd “FIPS compliant” Python build that
excludes it.
<div class="versionadded">
New in version 3.2.
</div>
</dd></dl>

<dl class="py data">
<dt class="sig sig-object py" id="hashlib.algorithms_available">
hashlib.algorithms_available<a class="headerlink" href="#hashlib.algorithms_available" title="Permalink to this definition">¶</a></dt>
<dd>A set containing the names of the hash algorithms that are available in the
running Python interpreter. These names will be recognized when passed to
<a class="reference internal" href="#hashlib.new" title="hashlib.new"><code class="xref py py-func docutils literal notranslate">new()</code></a>. <a class="reference internal" href="#hashlib.algorithms_guaranteed" title="hashlib.algorithms_guaranteed"><code class="xref py py-attr docutils literal notranslate">algorithms_guaranteed</code></a> will always be a subset. The
same algorithm may appear multiple times in this set under different names
(thanks to OpenSSL).
<div class="versionadded">
New in version 3.2.
</div>
</dd></dl>

The following values are provided as constant attributes of the hash objects
returned by the constructors:
<dl class="py data">
<dt class="sig sig-object py" id="hashlib.hash.digest_size">
hash.digest_size<a class="headerlink" href="#hashlib.hash.digest_size" title="Permalink to this definition">¶</a></dt>
<dd>The size of the resulting hash in bytes.
</dd></dl>

<dl class="py data">
<dt class="sig sig-object py" id="hashlib.hash.block_size">
hash.block_size<a class="headerlink" href="#hashlib.hash.block_size" title="Permalink to this definition">¶</a></dt>
<dd>The internal block size of the hash algorithm in bytes.
</dd></dl>

A hash object has the following attributes:
<dl class="py attribute">
<dt class="sig sig-object py" id="hashlib.hash.name">
hash.name<a class="headerlink" href="#hashlib.hash.name" title="Permalink to this definition">¶</a></dt>
<dd>The canonical name of this hash, always lowercase and always suitable as a
parameter to <a class="reference internal" href="#hashlib.new" title="hashlib.new"><code class="xref py py-func docutils literal notranslate">new()</code></a> to create another hash of this type.
<div class="versionchanged">
Changed in version 3.4: The name attribute has been present in CPython since its inception, but
until Python 3.4 was not formally specified, so may not exist on some
platforms.
</div>
</dd></dl>

A hash object has the following methods:
<dl class="py method">
<dt class="sig sig-object py" id="hashlib.hash.update">
hash.update(data)<a class="headerlink" href="#hashlib.hash.update" title="Permalink to this definition">¶</a></dt>
<dd>Update the hash object with the <a class="reference internal" href="../glossary.html#term-bytes-like-object">bytes-like object</a>.
Repeated calls are equivalent to a single call with the
concatenation of all the arguments: <code class="docutils literal notranslate">m.update(a); m.update(b)</code> is
equivalent to <code class="docutils literal notranslate">m.update(a+b)</code>.
<div class="versionchanged">
Changed in version 3.1: The Python GIL is released to allow other threads to run while hash
updates on data larger than 2047 bytes is taking place when using hash
algorithms supplied by OpenSSL.
</div>
</dd></dl>

<dl class="py method">
<dt class="sig sig-object py" id="hashlib.hash.digest">
hash.digest()<a class="headerlink" href="#hashlib.hash.digest" title="Permalink to this definition">¶</a></dt>
<dd>Return the digest of the data passed to the <a class="reference internal" href="#hashlib.hash.update" title="hashlib.hash.update"><code class="xref py py-meth docutils literal notranslate">update()</code></a> method so far.
This is a bytes object of size <a class="reference internal" href="#hashlib.hash.digest_size" title="hashlib.hash.digest_size"><code class="xref py py-attr docutils literal notranslate">digest_size</code></a> which may contain bytes in
the whole range from 0 to 255.
</dd></dl>

<dl class="py method">
<dt class="sig sig-object py" id="hashlib.hash.hexdigest">
hash.hexdigest()<a class="headerlink" href="#hashlib.hash.hexdigest" title="Permalink to this definition">¶</a></dt>
<dd>Like <a class="reference internal" href="#hashlib.hash.digest" title="hashlib.hash.digest"><code class="xref py py-meth docutils literal notranslate">digest()</code></a> except the digest is returned as a string object of
double length, containing only hexadecimal digits. This may be used to
exchange the value safely in email or other non-binary environments.
</dd></dl>

<dl class="py method">
<dt class="sig sig-object py" id="hashlib.hash.copy">
hash.copy()<a class="headerlink" href="#hashlib.hash.copy" title="Permalink to this definition">¶</a></dt>
<dd>Return a copy (“clone”) of the hash object. This can be used to efficiently
compute the digests of data sharing a common initial substring.
</dd></dl>

</section>
<section id="shake-variable-length-digests">
<h2>SHAKE variable length digests<a class="headerlink" href="#shake-variable-length-digests" title="Permalink to this headline">¶</a></h2>
The <code class="xref py py-func docutils literal notranslate">shake_128()</code> and <code class="xref py py-func docutils literal notranslate">shake_256()</code> algorithms provide variable
length digests with length_in_bits//2 up to 128 or 256 bits of security.
As such, their digest methods require a length. Maximum length is not limited
by the SHAKE algorithm.
<dl class="py method">
<dt class="sig sig-object py" id="hashlib.shake.digest">
shake.digest(length)<a class="headerlink" href="#hashlib.shake.digest" title="Permalink to this definition">¶</a></dt>
<dd>Return the digest of the data passed to the <code class="xref py py-meth docutils literal notranslate">update()</code> method so far.
This is a bytes object of size length which may contain bytes in
the whole range from 0 to 255.
</dd></dl>

<dl class="py method">
<dt class="sig sig-object py" id="hashlib.shake.hexdigest">
shake.hexdigest(length)<a class="headerlink" href="#hashlib.shake.hexdigest" title="Permalink to this definition">¶</a></dt>
<dd>Like <a class="reference internal" href="#hashlib.shake.digest" title="hashlib.shake.digest"><code class="xref py py-meth docutils literal notranslate">digest()</code></a> except the digest is returned as a string object of
double length, containing only hexadecimal digits. This may be used to
exchange the value safely in email or other non-binary environments.
</dd></dl>

</section>
<section id="key-derivation">
<h2>Key derivation<a class="headerlink" href="#key-derivation" title="Permalink to this headline">¶</a></h2>
Key derivation and key stretching algorithms are designed for secure password
hashing. Naive algorithms such as <code class="docutils literal notranslate">sha1(password)</code> are not resistant against
brute-force attacks. A good password hashing function must be tunable, slow, and
include a <a class="reference external" href="https://en.wikipedia.org/wiki/Salt_%28cryptography%29">salt</a>.
<dl class="py function">
<dt class="sig sig-object py" id="hashlib.pbkdf2_hmac">
hashlib.pbkdf2_hmac(hash_name, password, salt, iterations, dklen=None)<a class="headerlink" href="#hashlib.pbkdf2_hmac" title="Permalink to this definition">¶</a></dt>
<dd>The function provides PKCS#5 password-based key derivation function 2. It
uses HMAC as pseudorandom function.
The string hash_name is the desired name of the hash digest algorithm for
HMAC, e.g. ‘sha1’ or ‘sha256’. password and salt are interpreted as
buffers of bytes. Applications and libraries should limit password to
a sensible length (e.g. 1024). salt should be about 16 or more bytes from
a proper source, e.g. <a class="reference internal" href="os.html#os.urandom" title="os.urandom"><code class="xref py py-func docutils literal notranslate">os.urandom()</code></a>.
The number of iterations should be chosen based on the hash algorithm and
computing power. As of 2022, hundreds of thousands of iterations of SHA-256
are suggested. For rationale as to why and how to choose what is best for
your application, read Appendix A.2.2 of <a class="reference external" href="https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-132.pdf">NIST-SP-800-132</a>. The answers
on the <a class="reference external" href="https://security.stackexchange.com/questions/3959/recommended-of-iterations-when-using-pbkdf2-sha256/">stackexchange pbkdf2 iterations question</a> explain in detail.
dklen is the length of the derived key. If dklen is <code class="docutils literal notranslate">None</code> then the
digest size of the hash algorithm hash_name is used, e.g. 64 for SHA-512.
<div class="doctest highlight-default notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import pbkdf2_hmac
&gt;&gt;&gt; our_app_iters = 500_000 # Application specific, read above.
&gt;&gt;&gt; dk = pbkdf2_hmac(&#39;sha256&#39;, b&#39;password&#39;, b&#39;bad salt&#39;*2, our_app_iters)
&gt;&gt;&gt; dk.hex()
&#39;15530bba69924174860db778f2c6f8104d3aaf9d26241840c8c4a641c8d000a9&#39;
</pre></div>
</div>
<div class="versionadded">
New in version 3.4.
</div>
<div class="admonition note">
Note
A fast implementation of pbkdf2_hmac is available with OpenSSL. The
Python implementation uses an inline version of <a class="reference internal" href="hmac.html#module-hmac" title="hmac: Keyed-Hashing for Message Authentication (HMAC) implementation"><code class="xref py py-mod docutils literal notranslate">hmac</code></a>. It is about
three times slower and doesn’t release the GIL.
</div>
<div class="deprecated">
Deprecated since version 3.10: Slow Python implementation of pbkdf2_hmac is deprecated. In the
future the function will only be available when Python is compiled
with OpenSSL.
</div>
</dd></dl>

<dl class="py function">
<dt class="sig sig-object py" id="hashlib.scrypt">
hashlib.scrypt(password, *, salt, n, r, p, maxmem=0, dklen=64)<a class="headerlink" href="#hashlib.scrypt" title="Permalink to this definition">¶</a></dt>
<dd>The function provides scrypt password-based key derivation function as
defined in <a class="rfc reference external" href="https://datatracker.ietf.org/doc/html/rfc7914.html">RFC 7914</a>.
password and salt must be <a class="reference internal" href="../glossary.html#term-bytes-like-object">bytes-like objects</a>. Applications and libraries should limit password
to a sensible length (e.g. 1024). salt should be about 16 or more
bytes from a proper source, e.g. <a class="reference internal" href="os.html#os.urandom" title="os.urandom"><code class="xref py py-func docutils literal notranslate">os.urandom()</code></a>.
n is the CPU/Memory cost factor, r the block size, p parallelization
factor and maxmem limits memory (OpenSSL 1.1.0 defaults to 32 MiB).
dklen is the length of the derived key.
<div class="versionadded">
New in version 3.6.
</div>
</dd></dl>

</section>
<section id="blake2">
<h2>BLAKE2<a class="headerlink" href="#blake2" title="Permalink to this headline">¶</a></h2>
<a class="reference external" href="https://blake2.net">BLAKE2</a> is a cryptographic hash function defined in <a class="rfc reference external" href="https://datatracker.ietf.org/doc/html/rfc7693.html">RFC 7693</a> that comes in two
flavors:
<ul class="simple">
<li>BLAKE2b, optimized for 64-bit platforms and produces digests of any size
between 1 and 64 bytes,</li>
<li>BLAKE2s, optimized for 8- to 32-bit platforms and produces digests of any
size between 1 and 32 bytes.</li>
</ul>
BLAKE2 supports keyed mode (a faster and simpler replacement for <a class="reference external" href="https://en.wikipedia.org/wiki/Hash-based_message_authentication_code">HMAC</a>),
salted hashing, personalization, and tree hashing.
Hash objects from this module follow the API of standard library’s
<a class="reference internal" href="#module-hashlib" title="hashlib: Secure hash and message digest algorithms."><code class="xref py py-mod docutils literal notranslate">hashlib</code></a> objects.
<section id="creating-hash-objects">
<h3>Creating hash objects<a class="headerlink" href="#creating-hash-objects" title="Permalink to this headline">¶</a></h3>
New hash objects are created by calling constructor functions:
<dl class="py function">
<dt class="sig sig-object py" id="hashlib.blake2b">
hashlib.blake2b(data=b'', *, digest_size=64, key=b'', salt=b'', person=b'', fanout=1, depth=1, leaf_size=0, node_offset=0, node_depth=0, inner_size=0, last_node=False, usedforsecurity=True)<a class="headerlink" href="#hashlib.blake2b" title="Permalink to this definition">¶</a></dt>
<dd></dd></dl>

<dl class="py function">
<dt class="sig sig-object py" id="hashlib.blake2s">
hashlib.blake2s(data=b'', *, digest_size=32, key=b'', salt=b'', person=b'', fanout=1, depth=1, leaf_size=0, node_offset=0, node_depth=0, inner_size=0, last_node=False, usedforsecurity=True)<a class="headerlink" href="#hashlib.blake2s" title="Permalink to this definition">¶</a></dt>
<dd></dd></dl>

These functions return the corresponding hash objects for calculating
BLAKE2b or BLAKE2s. They optionally take these general parameters:
<ul class="simple">
<li>data: initial chunk of data to hash, which must be
<a class="reference internal" href="../glossary.html#term-bytes-like-object">bytes-like object</a>. It can be passed only as positional argument.</li>
<li>digest_size: size of output digest in bytes.</li>
<li>key: key for keyed hashing (up to 64 bytes for BLAKE2b, up to 32 bytes for
BLAKE2s).</li>
<li>salt: salt for randomized hashing (up to 16 bytes for BLAKE2b, up to 8
bytes for BLAKE2s).</li>
<li>person: personalization string (up to 16 bytes for BLAKE2b, up to 8 bytes
for BLAKE2s).</li>
</ul>
The following table shows limits for general parameters (in bytes):
<table class="docutils align-default">
<colgroup>
<col style="width: 15%" />
<col style="width: 24%" />
<col style="width: 17%" />
<col style="width: 20%" />
<col style="width: 24%" />
</colgroup>
<thead>
<tr class="row-odd"><th class="head">Hash</th>
<th class="head">digest_size</th>
<th class="head">len(key)</th>
<th class="head">len(salt)</th>
<th class="head">len(person)</th>
</tr>
</thead>
<tbody>
<tr class="row-even"><td>BLAKE2b</td>
<td>64</td>
<td>64</td>
<td>16</td>
<td>16</td>
</tr>
<tr class="row-odd"><td>BLAKE2s</td>
<td>32</td>
<td>32</td>
<td>8</td>
<td>8</td>
</tr>
</tbody>
</table>
<div class="admonition note">
Note
BLAKE2 specification defines constant lengths for salt and personalization
parameters, however, for convenience, this implementation accepts byte
strings of any size up to the specified length. If the length of the
parameter is less than specified, it is padded with zeros, thus, for
example, <code class="docutils literal notranslate">b'salt'</code> and <code class="docutils literal notranslate">b'salt\x00'</code> is the same value. (This is not
the case for key.)
</div>
These sizes are available as module <a class="reference internal" href="#constants">constants</a> described below.
Constructor functions also accept the following tree hashing parameters:
<ul class="simple">
<li>fanout: fanout (0 to 255, 0 if unlimited, 1 in sequential mode).</li>
<li>depth: maximal depth of tree (1 to 255, 255 if unlimited, 1 in
sequential mode).</li>
<li>leaf_size: maximal byte length of leaf (0 to <code class="docutils literal notranslate">2**32-1</code>, 0 if unlimited or in
sequential mode).</li>
<li>node_offset: node offset (0 to <code class="docutils literal notranslate">2**64-1</code> for BLAKE2b, 0 to <code class="docutils literal notranslate">2**48-1</code> for
BLAKE2s, 0 for the first, leftmost, leaf, or in sequential mode).</li>
<li>node_depth: node depth (0 to 255, 0 for leaves, or in sequential mode).</li>
<li>inner_size: inner digest size (0 to 64 for BLAKE2b, 0 to 32 for
BLAKE2s, 0 in sequential mode).</li>
<li>last_node: boolean indicating whether the processed node is the last
one (<code class="docutils literal notranslate">False</code> for sequential mode).</li>
</ul>
<figure class="align-default">
<img alt="Explanation of tree mode parameters." src="../_images/hashlib-blake2-tree.png" />
</figure>
See section 2.10 in <a class="reference external" href="https://blake2.net/blake2_20130129.pdf">BLAKE2 specification</a> for comprehensive review of tree
hashing.
</section>
<section id="constants">
<h3>Constants<a class="headerlink" href="#constants" title="Permalink to this headline">¶</a></h3>
<dl class="py data">
<dt class="sig sig-object py" id="hashlib.blake2b.SALT_SIZE">
blake2b.SALT_SIZE<a class="headerlink" href="#hashlib.blake2b.SALT_SIZE" title="Permalink to this definition">¶</a></dt>
<dd></dd></dl>

<dl class="py data">
<dt class="sig sig-object py" id="hashlib.blake2s.SALT_SIZE">
blake2s.SALT_SIZE<a class="headerlink" href="#hashlib.blake2s.SALT_SIZE" title="Permalink to this definition">¶</a></dt>
<dd></dd></dl>

Salt length (maximum length accepted by constructors).
<dl class="py data">
<dt class="sig sig-object py" id="hashlib.blake2b.PERSON_SIZE">
blake2b.PERSON_SIZE<a class="headerlink" href="#hashlib.blake2b.PERSON_SIZE" title="Permalink to this definition">¶</a></dt>
<dd></dd></dl>

<dl class="py data">
<dt class="sig sig-object py" id="hashlib.blake2s.PERSON_SIZE">
blake2s.PERSON_SIZE<a class="headerlink" href="#hashlib.blake2s.PERSON_SIZE" title="Permalink to this definition">¶</a></dt>
<dd></dd></dl>

Personalization string length (maximum length accepted by constructors).
<dl class="py data">
<dt class="sig sig-object py" id="hashlib.blake2b.MAX_KEY_SIZE">
blake2b.MAX_KEY_SIZE<a class="headerlink" href="#hashlib.blake2b.MAX_KEY_SIZE" title="Permalink to this definition">¶</a></dt>
<dd></dd></dl>

<dl class="py data">
<dt class="sig sig-object py" id="hashlib.blake2s.MAX_KEY_SIZE">
blake2s.MAX_KEY_SIZE<a class="headerlink" href="#hashlib.blake2s.MAX_KEY_SIZE" title="Permalink to this definition">¶</a></dt>
<dd></dd></dl>

Maximum key size.
<dl class="py data">
<dt class="sig sig-object py" id="hashlib.blake2b.MAX_DIGEST_SIZE">
blake2b.MAX_DIGEST_SIZE<a class="headerlink" href="#hashlib.blake2b.MAX_DIGEST_SIZE" title="Permalink to this definition">¶</a></dt>
<dd></dd></dl>

<dl class="py data">
<dt class="sig sig-object py" id="hashlib.blake2s.MAX_DIGEST_SIZE">
blake2s.MAX_DIGEST_SIZE<a class="headerlink" href="#hashlib.blake2s.MAX_DIGEST_SIZE" title="Permalink to this definition">¶</a></dt>
<dd></dd></dl>

Maximum digest size that the hash function can output.
</section>
<section id="examples">
<h3>Examples<a class="headerlink" href="#examples" title="Permalink to this headline">¶</a></h3>
<section id="simple-hashing">
<h4>Simple hashing<a class="headerlink" href="#simple-hashing" title="Permalink to this headline">¶</a></h4>
To calculate hash of some data, you should first construct a hash object by
calling the appropriate constructor function (<a class="reference internal" href="#hashlib.blake2b" title="hashlib.blake2b"><code class="xref py py-func docutils literal notranslate">blake2b()</code></a> or
<a class="reference internal" href="#hashlib.blake2s" title="hashlib.blake2s"><code class="xref py py-func docutils literal notranslate">blake2s()</code></a>), then update it with the data by calling <code class="xref py py-meth docutils literal notranslate">update()</code> on the
object, and, finally, get the digest out of the object by calling
<code class="xref py py-meth docutils literal notranslate">digest()</code> (or <code class="xref py py-meth docutils literal notranslate">hexdigest()</code> for hex-encoded string).
<div class="doctest highlight-default notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import blake2b
&gt;&gt;&gt; h = blake2b()
&gt;&gt;&gt; h.update(b&#39;Hello world&#39;)
&gt;&gt;&gt; h.hexdigest()
&#39;6ff843ba685842aa82031d3f53c48b66326df7639a63d128974c5c14f31a0f33343a8c65551134ed1ae0f2b0dd2bb495dc81039e3eeb0aa1bb0388bbeac29183&#39;
</pre></div>
</div>
As a shortcut, you can pass the first chunk of data to update directly to the
constructor as the positional argument:
<div class="doctest highlight-default notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import blake2b
&gt;&gt;&gt; blake2b(b&#39;Hello world&#39;).hexdigest()
&#39;6ff843ba685842aa82031d3f53c48b66326df7639a63d128974c5c14f31a0f33343a8c65551134ed1ae0f2b0dd2bb495dc81039e3eeb0aa1bb0388bbeac29183&#39;
</pre></div>
</div>
You can call <a class="reference internal" href="#hashlib.hash.update" title="hashlib.hash.update"><code class="xref py py-meth docutils literal notranslate">hash.update()</code></a> as many times as you need to iteratively
update the hash:
<div class="doctest highlight-default notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import blake2b
&gt;&gt;&gt; items = [b&#39;Hello&#39;, b&#39; &#39;, b&#39;world&#39;]
&gt;&gt;&gt; h = blake2b()
&gt;&gt;&gt; for item in items:
... h.update(item)
&gt;&gt;&gt; h.hexdigest()
&#39;6ff843ba685842aa82031d3f53c48b66326df7639a63d128974c5c14f31a0f33343a8c65551134ed1ae0f2b0dd2bb495dc81039e3eeb0aa1bb0388bbeac29183&#39;
</pre></div>
</div>
</section>
<section id="using-different-digest-sizes">
<h4>Using different digest sizes<a class="headerlink" href="#using-different-digest-sizes" title="Permalink to this headline">¶</a></h4>
BLAKE2 has configurable size of digests up to 64 bytes for BLAKE2b and up to 32
bytes for BLAKE2s. For example, to replace SHA-1 with BLAKE2b without changing
the size of output, we can tell BLAKE2b to produce 20-byte digests:
<div class="doctest highlight-default notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import blake2b
&gt;&gt;&gt; h = blake2b(digest_size=20)
&gt;&gt;&gt; h.update(b&#39;Replacing SHA1 with the more secure function&#39;)
&gt;&gt;&gt; h.hexdigest()
&#39;d24f26cf8de66472d58d4e1b1774b4c9158b1f4c&#39;
&gt;&gt;&gt; h.digest_size
20
&gt;&gt;&gt; len(h.digest())
20
</pre></div>
</div>
Hash objects with different digest sizes have completely different outputs
(shorter hashes are not prefixes of longer hashes); BLAKE2b and BLAKE2s
produce different outputs even if the output length is the same:
<div class="doctest highlight-default notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import blake2b, blake2s
&gt;&gt;&gt; blake2b(digest_size=10).hexdigest()
&#39;6fa1d8fcfd719046d762&#39;
&gt;&gt;&gt; blake2b(digest_size=11).hexdigest()
&#39;eb6ec15daf9546254f0809&#39;
&gt;&gt;&gt; blake2s(digest_size=10).hexdigest()
&#39;1bf21a98c78a1c376ae9&#39;
&gt;&gt;&gt; blake2s(digest_size=11).hexdigest()
&#39;567004bf96e4a25773ebf4&#39;
</pre></div>
</div>
</section>
<section id="keyed-hashing">
<h4>Keyed hashing<a class="headerlink" href="#keyed-hashing" title="Permalink to this headline">¶</a></h4>
Keyed hashing can be used for authentication as a faster and simpler
replacement for <a class="reference external" href="https://en.wikipedia.org/wiki/HMAC">Hash-based message authentication code</a> (HMAC).
BLAKE2 can be securely used in prefix-MAC mode thanks to the
indifferentiability property inherited from BLAKE.
This example shows how to get a (hex-encoded) 128-bit authentication code for
message <code class="docutils literal notranslate">b'message data'</code> with key <code class="docutils literal notranslate">b'pseudorandom key'</code>:
<div class="highlight-python3 notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import blake2b
&gt;&gt;&gt; h = blake2b(key=b&#39;pseudorandom key&#39;, digest_size=16)
&gt;&gt;&gt; h.update(b&#39;message data&#39;)
&gt;&gt;&gt; h.hexdigest()
&#39;3d363ff7401e02026f4a4687d4863ced&#39;
</pre></div>
</div>
As a practical example, a web application can symmetrically sign cookies sent
to users and later verify them to make sure they weren’t tampered with:
<div class="highlight-python3 notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import blake2b
&gt;&gt;&gt; from hmac import compare_digest
&gt;&gt;&gt;
&gt;&gt;&gt; SECRET_KEY = b&#39;pseudorandomly generated server secret key&#39;
&gt;&gt;&gt; AUTH_SIZE = 16
&gt;&gt;&gt;
&gt;&gt;&gt; def sign(cookie):
... h = blake2b(digest_size=AUTH_SIZE, key=SECRET_KEY)
... h.update(cookie)
... return h.hexdigest().encode(&#39;utf-8&#39;)
&gt;&gt;&gt;
&gt;&gt;&gt; def verify(cookie, sig):
... good_sig = sign(cookie)
... return compare_digest(good_sig, sig)
&gt;&gt;&gt;
&gt;&gt;&gt; cookie = b&#39;user-alice&#39;
&gt;&gt;&gt; sig = sign(cookie)
&gt;&gt;&gt; print(&quot;{0},{1}&quot;.format(cookie.decode(&#39;utf-8&#39;), sig))
user-alice,b&#39;43b3c982cf697e0c5ab22172d1ca7421&#39;
&gt;&gt;&gt; verify(cookie, sig)
True
&gt;&gt;&gt; verify(b&#39;user-bob&#39;, sig)
False
&gt;&gt;&gt; verify(cookie, b&#39;0102030405060708090a0b0c0d0e0f00&#39;)
False
</pre></div>
</div>
Even though there’s a native keyed hashing mode, BLAKE2 can, of course, be used
in HMAC construction with <a class="reference internal" href="hmac.html#module-hmac" title="hmac: Keyed-Hashing for Message Authentication (HMAC) implementation"><code class="xref py py-mod docutils literal notranslate">hmac</code></a> module:
<div class="highlight-python3 notranslate"><div class="highlight"><pre>&gt;&gt;&gt; import hmac, hashlib
&gt;&gt;&gt; m = hmac.new(b&#39;secret key&#39;, digestmod=hashlib.blake2s)
&gt;&gt;&gt; m.update(b&#39;message&#39;)
&gt;&gt;&gt; m.hexdigest()
&#39;e3c8102868d28b5ff85fc35dda07329970d1a01e273c37481326fe0c861c8142&#39;
</pre></div>
</div>
</section>
<section id="randomized-hashing">
<h4>Randomized hashing<a class="headerlink" href="#randomized-hashing" title="Permalink to this headline">¶</a></h4>
By setting salt parameter users can introduce randomization to the hash
function. Randomized hashing is useful for protecting against collision attacks
on the hash function used in digital signatures.
<blockquote>
<div>Randomized hashing is designed for situations where one party, the message
preparer, generates all or part of a message to be signed by a second
party, the message signer. If the message preparer is able to find
cryptographic hash function collisions (i.e., two messages producing the
same hash value), then they might prepare meaningful versions of the message
that would produce the same hash value and digital signature, but with
different results (e.g., transferring $1,000,000 to an account, rather than
$10). Cryptographic hash functions have been designed with collision
resistance as a major goal, but the current concentration on attacking
cryptographic hash functions may result in a given cryptographic hash
function providing less collision resistance than expected. Randomized
hashing offers the signer additional protection by reducing the likelihood
that a preparer can generate two or more messages that ultimately yield the
same hash value during the digital signature generation process — even if
it is practical to find collisions for the hash function. However, the use
of randomized hashing may reduce the amount of security provided by a
digital signature when all portions of the message are prepared
by the signer.
(<a class="reference external" href="https://csrc.nist.gov/publications/detail/sp/800-106/final">NIST SP-800-106 “Randomized Hashing for Digital Signatures”</a>)
</div></blockquote>
In BLAKE2 the salt is processed as a one-time input to the hash function during
initialization, rather than as an input to each compression function.
<div class="admonition warning">
Warning
Salted hashing (or just hashing) with BLAKE2 or any other general-purpose
cryptographic hash function, such as SHA-256, is not suitable for hashing
passwords. See <a class="reference external" href="https://blake2.net/#qa">BLAKE2 FAQ</a> for more
information.
</div>
<div class="doctest highlight-default notranslate"><div class="highlight"><pre>&gt;&gt;&gt; import os
&gt;&gt;&gt; from hashlib import blake2b
&gt;&gt;&gt; msg = b&#39;some message&#39;
&gt;&gt;&gt; # Calculate the first hash with a random salt.
&gt;&gt;&gt; salt1 = os.urandom(blake2b.SALT_SIZE)
&gt;&gt;&gt; h1 = blake2b(salt=salt1)
&gt;&gt;&gt; h1.update(msg)
&gt;&gt;&gt; # Calculate the second hash with a different random salt.
&gt;&gt;&gt; salt2 = os.urandom(blake2b.SALT_SIZE)
&gt;&gt;&gt; h2 = blake2b(salt=salt2)
&gt;&gt;&gt; h2.update(msg)
&gt;&gt;&gt; # The digests are different.
&gt;&gt;&gt; h1.digest() != h2.digest()
True
</pre></div>
</div>
</section>
<section id="personalization">
<h4>Personalization<a class="headerlink" href="#personalization" title="Permalink to this headline">¶</a></h4>
Sometimes it is useful to force hash function to produce different digests for
the same input for different purposes. Quoting the authors of the Skein hash
function:
<blockquote>
<div>We recommend that all application designers seriously consider doing this;
we have seen many protocols where a hash that is computed in one part of
the protocol can be used in an entirely different part because two hash
computations were done on similar or related data, and the attacker can
force the application to make the hash inputs the same. Personalizing each
hash function used in the protocol summarily stops this type of attack.
(<a class="reference external" href="https://www.schneier.com/wp-content/uploads/2016/02/skein.pdf">The Skein Hash Function Family</a>,
p. 21)
</div></blockquote>
BLAKE2 can be personalized by passing bytes to the person argument:
<div class="highlight-python3 notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import blake2b
&gt;&gt;&gt; FILES_HASH_PERSON = b&#39;MyApp Files Hash&#39;
&gt;&gt;&gt; BLOCK_HASH_PERSON = b&#39;MyApp Block Hash&#39;
&gt;&gt;&gt; h = blake2b(digest_size=32, person=FILES_HASH_PERSON)
&gt;&gt;&gt; h.update(b&#39;the same content&#39;)
&gt;&gt;&gt; h.hexdigest()
&#39;20d9cd024d4fb086aae819a1432dd2466de12947831b75c5a30cf2676095d3b4&#39;
&gt;&gt;&gt; h = blake2b(digest_size=32, person=BLOCK_HASH_PERSON)
&gt;&gt;&gt; h.update(b&#39;the same content&#39;)
&gt;&gt;&gt; h.hexdigest()
&#39;cf68fb5761b9c44e7878bfb2c4c9aea52264a80b75005e65619778de59f383a3&#39;
</pre></div>
</div>
Personalization together with the keyed mode can also be used to derive different
keys from a single one.
<div class="doctest highlight-default notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import blake2s
&gt;&gt;&gt; from base64 import b64decode, b64encode
&gt;&gt;&gt; orig_key = b64decode(b&#39;Rm5EPJai72qcK3RGBpW3vPNfZy5OZothY+kHY6h21KM=&#39;)
&gt;&gt;&gt; enc_key = blake2s(key=orig_key, person=b&#39;kEncrypt&#39;).digest()
&gt;&gt;&gt; mac_key = blake2s(key=orig_key, person=b&#39;kMAC&#39;).digest()
&gt;&gt;&gt; print(b64encode(enc_key).decode(&#39;utf-8&#39;))
rbPb15S/Z9t+agffno5wuhB77VbRi6F9Iv2qIxU7WHw=
&gt;&gt;&gt; print(b64encode(mac_key).decode(&#39;utf-8&#39;))
G9GtHFE1YluXY1zWPlYk1e/nWfu0WSEb0KRcjhDeP/o=
</pre></div>
</div>
</section>
<section id="tree-mode">
<h4>Tree mode<a class="headerlink" href="#tree-mode" title="Permalink to this headline">¶</a></h4>
Here’s an example of hashing a minimal tree with two leaf nodes:
<div class="highlight-python3 notranslate"><div class="highlight"><pre> 10
 / \
00 01
</pre></div>
</div>
This example uses 64-byte internal digests, and returns the 32-byte final
digest:
<div class="highlight-python3 notranslate"><div class="highlight"><pre>&gt;&gt;&gt; from hashlib import blake2b
&gt;&gt;&gt;
&gt;&gt;&gt; FANOUT = 2
&gt;&gt;&gt; DEPTH = 2
&gt;&gt;&gt; LEAF_SIZE = 4096
&gt;&gt;&gt; INNER_SIZE = 64
&gt;&gt;&gt;
&gt;&gt;&gt; buf = bytearray(6000)
&gt;&gt;&gt;
&gt;&gt;&gt; # Left leaf
... h00 = blake2b(buf[0:LEAF_SIZE], fanout=FANOUT, depth=DEPTH,
... leaf_size=LEAF_SIZE, inner_size=INNER_SIZE,
... node_offset=0, node_depth=0, last_node=False)
&gt;&gt;&gt; # Right leaf
... h01 = blake2b(buf[LEAF_SIZE:], fanout=FANOUT, depth=DEPTH,
... leaf_size=LEAF_SIZE, inner_size=INNER_SIZE,
... node_offset=1, node_depth=0, last_node=True)
&gt;&gt;&gt; # Root node
... h10 = blake2b(digest_size=32, fanout=FANOUT, depth=DEPTH,
... leaf_size=LEAF_SIZE, inner_size=INNER_SIZE,
... node_offset=0, node_depth=1, last_node=True)
&gt;&gt;&gt; h10.update(h00.digest())
&gt;&gt;&gt; h10.update(h01.digest())
&gt;&gt;&gt; h10.hexdigest()
&#39;3ad2a9b37c6070e374c7a8c508fe20ca86b6ed54e286e93a0318e95e881db5aa&#39;
</pre></div>
</div>
</section>
</section>
<section id="credits">
<h3>Credits<a class="headerlink" href="#credits" title="Permalink to this headline">¶</a></h3>
<a class="reference external" href="https://blake2.net">BLAKE2</a> was designed by Jean-Philippe Aumasson, Samuel Neves, Zooko
Wilcox-O’Hearn, and Christian Winnerlein based on <a class="reference external" href="https://en.wikipedia.org/wiki/NIST_hash_function_competition">SHA-3</a> finalist <a class="reference external" href="https://131002.net/blake/">BLAKE</a>
created by Jean-Philippe Aumasson, Luca Henzen, Willi Meier, and
Raphael C.-W. Phan.
It uses core algorithm from <a class="reference external" href="https://cr.yp.to/chacha.html">ChaCha</a> cipher designed by Daniel J. Bernstein.
The stdlib implementation is based on <a class="reference external" href="https://pythonhosted.org/pyblake2/">pyblake2</a> module. It was written by
Dmitry Chestnykh based on C implementation written by Samuel Neves. The
documentation was copied from <a class="reference external" href="https://pythonhosted.org/pyblake2/">pyblake2</a> and written by Dmitry Chestnykh.
The C code was partly rewritten for Python by Christian Heimes.
The following public domain dedication applies for both C hash function
implementation, extension code, and this documentation:
<blockquote>
<div>To the extent possible under law, the author(s) have dedicated all copyright
and related and neighboring rights to this software to the public domain
worldwide. This software is distributed without any warranty.
You should have received a copy of the CC0 Public Domain Dedication along
with this software. If not, see
<a class="reference external" href="https://creativecommons.org/publicdomain/zero/1.0/">https://creativecommons.org/publicdomain/zero/1.0/</a>.
</div></blockquote>
The following people have helped with development or contributed their changes
to the project and the public domain according to the Creative Commons Public
Domain Dedication 1.0 Universal:
<ul class="simple">
<li>Alexandr Sokolovskiy</li>
</ul>
<div class="admonition seealso">
See also
<dl class="simple">
<dt>Module <a class="reference internal" href="hmac.html#module-hmac" title="hmac: Keyed-Hashing for Message Authentication (HMAC) implementation"><code class="xref py py-mod docutils literal notranslate">hmac</code></a></dt><dd>A module to generate message authentication codes using hashes.
</dd>
<dt>Module <a class="reference internal" href="base64.html#module-base64" title="base64: RFC 4648: Base16, Base32, Base64 Data Encodings; Base85 and Ascii85"><code class="xref py py-mod docutils literal notranslate">base64</code></a></dt><dd>Another way to encode binary hashes for non-binary environments.
</dd>
<dt><a class="reference external" href="https://blake2.net">https://blake2.net</a></dt><dd>Official BLAKE2 website.
</dd>
<dt><a class="reference external" href="https://csrc.nist.gov/csrc/media/publications/fips/180/2/archive/2002-08-01/documents/fips180-2.pdf">https://csrc.nist.gov/csrc/media/publications/fips/180/2/archive/2002-08-01/documents/fips180-2.pdf</a></dt><dd>The FIPS 180-2 publication on Secure Hash Algorithms.
</dd>
<dt><a class="reference external" href="https://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_hash_algorithms">https://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_hash_algorithms</a></dt><dd>Wikipedia article with information on which algorithms have known issues and
what that means regarding their use.
</dd>
<dt><a class="reference external" href="https://www.ietf.org/rfc/rfc8018.txt">https://www.ietf.org/rfc/rfc8018.txt</a></dt><dd>PKCS #5: Password-Based Cryptography Specification Version 2.1
</dd>
<dt><a class="reference external" href="https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-132.pdf">https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-132.pdf</a></dt><dd>NIST Recommendation for Password-Based Key Derivation.
</dd>
</dl>
</div>
</section>
</section>
</section>

<div class="clearer"></div>
 </div>
 </div>
 </div>
 <div class="sphinxsidebar" role="navigation" aria-label="main navigation">
 <div class="sphinxsidebarwrapper">
 <h3><a href="../contents.html">Table of Contents</a></h3>
 <ul>
<li><a class="reference internal" href="#"><code class="xref py py-mod docutils literal notranslate">hashlib</code> — Secure hashes and message digests</a><ul>
<li><a class="reference internal" href="#hash-algorithms">Hash algorithms</a></li>
<li><a class="reference internal" href="#shake-variable-length-digests">SHAKE variable length digests</a></li>
<li><a class="reference internal" href="#key-derivation">Key derivation</a></li>
<li><a class="reference internal" href="#blake2">BLAKE2</a><ul>
<li><a class="reference internal" href="#creating-hash-objects">Creating hash objects</a></li>
<li><a class="reference internal" href="#constants">Constants</a></li>
<li><a class="reference internal" href="#examples">Examples</a><ul>
<li><a class="reference internal" href="#simple-hashing">Simple hashing</a></li>
<li><a class="reference internal" href="#using-different-digest-sizes">Using different digest sizes</a></li>
<li><a class="reference internal" href="#keyed-hashing">Keyed hashing</a></li>
<li><a class="reference internal" href="#randomized-hashing">Randomized hashing</a></li>
<li><a class="reference internal" href="#personalization">Personalization</a></li>
<li><a class="reference internal" href="#tree-mode">Tree mode</a></li>
</ul>
</li>
<li><a class="reference internal" href="#credits">Credits</a></li>
</ul>
</li>
</ul>
</li>
</ul>

<h4>Previous topic</h4>
 <a href="crypto.html"
 title="previous chapter">Cryptographic Services</a>
 <h4>Next topic</h4>
 <a href="hmac.html"
 title="next chapter"><code class="xref py py-mod docutils literal notranslate">hmac</code> — Keyed-Hashing for Message Authentication</a>
 <div role="note" aria-label="source link">
 <h3>This Page</h3>
 <ul class="this-page-menu">
 <li><a href="../bugs.html">Report a Bug</a></li>
 <li>
 <a href="https://github.com/python/cpython/blob/3.10/Doc/library/hashlib.rst"
 rel="nofollow">Show Source
 </a>
 </li>
 </ul>
 </div>
 </div>
 </div>
 <div class="clearer"></div>
 </div> 
 <div class="related" role="navigation" aria-label="related navigation">
 <h3>Navigation</h3>
 <ul>
 <li class="right" style="margin-right: 10px">
 <a href="../genindex.html" title="General Index"
 >index</a></li>
 <li class="right" >
 <a href="../py-modindex.html" title="Python Module Index"
 >modules</a> |</li>
 <li class="right" >
 <a href="hmac.html" title="hmac — Keyed-Hashing for Message Authentication"
 >next</a> |</li>
 <li class="right" >
 <a href="crypto.html" title="Cryptographic Services"
 >previous</a> |</li>

<li class="nav-item nav-item-1"><a href="index.html" >The Python Standard Library</a> &#187;</li>
 <li class="nav-item nav-item-2"><a href="crypto.html" >Cryptographic Services</a> &#187;</li>
 <li class="nav-item nav-item-this"><a href=""><code class="xref py py-mod docutils literal notranslate">hashlib</code> — Secure hashes and message digests</a></li>
 <li class="right">

<div class="inline-search" role="search">
 <form class="inline-search" action="../search.html" method="get">
 <input placeholder="Quick search" aria-label="Quick search" type="text" name="q" />
 <input type="submit" value="Go" />
 <input type="hidden" name="check_keywords" value="yes" />
 <input type="hidden" name="area" value="default" />
 </form>
 </div>
 |
 </li>
 
 </ul>
 </div> 
 <div class="footer">
 &copy; <a href="../copyright.html">Copyright</a> 2001-2026, Python Software Foundation.
 
 This page is licensed under the Python Software Foundation License Version 2.
 
 Examples, recipes, and other code in the documentation are additionally licensed under the Zero Clause BSD License.
 
 See <a href="/license.html">History and License</a> for more information.

The Python Software Foundation is a non-profit corporation.
<a href="https://www.python.org/psf/donations/">Please donate.</a>

Last updated on January 26, 2026.
 <a href="/bugs.html">Found a bug</a>?

Created using <a href="https://www.sphinx-doc.org/">Sphinx</a> 4.3.2.
 </div>

</body>
</html>

${this.title}

Code Editor : hashlib.html