Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Contradictory Problem of Paired Operation and dot Multiplication Operation on G1 #311

Open
YYWW123 opened this issue Oct 28, 2024 · 0 comments

Comments

@YYWW123
Copy link

YYWW123 commented Oct 28, 2024

In most cryptographic papers, the pairing operation in e:G1xG1->G2 takes much longer than the multiplication operation sP in G1. And researchers are working on pairing-free cryptographic schemes. Therefore, pairing operation should be a more time-consuming operation. Why do I use the charm library to measure that the multiplication operation in G1 is greater than the pairing operation?

Figure 1 shows the experimental data tested in Paper 1:hash to points=4.362 > pairing=4.154 > dot multiplication=1.631.
The experimental data of other people also show the same trend as Paper 1: hash to points > pairing > dot multiplication.

Fig1

Figure 2 shows the data I tested with the charm library. Figure 2 shows dot multiplication=576us > pairing=468us.

Fig2

I don't know what I did wrong that led to this contradictory result.

Hope to get your help, thanks!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant