notes/archive/Auburn Ask.md

Date: 1/23/25

1. One of our original asks was: How many key-selection observations are required to crack an nKode under a given policy configuration?
   1. Now that I've written the code, we need them to validate its accuracy.
   2. Our new ask should be:
      1. We've developed a simulation to answer: How many key-selection observations are required to crack an nKode under a given policy configuration? Our new ask is, please provide your Github handles so Donovan can add you to the repository.
2. Another ask is:
   1. How many observations are required to execute a reentrancy attack on an nKode under a given policy configuration?
3. Validate the nKode cipher.