/opt/imunify360/venv/lib/python3.11/site-packages/Crypto/Hash
NameSizeModeActions
__pycache__/-0755rm
BLAKE2b.py94230644editdlrm
BLAKE2b.pyi9060644editdlrm
BLAKE2s.py94290644editdlrm
BLAKE2s.pyi7390644editdlrm
CMAC.py103510644editdlrm
CMAC.pyi8220644editdlrm
cSHAKE128.py63170644editdlrm
cSHAKE128.pyi4990644editdlrm
cSHAKE256.py22020644editdlrm
cSHAKE256.pyi2310644editdlrm
HMAC.py70240644editdlrm
HMAC.pyi6240644editdlrm
KangarooTwelve.py90290644editdlrm
KangarooTwelve.pyi5720644editdlrm
keccak.py75430644editdlrm
keccak.pyi7410644editdlrm
KMAC128.py59490644editdlrm
KMAC128.pyi9030644editdlrm
KMAC256.py29060644editdlrm
KMAC256.pyi2260644editdlrm
MD2.py61110644editdlrm
MD2.pyi4920644editdlrm
MD4.py65820644editdlrm
MD4.pyi5320644editdlrm
MD5.py66180644editdlrm
MD5.pyi4920644editdlrm
Poly1305.py80740644editdlrm
Poly1305.pyi6650644editdlrm
RIPEMD.py11990644editdlrm
RIPEMD.pyi940644editdlrm
RIPEMD160.py63980644editdlrm
RIPEMD160.pyi5160644editdlrm
SHA.py11480644editdlrm
SHA.pyi1610644editdlrm
SHA1.py66900644editdlrm
SHA1.pyi5360644editdlrm
SHA3_224.py61790644editdlrm
SHA3_224.pyi6050644editdlrm
SHA3_256.py61790644editdlrm
SHA3_256.pyi6050644editdlrm
SHA3_384.py62740644editdlrm
SHA3_384.pyi6050644editdlrm
SHA3_512.py61310644editdlrm
SHA3_512.pyi6050644editdlrm
SHA224.py69010644editdlrm
SHA224.pyi5440644editdlrm
SHA256.py68970644editdlrm
SHA256.pyi6120644editdlrm
SHA384.py68990644editdlrm
SHA384.pyi5440644editdlrm
SHA512.py77200644editdlrm
SHA512.pyi6220644editdlrm
SHAKE128.py47610644editdlrm
SHAKE128.pyi4370644editdlrm
SHAKE256.py47620644editdlrm
SHAKE256.pyi4370644editdlrm
TupleHash128.py47200644editdlrm
TupleHash128.pyi6520644editdlrm
TupleHash256.py29100644editdlrm
TupleHash256.pyi1440644editdlrm
_BLAKE2b.abi3.so161280755editdlrm
_BLAKE2s.abi3.so161280755editdlrm
_ghash_clmul.abi3.so159520755editdlrm
_ghash_portable.abi3.so158560755editdlrm
_keccak.abi3.so205120755editdlrm
_MD2.abi3.so161760755editdlrm
_MD4.abi3.so162160755editdlrm
_MD5.abi3.so163280755editdlrm
_poly1305.abi3.so163200755editdlrm
_RIPEMD160.abi3.so202400755editdlrm
_SHA1.abi3.so204240755editdlrm
_SHA224.abi3.so245440755editdlrm
_SHA256.abi3.so245440755editdlrm
_SHA384.abi3.so286480755editdlrm
_SHA512.abi3.so286800755editdlrm
__init__.py12390644editdlrm
__init__.pyi00644editdlrm
Edit: /opt/imunify360/venv/lib/python3.11/site-packages/Crypto/Hash/KangarooTwelve.py (9029B)
# =================================================================== # # Copyright (c) 2021, Legrandin # All rights reserved. # # Redistribution and use in source and binary forms, with or without # modification, are permitted provided that the following conditions # are met: # # 1. Redistributions of source code must retain the above copyright # notice, this list of conditions and the following disclaimer. # 2. Redistributions in binary form must reproduce the above copyright # notice, this list of conditions and the following disclaimer in # the documentation and/or other materials provided with the # distribution. # # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS # "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT # LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS # FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE # COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, # INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, # BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; # LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER # CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT # LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN # ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE # POSSIBILITY OF SUCH DAMAGE. # =================================================================== from Crypto.Util._raw_api import (VoidPointer, SmartPointer, create_string_buffer, get_raw_buffer, c_size_t, c_uint8_ptr, c_ubyte) from Crypto.Util.number import long_to_bytes from Crypto.Util.py3compat import bchr from .keccak import _raw_keccak_lib def _length_encode(x): if x == 0: return b'\x00' S = long_to_bytes(x) return S + bchr(len(S)) # Possible states for a KangarooTwelve instance, which depend on the amount of data processed so far. SHORT_MSG = 1 # Still within the first 8192 bytes, but it is not certain we will exceed them. LONG_MSG_S0 = 2 # Still within the first 8192 bytes, and it is certain we will exceed them. LONG_MSG_SX = 3 # Beyond the first 8192 bytes. SQUEEZING = 4 # No more data to process. class K12_XOF(object): """A KangarooTwelve hash object. Do not instantiate directly. Use the :func:`new` function. """ def __init__(self, data, custom): if custom == None: custom = b'' self._custom = custom + _length_encode(len(custom)) self._state = SHORT_MSG self._padding = None # Final padding is only decided in read() # Internal hash that consumes FinalNode self._hash1 = self._create_keccak() self._length1 = 0 # Internal hash that produces CV_i (reset each time) self._hash2 = None self._length2 = 0 # Incremented by one for each 8192-byte block self._ctr = 0 if data: self.update(data) def _create_keccak(self): state = VoidPointer() result = _raw_keccak_lib.keccak_init(state.address_of(), c_size_t(32), # 32 bytes of capacity (256 bits) c_ubyte(12)) # Reduced number of rounds if result: raise ValueError("Error %d while instantiating KangarooTwelve" % result) return SmartPointer(state.get(), _raw_keccak_lib.keccak_destroy) def _update(self, data, hash_obj): result = _raw_keccak_lib.keccak_absorb(hash_obj.get(), c_uint8_ptr(data), c_size_t(len(data))) if result: raise ValueError("Error %d while updating KangarooTwelve state" % result) def _squeeze(self, hash_obj, length, padding): bfr = create_string_buffer(length) result = _raw_keccak_lib.keccak_squeeze(hash_obj.get(), bfr, c_size_t(length), c_ubyte(padding)) if result: raise ValueError("Error %d while extracting from KangarooTwelve" % result) return get_raw_buffer(bfr) def _reset(self, hash_obj): result = _raw_keccak_lib.keccak_reset(hash_obj.get()) if result: raise ValueError("Error %d while resetting KangarooTwelve state" % result) def update(self, data): """Hash the next piece of data. .. note:: For better performance, submit chunks with a length multiple of 8192 bytes. Args: data (byte string/byte array/memoryview): The next chunk of the message to hash. """ if self._state == SQUEEZING: raise TypeError("You cannot call 'update' after the first 'read'") if self._state == SHORT_MSG: next_length = self._length1 + len(data) if next_length + len(self._custom) <= 8192: self._length1 = next_length self._update(data, self._hash1) return self # Switch to tree hashing self._state = LONG_MSG_S0 if self._state == LONG_MSG_S0: data_mem = memoryview(data) assert(self._length1 < 8192) dtc = min(len(data), 8192 - self._length1) self._update(data_mem[:dtc], self._hash1) self._length1 += dtc if self._length1 < 8192: return self # Finish hashing S_0 and start S_1 assert(self._length1 == 8192) divider = b'\x03' + b'\x00' * 7 self._update(divider, self._hash1) self._length1 += 8 self._hash2 = self._create_keccak() self._length2 = 0 self._ctr = 1 self._state = LONG_MSG_SX return self.update(data_mem[dtc:]) # LONG_MSG_SX assert(self._state == LONG_MSG_SX) index = 0 len_data = len(data) # All iteractions could actually run in parallel data_mem = memoryview(data) while index < len_data: new_index = min(index + 8192 - self._length2, len_data) self._update(data_mem[index:new_index], self._hash2) self._length2 += new_index - index index = new_index if self._length2 == 8192: cv_i = self._squeeze(self._hash2, 32, 0x0B) self._update(cv_i, self._hash1) self._length1 += 32 self._reset(self._hash2) self._length2 = 0 self._ctr += 1 return self def read(self, length): """ Produce more bytes of the digest. .. note:: You cannot use :meth:`update` anymore after the first call to :meth:`read`. Args: length (integer): the amount of bytes this method must return :return: the next piece of XOF output (of the given length) :rtype: byte string """ custom_was_consumed = False if self._state == SHORT_MSG: self._update(self._custom, self._hash1) self._padding = 0x07 self._state = SQUEEZING if self._state == LONG_MSG_S0: self.update(self._custom) custom_was_consumed = True assert(self._state == LONG_MSG_SX) if self._state == LONG_MSG_SX: if not custom_was_consumed: self.update(self._custom) # Is there still some leftover data in hash2? if self._length2 > 0: cv_i = self._squeeze(self._hash2, 32, 0x0B) self._update(cv_i, self._hash1) self._length1 += 32 self._reset(self._hash2) self._length2 = 0 self._ctr += 1 trailer = _length_encode(self._ctr - 1) + b'\xFF\xFF' self._update(trailer, self._hash1) self._padding = 0x06 self._state = SQUEEZING return self._squeeze(self._hash1, length, self._padding) def new(self, data=None, custom=b''): return type(self)(data, custom) def new(data=None, custom=None): """Return a fresh instance of a KangarooTwelve object. Args: data (bytes/bytearray/memoryview): Optional. The very first chunk of the message to hash. It is equivalent to an early call to :meth:`update`. custom (bytes): Optional. A customization byte string. :Return: A :class:`K12_XOF` object """ return K12_XOF(data, custom)