摘要: We consider the use of genetic algorithms (GAs) as powerful tools in breaking cryptographic systems. show that GAs can greatly facilitate cryptanalysis by efficiently searching large keyspaces, and demonstrate their with GENALYST, an order-based GA for a classic system.