Re:Sqids – Generate Short Unique IDs from Numbers
by pixel8account on Sunday November 26, 2023 @06:25AM
(#38420822)
>The idea is that the secret key material is never compromised as it is assumed in all security cases.
That's not true, we have (perfect) forward secrecy, backwards secrecy and key rotation mechanisms because we often care what happened after the key is inevitably compromised. In this case the problem makes it hard to "rotate" the keys in a meaningful way, but I'm yet to see a proof it's impossible.
Re:Sqids – Generate Short Unique IDs from Numbers
by wslh on Sunday November 26, 2023 @07:08AM
(#38421013)
I think we are talking about different things here or the conversation is not clear.
The assertion you mentioned is the "what" assumption while what you said is the "how" we came to that assertion. Most probably you take my word idea in a specific sense other than I wanted to use. My answer was informal because we are here in HN and not writing a paper.
1/ You don't have duplicates because a Feistel network assures you there is no duplicates: every input has a different output with a fixed key in every round.
2/ If the secret is compromised anyone can issue valid numbers in the same way that if your secret encryption keys for encrypting your data exposes it. The idea is that the secret key material is never compromised as it is assumed in all security cases. You should custody with the right measures based on the attack vectors you have. The custody of secrets is independent of this method.
Please let me know if you have more questions.