Reputation
26,409
Next tag badge:
411/400 score
78/80 answers
Badges
2 36 109
Newest
 Revival
Impact
~394k people reached

Jun
21
wiki created chacha description
Jun
21
wiki created chacha excerpt
Jun
21
asked Collision or second preimage for the Chacha core?
Jun
21
revised Which one is fastest? Karatsuba or Montgomery multiplication?
better typo
Jun
21
revised Which one is fastest? Karatsuba or Montgomery multiplication?
deleted 3 characters in body
Jun
21
revised Which one is fastest? Karatsuba or Montgomery multiplication?
polish
Jun
21
revised Which one is fastest? Karatsuba or Montgomery multiplication?
polish
Jun
21
revised Which one is fastest? Karatsuba or Montgomery multiplication?
Add intro to this (now oversized) answer
Jun
21
revised Which one is fastest? Karatsuba or Montgomery multiplication?
Greatly expand, towards quantitatively assessing the benefits of each method.
Jun
21
revised Which one is fastest? Karatsuba or Montgomery multiplication?
improve typo, expression
Jun
19
comment Device intercommunication with commands
Do you have two-way communication allowing a challenge-response protocol? Or a common variable reference (like a real-time clock assumed about correctly setup on both sides)? If not, do you have permanent re-writable memory (like EEPROM or battery-backed RAM, or a significant amount of Flash) on both sides? If not (or want to keep things simple), are you OK with being vulnerable to replay of former commands following a power-cycle of the controlled device?
Jun
19
comment A mathematical explanation of the DES encryption system
@esushi: +1 for the nice $\TeX$; I previously did not realize \newcommand was supported.
Jun
19
comment Concerns about use of MAC in my specification
The common cheat of using IV=0 cuts a corner on security. As example: assuming this and AES-128 in CTR mode, an adversary knowing a full block of plaintext at a fixed location in each message can test, with a single AES-128 encryption followed by a hash-table search, if a given key was used in any of the intercepted messages, which would not be possible with random IV. A match would allow to decipher one full message; that's a speed-up of some few orders of magnitude over brute force (likely not making the attack practical, especially compared to password enumeration).
Jun
19
revised Concerns about use of MAC in my specification
polish
Jun
19
revised Concerns about use of MAC in my specification
Expand what previously was a comment to the question
Jun
18
answered Concerns about use of MAC in my specification
Jun
18
revised What are the differences between collision attack and birthday attack?
remove excess fat
Jun
18
answered What are the differences between collision attack and birthday attack?
Jun
18
comment Voting protocol - How many dishonest tallying centres can the protocol cope with?
Addition: the original source of the protocol is Nigel Smart's freely available Cryptography, An Introduction, with the protocol here. $\;$ Hint: the protocol uses Shamir's Secret Sharing in $t$-out-of-$n$ mode, which ensures that the correct tally can be obtained from the data published by any $t$ correctly-behaving tallying centers, where $t$ is a parameter less than the number $n$ of tallying centers.
Jun
17
comment An electronic voting system
@Mary Star: I did some level-1 spell-check. Nothing immediately struck me as obviously wrong. Sorry I have no time to do more within the next days, like explaining the algebra (the easy part is to show that if everyone is honest, the equations are met; I don't think a correct argument can be made that if anyone without super-polynomial computing power cheats, that's detectable, if you account for real-life threats including rigged hardware). Good luck for your exposé. $\;$ I do suggest that you make a step aside, and wonder if all that is desirable in the world we live in.