Abstract
With a greater use of the Internet and electronic devices in general for communications and monetary transac- tions it is necessary to protect people’s privacy with strong cryptographic algorithms. This paper describes a framework for the development and testing of cryptographic and mathematical software. The authors argue this type of software needs a development and testing framework that is better tailored to its needs than other more general approaches. The proposed framework uses the symbolic mathematics package, Maple, as a rapid prototyping tool, test oracle and also in test case refinement. Finally, we test our hypothesis by evaluation of systems developed with and without the framework using quantitative techniques and a multi component qualitative metric.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. H. Tse, T. Y. Chen, and Z. Zhou, “Testing of large number mul- tiplication functions in cryptographic systems,” inProceedings of the 1st Asia-Pacific Conference on Quality Software (APAQS 2000). IEEE Computer Society, 2000, pp. 89-98.
“Maple, version 9.03,” http://www.maplesoft.com.
“The java programming language,” http://java.sun.com.
Sommerville, Software Engineering, 6th ed. Addison Wesley, 2001.
L. Baresi and M. Young, “Test oracles,” 2001, preprint for ACM Surverys.
G.J. Myers, T. Badgett, T.M. Thomas, and C.Sandler, The Art of Software Testing, 2nd ed. John Wiley & Sons, 2004.
C.Whelan, A.Burnett, A.Duffy, and T.Dowling, “A Java API for polynomial arithmetic,” inProceedings of Principles and Practices ofProgramming in Java (PPPJ).ACM Press, 2003.
R.Schoof, “Elliptic Curves over finite fields and the computation of square roots mod p,” Math.Comp., vol.44, pp.483-494, 1985.
I.Blake, G.Seroussi, and N.Smart, Elliptic Curves in Cryptography, 1st ed. Cambridge University Press, 1999.
R.J.McEliece, “A public-key cryptosystem based on algebraic coding theory,” JPL Deep Space Network Progress Report, Tech.Rep.42- 44, 1978.
J.Silverman,The Arithmetic of Elliptic Curves, ser.Graduate Texts in Mathematics. Springer-Verlang, 1986, vol. 106.
A. Menezes, S.Vanstone, and T.Okamoto, “Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field,”ACM Transactions, 1991.
R.Schoof, “Counting points on elliptic curves over finite fields,”J. Th’eorie des Nombres Bordeaux, vol.7, pp.219-254, 1995.
A. Burnett and T. Dowling, “Rapid prototyping and performance analy-sis of elliptic curve cryptographic algorithms using java and maple,” in Proceedings of IASTED Conference on Software Engineering and Applications (SEA ’04), 2004.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media B.V.
About this paper
Cite this paper
Burnett, A., Dowling, T. (2008). A Framework for the Development and Testing of Cryptographic Software. In: Sobh, T. (eds) Advances in Computer and Information Sciences and Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8741-7_9
Download citation
DOI: https://doi.org/10.1007/978-1-4020-8741-7_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-8740-0
Online ISBN: 978-1-4020-8741-7
eBook Packages: Computer ScienceComputer Science (R0)