最近RSA暗号化を学びながらディフィー・ヘルマンの鍵交換アルゴリズムを復習しました。 What caught my interest is that the integer g (which along with p) is publicly exchanged between the two parties) must be a primitive root modulo p (which is…