Conversation

Notices

1. Embed this notice
   ✧✦Catherine✦✧ (whitequark@mastodon.social)'s status on Saturday, 27-Dec-2025 18:51:44 JST ✧✦Catherine✦✧

   i don't think cryptographers should be allowed to write cryptographic specifications

   i understand that this is very precise but if you're trying to implement the algorithm it adds _so_ much overhead

   • Embed this notice
     ✧✦Catherine✦✧ (whitequark@mastodon.social)'s status on Saturday, 27-Dec-2025 18:54:37 JST ✧✦Catherine✦✧

     in reply to

     this is an xor operation described as "constant addition", right

   • Embed this notice
     ✧✦Catherine✦✧ (whitequark@mastodon.social)'s status on Saturday, 27-Dec-2025 18:56:24 JST ✧✦Catherine✦✧

     in reply to

     is the and operation implicit

     what is the operation precedence here

   • Embed this notice
     ✧✦Catherine✦✧ (whitequark@mastodon.social)'s status on Saturday, 27-Dec-2025 19:00:36 JST ✧✦Catherine✦✧

     in reply to

     • Lesley Lai

     @lesley it took me several years to grasp the PL research notation, but at least there it adds actual value

     the Ascon spec feels like it's written to be obscure. the algorithm is very simple, it's just described in a crackhead manner

   • Embed this notice
     Lesley Lai (lesley@mastodon.gamedev.place)'s status on Saturday, 27-Dec-2025 19:00:38 JST Lesley Lai

     in reply to

     @whitequark Reminds me of PL research with its arcane notation involving a lot of Γ, ∆, ⊢, and τ.

     Also reminds me of this video: https://youtu.be/33y9FMIvcWY?si=FjgQDjaKryIvyQUu

   • Embed this notice
     ✧✦Catherine✦✧ (whitequark@mastodon.social)'s status on Saturday, 27-Dec-2025 19:06:12 JST ✧✦Catherine✦✧

     in reply to

     what would possess someone to describe xor with a 8-bit number as a 64-bit addition

   • Embed this notice
     ✧✦Catherine✦✧ (whitequark@mastodon.social)'s status on Saturday, 27-Dec-2025 19:13:48 JST ✧✦Catherine✦✧

     in reply to

     this is going to be implemented in a programming language. copied from a pdf and symbols replaced

     omitting multiplication operators, while natural from a math point of view, makes this _so_ much more painful

   • Embed this notice
     Shiny Quagsire (shinyquagsire@mastodon.social)'s status on Saturday, 27-Dec-2025 19:16:18 JST Shiny Quagsire

     in reply to

     @whitequark honestly seems more like the kind of thing that would end up in some "is this primitive turing complete" ML paper

   • Embed this notice
     ✧✦Catherine✦✧ (whitequark@mastodon.social)'s status on Saturday, 27-Dec-2025 20:49:14 JST ✧✦Catherine✦✧

     in reply to

     cryptographers: addition is +, xor is ⊕

     same cryptographers: now we're gonna use the word "addition" for xor

     it's not that i'm missing something, this paper is just poorly written

   • Embed this notice
     ✧✦Catherine✦✧ (whitequark@mastodon.social)'s status on Saturday, 27-Dec-2025 20:49:20 JST ✧✦Catherine✦✧

     in reply to

     also they don't specify the endianness of concatenation. why is it pointlessly verbose where it doesn't matter, and not verbose enough where it does