Elliptic curve cryptography is one of the most important public-key cryptography. The Koblitz Curve is a special kind of elliptic curve in ECC and its security mainly depends on the base field. Based on Evolutionary Cryptography theory, which becomes a principal concept for cryptogra-phy design and cryptanalysis, we propose a new al-gorithm for secure EC generation based on Ant Col-ony Optimization (ACO) to accelerate the search process of safe base field. We preliminarily deal with secure Koblitz curve selecting over the field F (2800). Experiments show that the base field and base point of secure curves generated by ant colony algorithm have gone beyond the parameter range of Koblitz curves recommended by NIST. We can present many new secure Koblitz curves, including base field and base point, which are not recommen-ded by NIST. The maximum size of our secure Koblitz curve has gone beyond 700bit. The algo-rithm in this paper follows the same cryptography criteria recommended by the ANSI. So, it can resist current attacks. Theoretical analysis and experimen-tal results prove that the new algorithm is effective and successful, and it is the first successful prac-tice of Evolutionary Cryptography theory in public cryptography research.