๐Ÿ”’๐Ÿง  "Understanding" ECDSA: Because nothing screams 'security' like a tangled mess of modular arithmetic and a cameo from Fibonacci. Who knew deciphering digital signatures required a PhD in cryptic-ology? ๐Ÿ˜‚๐Ÿ”
https://avidthinker.github.io/2025/11/28/understanding-ecdsa/ #ECDSA #Understanding #Cryptography #DigitalSignatures #ModularArithmetic #HackerNews #ngated
Understanding ECDSA - Web3 Security Blog

Exploring blockchain, math, and smart contracts through a security lens.

Terrible accident in Rome.
2 police patrol cars engaged in different crime operations, both driving at full speed and with their sirens blaring, crashed at an intersection.

Probably each driver just heard their own siren but not the other's.

So, 2 overlapping concurrent alerts summed up to none.๐Ÿค”

(It seems there could be a more general law to explain above event, but I'm not very sure what it is)

#modulararithmetic #warnings #selfalert

Solving an RPG puzzle with Julia, modular arithmetic, and linear algebra

YouTube
Modular arithmetic

Modular arithmetic is a form of arithmetic (a calculation technique involving the concepts of addition and multiplication) which is done on numbers with a defined...

Rosetta Code

I have added #ATS to the languages for which there is a solution to the #RosettaCode #ModularArithmetic task:

Modular arithmetic - Rosetta Code https://rosettacode.org/wiki/Modular_arithmetic#ATS

This task was practically tailor-made for #Ada. :) But ATS lets us easily extend the language to handle modular numbers.

#ATSlang #FunctionalProgramming #Proofs

Update: After reading the task language again, I added some more commentary, to point out what I see as a flaw in the task.

Modular arithmetic

Modular arithmetic is a form of arithmetic (a calculation technique involving the concepts of addition and multiplication) which is done on numbers with a defined...

Rosetta Code
How to decrypt c when e is not co-prime with phi(n) and e is non-prime

In RSA, I want to know a way to be able to retrieve all possible plaintexts $m$ given a ciphertext $c$, $\phi(n)$, $n$ and $e$. The decryption exponent $d$ can not be generated due to the fact that...

Cryptography Stack Exchange
Must RSA exponent and modulus be odd

I'm working on some RSA code that uses Toms Fast Math (TFM for short), and I'm trying to understand why the functions fp_exptmod (for modular exponentiation operations) and fp_invmod (for modular i...

Cryptography Stack Exchange