This paper presents the use of an algorithm called Dwandwa square-root algorithm to compute large multiple-precision square roots on computers using existing single-precision operations. A few modifications to the basic algorithm are proposed to improve its efficiency. The implementation of this algorithm on two different processor architectures is discussed. An analysis of the performance of this algorithm in comparison with other known techniques is then presented to highlight the advantages of this technique.