Show description

J. ACM 50(5), 752–794 (2003) 3. : DART: directed automated random testing. In: PLDI 2005, pp. 213–223. ACM, New York (2005) 4. : An interpolating theorem prover. Theor. Comput. Sci. 345(1), 101– 121 (2005) 5. : Lazy abstraction with interpolants. B. ) CAV 2006. LNCS, vol. 4144, pp. 123–136. pt Abstract. This paper presents techniques developed to check program equivalences in the context of cryptographic software development, where specifications are typically reference implementations. The techniques allow for the integration of interactive proof techniques (required given the difficulty and generality of the results sought) in a verification infrastructure that is capable of discharging many verification conditions automatically.

Automata, Languages and Programming - C. LNCS. Springer, Heidelberg (2009) 10. : Formal modeling and quantitative analysis of KLAIM-based mobile systems. , Clausen, H. ) Applied Computing 2005. Proceedings of the 20th Annual ACM Symposium on Applied Computing, pp. 428–435, Association for Computing Machinery - ACM (2005), ISBN 1-58113964-0 11. : On a Uniform Framework for the Definition of Stochastic Process Languages. Full Version. Technical report, Consiglio Nazionale delle Ricerche, Istituto di Scienza e Tecnologie dell’Informazione ’A.

1. Block diagram of the RC4 cipher and WPA. In particular, an implementation of RC4 is provided in the pervasively used open-source library openSSL, which we selected as the case study for this paper. In cryptographic terms, RC4 is a synchronous stream cipher, which means that it is structured as two independent blocks, as shown in Figure 1. The security of the RC4 cipher resides in the strength of the key stream generator, which is initialized with a secret key SK. The key stream output is a byte1 sequence kt that approximates a perfectly random bit string, and is independent of plaintext and ciphertext.