Article Contents
Article Contents

# On finite fields for pairing based cryptography

• Here, we improve our previous bound on the number of finite fields over which elliptic curves of cryptographic interest with a given embedding degree and small complex multiplication discriminant may exist. We also give some heuristic arguments which lead to a lower bound which in some cases is close to our upper bound.
Mathematics Subject Classification: 11G07, 11T71, 14H52.

 Citation: