I would like to know if there exists any algorithms to evaluate the cardinality of a keyspace containing only random keys ( given that the keys are tested for randomness by a statiscal test suite such as Diehard or Nist). Such algorithm would accept as arguments the keylength and the test parameters and return the cardinality of the corresponding keyspace.
Aucun commentaire:
Enregistrer un commentaire