XBMRSA: A new XML encryption algorithm

N. Nithin; Anupkumar M. Bongale

doi:10.1109/WICT.2012.6409141

XBMRSA: A new XML encryption algorithm

N. Nithin, Anupkumar M. Bongale

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

Abstract

Extensible Markup Language (XML) is used to exchange messages across different networks due to its flexibility and adaptability. Due to the wide usage of XML documents over internet there arises a need to protect these documents to provide data confidentiality and privacy. There are various cryptographic algorithms proposed to encrypt XML documents to address the issue of security. In this paper we are proposing a new public key cryptographic algorithm called XML Batch Multi-Prime RSA (XBMRSA) to encrypt sections of XML document based on Multi-Prime RSA technique. A detailed comparative study of standard RSA and XBMRSA is carried out by considering parameters like time required to encrypt and decrypt the XML file and size of the encrypted file. XBMRSA has provided better results as it takes less time to encrypt and decrypt the XML data.

Original language	English
Title of host publication	Proceedings of the 2012 World Congress on Information and Communication Technologies, WICT 2012
Pages	567-571
Number of pages	5
DOIs	https://doi.org/10.1109/WICT.2012.6409141
Publication status	Published - 01-12-2012
Externally published	Yes
Event	2012 World Congress on Information and Communication Technologies, WICT 2012 - Trivandrum, India Duration: 30-10-2012 → 02-11-2012

Conference

Conference	2012 World Congress on Information and Communication Technologies, WICT 2012
Country/Territory	India
City	Trivandrum
Period	30-10-12 → 02-11-12

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Information Systems

Access to Document

10.1109/WICT.2012.6409141

Cite this

@inproceedings{f9ab6e2b4eba4a6fb10897099a7149b7,

title = "XBMRSA: A new XML encryption algorithm",

abstract = "Extensible Markup Language (XML) is used to exchange messages across different networks due to its flexibility and adaptability. Due to the wide usage of XML documents over internet there arises a need to protect these documents to provide data confidentiality and privacy. There are various cryptographic algorithms proposed to encrypt XML documents to address the issue of security. In this paper we are proposing a new public key cryptographic algorithm called XML Batch Multi-Prime RSA (XBMRSA) to encrypt sections of XML document based on Multi-Prime RSA technique. A detailed comparative study of standard RSA and XBMRSA is carried out by considering parameters like time required to encrypt and decrypt the XML file and size of the encrypted file. XBMRSA has provided better results as it takes less time to encrypt and decrypt the XML data.",

author = "N. Nithin and Bongale, {Anupkumar M.}",

year = "2012",

month = dec,

day = "1",

doi = "10.1109/WICT.2012.6409141",

language = "English",

isbn = "9781467348041",

pages = "567--571",

booktitle = "Proceedings of the 2012 World Congress on Information and Communication Technologies, WICT 2012",

note = "2012 World Congress on Information and Communication Technologies, WICT 2012 ; Conference date: 30-10-2012 Through 02-11-2012",

}

TY - GEN

T1 - XBMRSA

T2 - 2012 World Congress on Information and Communication Technologies, WICT 2012

AU - Nithin, N.

AU - Bongale, Anupkumar M.

PY - 2012/12/1

Y1 - 2012/12/1

N2 - Extensible Markup Language (XML) is used to exchange messages across different networks due to its flexibility and adaptability. Due to the wide usage of XML documents over internet there arises a need to protect these documents to provide data confidentiality and privacy. There are various cryptographic algorithms proposed to encrypt XML documents to address the issue of security. In this paper we are proposing a new public key cryptographic algorithm called XML Batch Multi-Prime RSA (XBMRSA) to encrypt sections of XML document based on Multi-Prime RSA technique. A detailed comparative study of standard RSA and XBMRSA is carried out by considering parameters like time required to encrypt and decrypt the XML file and size of the encrypted file. XBMRSA has provided better results as it takes less time to encrypt and decrypt the XML data.

AB - Extensible Markup Language (XML) is used to exchange messages across different networks due to its flexibility and adaptability. Due to the wide usage of XML documents over internet there arises a need to protect these documents to provide data confidentiality and privacy. There are various cryptographic algorithms proposed to encrypt XML documents to address the issue of security. In this paper we are proposing a new public key cryptographic algorithm called XML Batch Multi-Prime RSA (XBMRSA) to encrypt sections of XML document based on Multi-Prime RSA technique. A detailed comparative study of standard RSA and XBMRSA is carried out by considering parameters like time required to encrypt and decrypt the XML file and size of the encrypted file. XBMRSA has provided better results as it takes less time to encrypt and decrypt the XML data.

UR - http://www.scopus.com/inward/record.url?scp=84873399783&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84873399783&partnerID=8YFLogxK

U2 - 10.1109/WICT.2012.6409141

DO - 10.1109/WICT.2012.6409141

M3 - Conference contribution

AN - SCOPUS:84873399783

SN - 9781467348041

SP - 567

EP - 571

BT - Proceedings of the 2012 World Congress on Information and Communication Technologies, WICT 2012

Y2 - 30 October 2012 through 2 November 2012

ER -

XBMRSA: A new XML encryption algorithm

Abstract

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this