
doi: 10.1515/jmc.2008.001
Abstract We present an attack on one of the Hidden Pairing schemes proposed by Dent and Galbraith. We drastically reduce the number of variables necessary to perform a multivariate attack and in some cases we can completely recover the private key. Our attack relies only on knowledge of the public system parameters.
Curves over finite and local fields, pairings, cryptanalysis, QA1-939, Cryptography, elliptic curves, Applications to coding theory and cryptography of arithmetic geometry, public key cryptography, Mathematics
Curves over finite and local fields, pairings, cryptanalysis, QA1-939, Cryptography, elliptic curves, Applications to coding theory and cryptography of arithmetic geometry, public key cryptography, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
