Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-12-01T03:29:29.190Z Has data issue: false hasContentIssue false
  • English
  • Français

102.06 A new elementary proof of Euler's continued fractions

Published online by Cambridge University Press:  08 February 2018

Joseph Tonien
Joseph Tonien*
Affiliation:
Institute of Cybersecurity and Cryptology, School of Computing and Information Technology, University of Wollongong, Australia e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes
Information
The Mathematical Gazette , Volume 102 , Issue 553 , March 2018 , pp. 105 - 111
Copyright
Copyright © Mathematical Association 2018 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Olds, C. D., Continued fractions, The Mathematical Association of America (1963).CrossRefGoogle Scholar
2. Wiener, M., Cryptanalysis of short RSA secret exponents, IEEE Transactions on Information Theory 36 (1990) pp. 553–558.CrossRefGoogle Scholar
3. Bunder, M. and Tonien, J., A new attack on the RSA cryptosystem based on continued fractions, Malaysian Journal of Mathematical Sciences 11 (S) (August 2017) pp. 45–57.Google Scholar
4. Euler, L., De fractionibus continuis dissertatio, Commentarii Academiae Scientiarum Petropolitanae 9 (1744) pp. 98–137. Available at http://eulerarchive.maa.org/pages/E071.html Google Scholar
5. Hardy, G. H. and Wright, E. M., An introduction to the theory of numbers, (6th edn.) Oxford University Press (2008).Google Scholar