{"references": ["Hugo Fruehauf , \"Encryption Fundamentals,\" in Zyfers, October 2001.", "W. Mao, \"Modern Cryptography Theory and Practice (Book style).,\"\nPrentice Hall PTR July 25.", "W. Stallings, \"Cryptography and Network Security Principles and\nPractices,\" Fourth Edition, Prentice Hall, November 16, 2005.", "N. Torri, K. Yokoyama, \"Elliptic Curve Cryptosystems,\" Fujtsu Sci.\nTech. J. pp. 140-146, December 2002.", "W. M. Daley, \"Specifications for the data encryption standard (DES),\"\nFIPS PUB 46-3, Federal information processing standards publication,\nReaffirmed, October25th, 1999.", "R. Zuccherato, \"Practical Cryptology and Web Security,\" Entrust, May\n9, 2000.", "Pk Yuen, \"Elliptic Curve Cryptography Support in Entrust,\" Pearson\nEducation Limited 2006.", "D. Hankerson, Menezes. A, Vanstone S., \"Guide to Elliptic Curve\nCryptography,\" Springer, (c) 2004, Springer-Verlag New York, Inc.", "Matthew England, \"The Weierstrass Theory For Elliptic Functions,\"\nDepartment of Mathematics, MACS Heriot Watt University, Edinburgh,\nThe Burn 2007."]}

It is known that symmetric encryption algorithms are fast and easy to implement in hardware. Also elliptic curves have proved to be a good choice for building encryption system. Although most of the symmetric systems have been broken, we can create a hybrid system that has the same properties of the symmetric encryption systems and in the same time, it has the strength of elliptic curves in encryption. As DES algorithm is considered the core of all successive symmetric encryption systems, we modified DES using elliptic curves and built a new DES algorithm that is hard to be broken and will be the core for all other symmetric systems.