Functional correctness proofs of encryption algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3835 LNAI, Issue , 2005, Pages 519-533

  Duan, Jianjun ^a   Hurd, Joe ^b   Li, Guodong ^a   Owens, Scott ^a   Slind, Konrad ^a   Zhang, Junxing ^a  

^a Department of Electrical and Computer Engineering   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CIPHERS; ENCRYPTION ALGORITHMS; POLYTYPIC ENCODING; SYMBOLIC EVALUATION;

ALGORITHMS; DATA REDUCTION; ENCODING (SYMBOLS); FORMAL LOGIC; THEOREM PROVING;

CRYPTOGRAPHY;

EID: 33745433697     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_36     Document Type: Conference Paper

References (23)

1. R. Anderson, E. Biham, and L. Knudsen, Serpent: A proposal for the advanced encryption standard, Available at http://www.cl.cam.ac.uk/-rja4/ serpent.html, August 1998.
2. A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.C. He, M. Rusinowitch, J. Santiago, M. Turuani, L. Vigano, and L. Vigneron, The Avispa tool for the automated validation of internet security protocols and applications, Proceedings of Computer Aided Verification (CAV), Springer LNCS, no. 3576, 2005.
3. Michael Backes, Birgit Pfitzmann, and Michael Waidner, Symmetric authentication in a simulatable Dolev- Yao style cryptographic library, Journal of Information Security 4 (2005), no. 3, 135-154.
4. C. Burwick, D. Coppersmith, E. D'Avignon, R. Gennaro, S. Halevi, C. Jutla, S. Mathas Jr., L. O'Connor, M. Peyravian, D. Safford, and N. Zunic, MARS-a candidate cipher for AES, Available at http://www.research.ibm.com/ security/mars.pdf, September 1999.
5. Joan Daemen and Vincent Rijmen, The design of Rijndael: AES - the Advanced Encryption Standard, Information Security and Cryptography, no. 17, Springer-Verlag, 2002.
6. Morris Dworkin, Recommendation for block cipher modes of operation: Methods and techniques, Tech. Report SP 800-38A, National Institute of Standards and Technology, 2001.
7. M. Gordon, J. Iyoda, S. Owens, and K. Slind, Automatic formal synthesis of hardware from higher order logic, Proceedings of Fifth International Workshop on Automated Verification of Critical Systems (AVoCS), ENTCS, 2005, to appear.
8. X. Lai, J.L. Massey, and S. Murphy, Markov ciphers and differential cryptanalysis, Advances in Cryptology - Eurocrypt '91 (Donald W. Davies, ed.), LNCS, vol. 547, Springer Verlag, 1991, pp. 17-38.
9. Jeff Lewis, Cryptol, a domain specific language for cryptography, Tech. report, Galois Connections Inc., 2002, URL-http://www.cryptol.net/docs/ CryptolPaper.pdf.
10. John Matthews, Recursive definition over coinductive types, Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'99) (Nice) (Y. Bertot, G. Dowek, A. Hirschowitz, G. Paulin, and L. Thery, eds.), LNCS, no. 1690, Springer-Verlag, 1999.
11. Lambert Meertens, Calculate polytypicallyl, Proc. 8th Int. Symp. on Programming Languages: Implementations, Logics, and Programs, PLILP'96 (H. Kuchen and S.D. Swiestra, eds.), vol. 1140, Springer-Verlag, Berlin, 1996, pp. 1-16.
12. Michael Norrish and Konrad Slind, HOL-4 manuals, 1998-2005, Available at http://hoi.sourceforge.net/.
13. United States National Institute of Standards and Technology, Advanced Encryption Standard, Web: http://csrc.nist.gov/encryption/aes/, 2001.
14. R.Boyer and J Moore, Proof checking the RSA public key encryption algorithm, American Mathematical Monthly 91 (1984), no. 3, 181-189.
15. R. Rivest, M. Robshae, R. Sidney, and Y.L. Yin, The RC6 block cipher, Available at http://www.rsasecurity.com/rsalabs/rc6, August 1998.
16. B. Schneier, J. Kelsey, D. Whiting, D. Wagner, C. Hall, and N. Ferguson, The Twofish encryption algorithm, John Wiley and Sons, 2003.
17. Konrad Slind, A verification of Rijndael in HOL, Supplementary Proceedings of TPHOLs 2002 (V. A Carreno, C. A. Munoz, and S. Tahar, eds.), NASA Conference Proceedings, no. CP-2002-211736, August 2002.
18. Konrad Slind and Joe Kurd, Applications of polytypism in theorem proving, Theorem Proving in Higher Order Logics, 16th International Conference, TPHOLs 2003, Rome, Italy, Proceedings (D. Basin and B. Wolff, eds.), Lecture Notes in Computer Science, vol. 2758, Springer, September 2003, pp. 103-119.
19. Laurent Thery, Formalizing Huffman's algorithm, Tech. Report TRCS 034/2004, Department of Informatics, University of Acquila, 2004.
20. Diana Toma and Dominique Borrione, Formal verification of a SHA-1 circuit core using ACL2, Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs'05 (Joe Kurd and Tom Melham, eds.), Lecture Notes in Computer Science, vol. 3603, Springer-Verlag, August 2005, pp. 326-341.
21. Phil Wadler, Monads for functional programming, Marktoberdorf Summer School on Progam Design Calculi (M. Broy, ed.), NATO ASI Series F: Computer and Systems Sciences, vol. 118, Springer-Verlag, 1992.
22. David Wheeler and Roger Needham, TEA, a tiny encryption algorithm, Fast Software Encryption: Second International Workshop, Lecture Notes in Computer Science, vol. 1008, Springer Verlag, 1999, pp. 363-366.
23. Junxing Zhang and Konrad Slind, Verification of Euclid's algorithm for finding multiplicative inverses, Emerging Trends: Theorem Proving in Higher Order Logics: 18th International Conference, TPHOLs 2005 (Joe Kurd, ed.), 2005.