bslathi19/crypto
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Make modular mult work

Browse Source
This commit is contained in:
Byron Lathi
2025-10-28 21:59:28 -07:00
parent ad257f4220
commit d6a062baa0
3 changed files with 16 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
ChaCha20_Poly1305_64/sim/modulo_theory.py
View File

@@ -57,10 +57,6 @@ def friendly_modular_mult(value_a: int, value_b: int) -> int:
mods = [friendly_modulo(prod, 26*i) for i, prod in enumerate(prods)]
if sum(mods) >= 2*PRIME:
print("Saw greater than 2x prime!!!")
mod_sum = friendly_modulo(sum(mods), 0)
return mod_sum

6
ChaCha20_Poly1305_64/sim/poly1305_friendly_modular_mult.py
View File

@@ -8,6 +8,8 @@ from cocotb.queue import Queue
from cocotbext.axi import AxiStreamBus, AxiStreamSource
from modulo_theory import friendly_modular_mult
import random
PRIME = 2**130-5
@@ -48,7 +50,7 @@ class TB:
async def write_input(self, data: int, h: int):
await self.input_queue.put((data, h))
await self.expected_queue.put((data * h) % PRIME)
await self.expected_queue.put(friendly_modular_mult(h, data))
async def run_input(self):
while True:
@@ -76,7 +78,7 @@ async def test_sanity(dut):
await tb.cycle_reset()
count = 1
count = 16
for _ in range(count):
await tb.write_input(random.randint(1,2**128-1), random.randint(0, 2**130-6))