Skip to content

feat: swap endianness in-place in keccak implementation #6128

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
TomAFrench merged 6 commits into from
Sep 23, 2024
Merged

feat: swap endianness in-place in keccak implementation #6128

Changes from 2 commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
4c3b013
feat: remove unnecessary array allocation in keccak impl
TomAFrench Sep 23, 2024
23ecb2a
.
TomAFrench Sep 23, 2024
a1a7906
chore: improve naming and remove magic 7
TomAFrench Sep 23, 2024
432dd06
chore: use new naming consistently
TomAFrench Sep 23, 2024
10b9c7b
chore: merge for-loops
TomAFrench Sep 23, 2024
3efd419
chore: remove reordering of bytes
TomAFrench Sep 23, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 4 additions & 6 deletions noir_stdlib/src/hash/keccak.nr
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -39,13 +39,11 @@ pub(crate) fn keccak256<let N: u32>(input: [u8; N], message_size: u32) -> [u8; 3
// means we need to swap our byte ordering
let num_limbs = max_blocks * LIMBS_PER_BLOCK; //max_blocks_length / WORD_SIZE;
for i in 0..num_limbs {
let mut temp = [0; WORD_SIZE];
let word_size_times_i = WORD_SIZE * i;
for j in 0..WORD_SIZE {
temp[j] = block_bytes[word_size_times_i+j];
}
for j in 0..WORD_SIZE {
block_bytes[word_size_times_i + j] = temp[7 - j];
for j in 0..WORD_SIZE / 2 {
let temp = block_bytes[word_size_times_i + 7 - j];
block_bytes[word_size_times_i + 7 - j] = block_bytes[word_size_times_i+j];
block_bytes[word_size_times_i + j] = temp;
}
}

Expand Down