Score:0

What percentage of the keyspace should be brute-forced to find an equivalent key if the block cipher has?

pf flag

I have been reading the Hasty Pudding Cipher specification and the author make clear that the cipher has some equivalent keys if the keyspace is larger than 8192-bits:

Two keys are equivalent if they expand to the same key-expansion
table.  The likelihood is negligible for keys of size < 1/2 the
key-expansion table size, 8192 bits.  For keys longer than this, some
will be equivalent, but there is no feasible way to discover an
equivalent key pair.

My question is? What percentage of keyspace of an block cipher should be brute-forced to find an equivalent key (if the cipher has equivalent keys)?

kelalaka avatar
in flag
`but there is no feasible way to discover an equivalent key pair.`. Are you asking for an answer for this?
phantomcraft avatar
pf flag
@kelalaka Yes. It's valid.
fgrieu avatar
ng flag
Is it looked at an answer independent of the block cipher (with equivalent keys), considered as a black box; or is the question geared only at HPC? In the second case, what restriction (if any) does "brute-forced" imply? Does the question boil down to: what would be the effort to discover an equivalent key pair for HPC?
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.