We consider the use of genetic algorithms (GAs) as powerful tools in the breaking of cryptographic systems. We show that GAs can greatly facilitate cryptanalysis by efficiently searching large keyspaces, and demonstrate their use with GENALYST, an order-based GA for breaking a classic cryptographic system.
No takes yet. Share an insight, caveat, or question.
Robert Matthews (1993) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: