Math Stack Exchange (2014) What Is the Time Complexity of Euclid’s Algorithm?
http://math.stackexchange.com/questions/258596/what-is-the-time-complexity-of-euclids-algorithm-upper-bound-lower-bound-and-a

has been cited by the following article:

• TITLE: Ambiguous Multi-Symmetric Scheme and Applications

  AUTHORS: Richard Bassous, Ahmad Mansour, Roger Bassous, Huirong Fu, Ye Zhu, George Corser

  KEYWORDS: Deniable Encryption, Multi Encryption, Honey Encryption, Steganography, Symmetric Encryption, Multi Encoding

  JOURNAL NAME: Journal of Information Security, Vol.8 No.4, October 31, 2017

  ABSTRACT: This paper introduces and evaluates the performance of a novel cipher scheme, Ambiguous Multi-Symmetric Cryptography (AMSC), which conceals multiple coherent plain-texts in one cipher-text. The cipher-text can be decrypted by different keys to produce different plain-texts. Security analysis showed that AMSC is secure against cipher-text only and known plain-text attacks. AMSC has the following applications: 1) it can send multiple messages for multiple receivers through one cipher-text; 2) it can send one real message and multiple decoys for camouflage; and 3) it can send one real message to one receiver using parallel processing. Performance comparison with leading symmetric algorithms (DES, AES and RC6) demonstrated AMSC’s efficiency in execution time.