Article Contents

2007, Volume 1, Issue 3: 281-286. Doi: 10.3934/amc.2007.1.281

This issue Previous Article Next Article Eigenvalue bounds on the pseudocodeword weight of expander codes

On finite fields for pairing based cryptography

Florian Luca^1, and
Igor E. Shparlinski^2,

1.
Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 58089, Morelia, Michoacán
2.
Department of Computing, Macquarie University, Sydney, NSW 2109

Received: July 2006

Revised: June 2007

Published: August 2007

Abstract / Introduction Related Papers Cited by

Abstract

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.

Keywords:

Mathematics Subject Classification: 11G07, 11T71, 14H52.

Citation:

Article Metrics

HTML views() PDF downloads(171) Cited by(0)

On finite fields for pairing based cryptography

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

On finite fields for pairing based cryptography

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content