Developing a cryptosystem for XML documents
Abdelsalam Abdelhamid Almarimi, Uounis Alsahdi · 2010
This paper proposes a cryptosystem (encrypting/decryption) for XML data using RSA (Rivest, Shamir, and Adleman) with some form of shift ciphering scheme. Such a system is designed to achieve some of security aspects such as confidentiality, authentication, and integrity, and non-repudiation. We used XML data as an experimental work. The implementation is done using VB.NET. Since, we have used RSA with some padding scheme; it is extremely difficult to factor large numbers. The property of shift ciphering scheme increases the cost of cryptoanalysis. The results are very much satisfactory for securing XML data. We found the estimation required time to break our generated keys is 3128 years, which is sufficient against any brute-force attacks.