Last modified: 2020-12-26
Abstract
Keywords
References
1.Abadi M., Rogaway P. "Reconciling two views of cryptography (the computational soundness of formal encryption)" Journal of Cryptology, 2002; 15(2): 103-127.
2.Backes M. , Pitzmann B, Waidner M. "Secure Asynchronous Reactive Systems Cryptology ePrint Archive, Report 2004/082.
3.Dolev D., Yao A. "On the security of public key protocols". IEEE Transaction on Information Theory, 1983; 29(2): 198-208.
4.Joye M. , Quisquater J. "Cryptanalysis of RSA-type cryptosystems: a visit". Network Threats, DIMACS Series in Discr. Math. ant Th. Comp. Sci., AMS, 1998, pp. 21-31.
5.Koyama Maurer U.M., Okamoto T., Vanstone S.A. "New public-key schemes based on elliptic curves over the ring Zn". In: Feigenbaum J. (ed) Advance in Cryptology - Crypto '91. Springer-Verlag, 1991, pp. 252-266 (Lectures Notes in Computer Science vol. 576).
6.Meadows C. "Formal Methods for Cryptographic Protocol Analysis: Emerging Issues and Trends" IEEE Journal on Selected Areas in Communication, 2003; 21(1 44-45.
7.Mikhailov A.S. "Distributed Information System to Analyze Security Protocols". In: Proc. of the Workshop on Computer Science and Information Technologies (CSIT'2005), Vol. 1. USATU, Ufa, Russia, 2005, pp. 215-218.
8.Moore J. H. "Protocol failures in cryptosystems". IEEE Transaction on Information Theory, vol. 5 T-76, pp. 594-602, 1988
9.Rivest R., Shamir, A., Adleman L. "A method for obtaining digital signatures and public-key cryptosystems". Communications of the ACM, 1978; 21 (2): 120-126.
10.Simmons G.J. "A 'weak' privacy protocol using the RSA crypto algorithm". Cryptologia, 1983; 7(2): 180-182.