Contact Us

By telephone
During office hours
(Monday-Friday 08:30-17:00)
+44 (0)1234 400 400

Outside office hours
(Campus Watch)
+44 (0)1582 74 39 89

By email
admission@beds.ac.uk (admissions)
international@beds.ac.uk (international)
sid@beds.ac.uk (student support)
help@beds.ac.uk (registration)

By post
University of Bedfordshire
Park Square
Luton
Bedfordshire
UK, LU1 3JU

Publications

Publications

Prof Song Yan

Selected Books:
  • S. Y. Yan, Cryptanalytic Attacks on RSA, Springer-Verlag, xviii+257 pages, 2007. ISBN-10: 0-387-48741-7, ISBN-13: 978-0-387-48741-0.
  • S. Y. Yan,  Primality Testing and Integer Factorization in Public-Key Cryptography, Springer-Verlag, xvi+236 pages, 2004. ISBN 1-4020-7649-5.
  • S. Y. Yan,    Number Theory for Computing, Springer-Verlag, 2nd Edition, xxii + 435 pages, 26 figures, 78 images, 33 tables, 2002. ISBN: 3-540-40372-5.
  • S. Y. Yan,   Number Theory for Computing, Springer-Verlag, XVII + 381 pages, 25 figures, 67 images, 31 tables,  2000. ISBN: 3-540-65472-0.
  • S. Y. Yan,   An Introduction to Formal Languages and Machine Computation, World Scientific, xvii + 400 pages, 1998. ISBN 981-02-2167-3.
  • S. Y. Yan,  Perfect, Amicable and Sociable Numbers - A Computational Approach , World Scientific, xx + 338 pages,  1996. ISBN 981-02-2847-3.
Selected Papers:
2007
  • S. Y. Yan, C. Maple and G. James, “A New Scheme for Deniable/Repudiable Authentication'', Lecture Note in Computer Science 4770 , Springer, 2007, pp 424-432.
  • S. Y. Yan, T. French, “Non-Repudiable and Repudiable Authentications in E-Systems'', ICCS 2007: Proceedings of the 15th International Workshop on Conceptual Structures, Sheffield, Springer, 2006, pp 17-24.

2006
  • S. Y. Yan and G. James, “Testing Mersenne Primes with Elliptic Curves'', Lecture Note in Computer Science 4194 , Springer, 2006, pp 303-312.
  • S. Y. Yan, G. James, “Polynomially Uncomputable Number-Theoretic Problems in Cryptography and Information Security'', Proceedings of International Conference on Foundations of Computer Science, 2006, pp 195-199.
  • S. Y. Yan, G. James, “Cryptographic and Computational Challenges in Grid Computing'', Proceedings of International Conference on Foundations of Computer Science, 2006, pp 200-204.
  • S. Y. Yan, G. James and G. Y. Wu, “Can Factoring be in P'', Proceedings of International Conference on Intelligent Agents, Web Technology and Internet Commerce, IEEE Press, 2006, 6 pages.
  • S. Y. Yan, G. James and G. Y. Wu, “Fast Modular Exponentiation Methods'', International Journal of Mathematical Education in Science and Technology, Vol 37, No 5, 2006, pp 745-753.
2005
  • S. Y. Yan, G. James and G. Y. Wu, “Secure Electronic and Mobile Commerce'', Proceedings of International Conference on Intelligent Agents, Web Technology and Internet Commerce, IEEE Press, 2005, pp 692-697.
  • M. Uounas, K. M. Chao, S. Y. Yan, P. J. Lovett and N. Codwin, Grid Services Mediation, IEEE 19th International Conference on Advanced Information Networking and Applications, IEEE Press, 2005, pp 879-884.
2004
  • S. Y. Yan, “2500 Years in the Search for Amicable Numbers'', Advances in Mathematics , Vol 33, No 4, 2004, pp 385-400.
2003
  • S. Y. Yan, “Computing Prime Factorization and Discrete Logarithms: from Index Calculus to Xedni Calculus'', International Journal of Computer Mathematics, . Vol 80, No 5, 2003, pp 573-590.
  • S. Y. Yan, “Zero-Knowledge Identification in Secure E-Commerce'', Proceedings of the 16th International Conference on Systems Engineering, Coventry, 9-11 September 2003, pp 795-797.
2002
  • Papanikolaou and S. Y. Yan, “Prime Number Generation Based on Pocklington's Theorem'', International Journal of Computer Mathematics, Vol 79, (2002), pp 1049-1056.
  • S. Y. Yan, “Integer Factorization: Current Status and Future Developments'', 18th British Colloquium for Theoretical Computer Science (BCTCS18) , HP Laboratories Bristol, 7-10 April 2002.
1999
  • S. Y. Yan, “A New Cryptographic Scheme based on the kth Power Residuosity Problem'', 15th British Colloquium for Theoretical Computer Science (BCTCS15) , Keele University, 14-16 April 1999.
  • S. Y. Yan and G. James, “Fast Group Operations on Elliptic Curves in Maple'', Computers & Mathematics with Applications, Vol. 37, No. 8, 1999, pp. 129-138.
1997
  • S. Y. Yan, “Computing Amicable Numbers'', Mathematics Today, Vol. 33, No. 3, 1997, pp. 85-89.
Bedfordshire University

Apply» Faculties & Departments» Department of Computer Science and Technology» Staff» Prof Song Yan» Publications

Top