arnaucube/miden-crypto
1
0
Fork 0
mirror of https://github.com/arnaucube/miden-crypto.git synced 2026-01-09 15:41:30 +01:00
Code Issues Projects Releases Wiki Activity

fix: typos

Browse Source
This commit is contained in:
Bobbin Threadbare
2023-12-21 00:17:41 -08:00
parent 600feafe53
commit 499f97046d
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/hash/rescue/rpo/mod.rs
View File

@@ -117,7 +117,7 @@ impl Hasher for Rpo256 {
// if we absorbed some elements but didn't apply a permutation to them (would happen when // if we absorbed some elements but didn't apply a permutation to them (would happen when
// the number of elements is not a multiple of RATE_WIDTH), apply the RPO permutation. we // the number of elements is not a multiple of RATE_WIDTH), apply the RPO permutation. we
// don't need to apply any extra padding because the first capacity element containts a // don't need to apply any extra padding because the first capacity element contains a
// flag indicating whether the input is evenly divisible by the rate. // flag indicating whether the input is evenly divisible by the rate.
if i != 0 { if i != 0 {
state[RATE_RANGE.start + i..RATE_RANGE.end].fill(ZERO); state[RATE_RANGE.start + i..RATE_RANGE.end].fill(ZERO);

2
src/hash/rescue/rpx/mod.rs
View File

@@ -132,7 +132,7 @@ impl Hasher for Rpx256 {
// if we absorbed some elements but didn't apply a permutation to them (would happen when // if we absorbed some elements but didn't apply a permutation to them (would happen when
// the number of elements is not a multiple of RATE_WIDTH), apply the RPX permutation. we // the number of elements is not a multiple of RATE_WIDTH), apply the RPX permutation. we
// don't need to apply any extra padding because the first capacity element containts a // don't need to apply any extra padding because the first capacity element contains a
// flag indicating whether the input is evenly divisible by the rate. // flag indicating whether the input is evenly divisible by the rate.
if i != 0 { if i != 0 {
state[RATE_RANGE.start + i..RATE_RANGE.end].fill(ZERO); state[RATE_RANGE.start + i..RATE_RANGE.end].fill(ZERO);