Instantly share code, notes, and snippets.

# Steve Thomas Sc00bz

Created March 4, 2023 02:17
"z[] += x[] * y" with ADX instruction set *untested*
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 # Related to https://abyssdomain.expert/@filippo/109925743627302756 # // len(z) == len(x)... or len(z) <= len(x) and everything is based on len(z) # // z[] += x[] * y # // c = overflow (ie c is "z[len(z)]") # func addMulVVW(z, x []uint, y uint) (c uint) # { lea RSI,[x] # RSI = "&x" lea RDI,[z] # RDI = "&z"
Last active May 6, 2023 10:32
Double BS-SPEKE is an doubly augmented PAKE
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 Double BS-SPEKE Double BS-SPEKE is BS-SPEKE but with 3DH vs Noise-KN to make it a doubly augmented PAKE. Double BS-SPEKE is the best doubly augmented PAKE that I know of. Only problem is there are no proofs, but it's not hard to take the SPEKE proof, add the OPAQUE proof for OPRF, and it's obvious that the doubly augmented change makes it doubly augmented. So if anyone knows how to formally state that in a proof, that would be awesome to have. BS-SPEKE defined on multiplicative groups can be found here: https://gist.github.com/Sc00bz/ec1f5fcfd18533bf0d6bf31d1211d4b4
Created April 9, 2022 04:42
Broken Python: bytearray(), Process(), and Queue() don't like each other
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 # Prints "done" 4 times then doesn't exit ~50% of the time. from multiprocessing import Process, Queue def f(q): while 1: try: data = q.get(False) except: break
Created March 17, 2022 16:09
HMAC-SHA1 Collision
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters

Last active April 24, 2023 10:50
BS-SPEKE is an augmented PAKE and defined on multiplicative groups
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 BS-SPEKE (defined on multiplicative groups) BS-SPEKE is a modified B-SPEKE with blind salt (OPRF). Modified B-SPEKE is a similar change from SPEKE as from SPAKE2 to SPAKE2+ to make it augmented. Doing this saves a scalar point multiply vs original B-SPEKE with blind salt. BS-SPEKE is the best augmented PAKE that I know of. Only problem is there are no proofs, but it's not hard to take the SPEKE proof, add the OPAQUE proof for OPRF, and it's obvious that the augmented change makes it augmented. So if anyone knows how to formally state that in a proof, that would be awesome to have. BS-SPEKE defined on ECC can be found here:
Last active January 31, 2023 16:16
CPace is a balanced PAKE and defined on multiplicative groups
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 CPace (defined on multiplicative groups) CPace is the best balanced PAKE that I know of. CPace defined on ECC can be found here: https://gist.github.com/Sc00bz/545eb39a369b67242634bd9c3302627c Costs per step A: - *^^ B: *^ ^
Last active October 8, 2021 18:31
SRP6b is an augmented PAKE
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 SRP is deprecated. Use BS-SPEKE defined on multiplicative groups: https://gist.github.com/Sc00bz/ec1f5fcfd18533bf0d6bf31d1211d4b4 Or better BS-SPEKE defined on ECC: https://gist.github.com/Sc00bz/e99e48a6008eef10a59d5ec7b4d87af3 --------
Created February 2, 2020 19:42
AuCPace is an augmented PAKE
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 AuCPace AuCPace with blind salt (OPRF) is the best augmented PAKE that I know of that comes with a proof. Costs per step C: H*i fffI*i*iH**[ii] S: f*iH***[iii] f*i *: Scalar point multiply
Last active October 8, 2021 17:20
CPace is a balanced PAKE
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 CPace CPace is the best balanced PAKE that I know of. CPace defined on multiplicative groups can be found here: https://gist.github.com/Sc00bz/1375a5dc7d1e8a1ffdfb789d3f4c6593 Costs per step A: - fH**[ii] B: H*i f*i
Last active December 24, 2019 15:42
Ed25519 optimization that really only helps with embedded processors
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode characters
 Awhile ago I found this pointless optimization for Ed25519 because it only saves a few multiples. Also it doesn't help much unless you're on a 32bit or 8bit processor then it kinda helps, but since you do 4x more doubles than adds it really isn't noticeable. Also you can precalculate T*(2*-121665/121666) so it only helps on the initial 3 adds when building 1*P, 2*P, 3*P, ... 8*P. If you store 60833*(Y-X), 60833*(Y+X), 121666*Z, 121665*T then it's a little less work than storing Y-X, Y+X, 2*Z, k*T. Well this really only helps if you are on an embedded processor and don't have the RAM to build the 1*P, 2*P, 3*P, ... 8*P lookup table. So it's not completely pointless. This is from the Explicit-Formulas Database with d = -121665/121666