<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
	<front>
		<journal-meta>
			<journal-id journal-id-type="publisher-id">INFORMATICA</journal-id>
			<journal-title-group>
				<journal-title>Informatica</journal-title>
			</journal-title-group>
			<issn pub-type="epub">0868-4952</issn>
			<issn pub-type="ppub">0868-4952</issn>
			<publisher>
				<publisher-name>VU</publisher-name>
			</publisher>
		</journal-meta>
		<article-meta>
			<article-id pub-id-type="publisher-id">INF11102</article-id>
			<article-id pub-id-type="doi">10.3233/INF-2000-11102</article-id>
			<article-categories>
				<subj-group subj-group-type="heading">
					<subject>Research article</subject>
				</subj-group>
			</article-categories>
			<title-group>
				<article-title>Cryptanalysis of the Batch Verifying Multiple RSA Digital Signatures<xref ref-type="fn" rid="fn1">
						<sup>✩</sup>
					</xref>
				</article-title>
			</title-group>
			<contrib-group>
				<contrib contrib-type="Author">
					<name>
						<surname>Hwang</surname>
						<given-names>Min-Shiang</given-names>
					</name>
					<email xlink:href="mailto:mshwang@cyut.edu.tw">mshwang@cyut.edu.tw</email>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
				</contrib>
				<contrib contrib-type="Author">
					<name>
						<surname>Lin</surname>
						<given-names>Iuon-Chung</given-names>
					</name>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
				</contrib>
				<contrib contrib-type="Author">
					<name>
						<surname>Hwang</surname>
						<given-names>Kuo-Feng</given-names>
					</name>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_001"/>
				</contrib>
				<aff id="j_INFORMATICA_aff_000">Department of Information Management Chaoyang University of Technology, 168, Gifeng E.Rd., Wufeng, Taichung Country, Taiwan 413, R.O.C.</aff>
				<aff id="j_INFORMATICA_aff_001">Department of Computer Science and Information Engineering, National Chung Cheng University, Chaiyi, Taiwan, R.O.C.</aff>
			</contrib-group>
			<author-notes>
				<fn id="fn1">
					<label>
						<sup>✩</sup>
					</label><p>This research was partially supported by the NSC89-2213-E-324-001.</p>
				</fn>
			</author-notes>
			<pub-date pub-type="epub">
				<day>01</day>
				<month>01</month>
				<year>2000</year>
			</pub-date>
			<volume>11</volume>
			<issue>1</issue>
			<fpage>15</fpage>
			<lpage>18</lpage>
			<history>
				<date date-type="received">
					<day>01</day>
					<month>01</month>
					<year>2000</year>
				</date>
			</history>
			<abstract>
				<p>Recently, Harn proposed an efficient scheme that can batch verification multiple RSA digital signatures. His scheme can reduce signature verification time. However, there is a weakness in his scheme. In this study, we present two methods to against his scheme.</p>
			</abstract>
			<kwd-group>
				<label>Keywords</label>
				<kwd>cryptography</kwd>
				<kwd>digital signature</kwd>
				<kwd>RSA</kwd>
			</kwd-group>
		</article-meta>
	</front>
</article>