N0x90

N0x90

Years ago i worte keccak_ex with only support for hash 256

Now I completed the support for hash 512 and 128 bytes

The “problem”
Both implementation are the same ( :upside_down_face: copy and paste) and just change

for hash 256

  @digest_length 32

  @block_length 200 - 2 * @digest_length

for hash 512

  @digest_length 64

  @block_length 200 - 2 * @digest_length

i thik something like an “interface/inheritance” can help with all the duplicated code making an isolation with the concret type but i cant find anything like that

the other problematic line is

defp process_block_decode_loop(%__MODULE__{} = value, index) when index < @block_length do

because you need the block_length to make the loop work…

i appretiate any idea/insight/suggestion to make the code looks better and to learn a better way

Showing Posts 1 to 4

cevado

cevado

if i understood it correctly the struct that you’re using seems to be an internal abstraction. so why not internalize the digest_length and the block_length in the struct, this way you can always have it available on the function head by just destructing it and keep the same guard validations.

al2o3cr

al2o3cr

Are you sure you got all the references? This take(134) seems extremely suspicious - it’s two less than @block_length for @digest_length == 32 in 256-bit, but not changed for 512-bit where @digest_length is different.

https://github.com/N-0x90/keccak_ex/blob/master/lib/hash/hash512.ex#L86

N0x90

N0x90 OP

Your right!!! also that pointed me to an edge case…

The correct version is:

  defp padding(%__MODULE__{} = value) do
    fix = if (value.input_length + 1) == byte_size(value.buffer) do
      value.buffer
      |> binary_part(0, value.input_length)
      |> set_value(<<0x81>>)
N0x90

N0x90 OP

Nice one, already applied, thanks!!!

— All posts loaded —

Where Next? Top

Trending in Questions Top

RSP87
I’m working on a project that simulates the bumbl example in the programming phoenix book. It acts almost like an email client. We have a...
New
nseaSeb
Hello, I know there is an approach for handling lists that allows for optimized traversal, but I can’t recall the specific method (somet...
New
RemyXRenard
I’m seeing that a list inside a Kino.DataTable will be interpreted as a charlist, even if the Kino.configure() is set to charlists: :as_l...
New
velrest
So my question is quite simple and i have found no conclusive answer on forum, google or AI. Should we use :erlang.float for Integer to ...
New
brecabral
Documentation While reading the Scoped Routes section, I noticed that the documentation currently refers to a problem without explainin...
New
samoloth
Hi, I’ve just set up an application with ash_authentication. There is only magic link strategy for now, so there is no confirmation add o...
New
FlyingNoodle
If a change or preparation module uses Ash.Changeset.get_argument/2 or Ash.Query.get_argument/2 (or any of the other get_argument functio...
New

Other Trending Topics Top

mudasobwa
I am happy to introduce the very α version of the new programming language compiled to BEAM. Welcome Cure. It has literally three kille...
New
marciok
Hi there! We created Gust: A task orchestrator inspired by Airflow. For those who have never heard about Aiflow, it’s a Python-based wor...
New
jimsynz
Beam Bots (or just BB for short) is a framework for building fault-tolerant robotics applications in Elixir using familiar OTP patterns. ...
New
Dmk
Xamal is a deployment tool for Elixir apps that deploys native releases to bare metal servers over SSH. It’s a port of GitHub - basecamp/...
New
netoum
Corex is an accessible, unstyled UI component library for Phoenix that integrates Zag.js state machines using Vanilla JavaScript and Live...
New
webofbits
With AI doing more of the implementation work, I’ve been wondering how much coding I should deliberately keep doing myself. My main conc...
#ai
New

We're in Beta

About us Mission Statement

Options

Thread Display Mode




Thread Preview

Skip Thread Previews