Galbraith, Steven D., et al. “Pairings for Cryptographers”. Discrete Applied Mathematics, vol. 156, no. 16, 2008, pp. 3113-21, https://doi.org/10.1016/j.dam.2007.12.010.
Galbraith, S. D., Paterson, K. G., & Smart, N. P. (2008). Pairings for cryptographers. Discrete Applied Mathematics, 156(16), 3113-3121. https://doi.org/10.1016/j.dam.2007.12.010
Galbraith SD, Paterson KG, Smart NP. Pairings for cryptographers. Discrete Applied Mathematics. 2008;156(16):3113-21.
The first research to cite this article was titled Discrete Logarithm Problems with Auxiliary Inputs and was published in 2009. The most recent citation comes from a 2024 study titled Discrete Logarithm Problems with Auxiliary Inputs . This article reached its peak citation in 2022 , with 25 citations.It has been cited in 82 different journals, 17% of which are open access. Among related journals, the International Journal of Information Security cited this research the most, with 10 citations. The chart below illustrates the annual citation trends for this article.