Skip to content
New issue

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

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

Already on GitHub? # to your account

Missing limits for ECPAIRING #819

Merged
merged 11 commits into from
Jul 17, 2024

Conversation

OlivierBBB
Copy link
Collaborator

No description provided.

- fixed counting methods
- fixed isOnG2() method
@OlivierBBB OlivierBBB linked an issue Jul 4, 2024 that may be closed by this pull request
for (long i = 0; i < nPairsOfPoints; i++) {
final Bytes largeCoordinates = frame.shadowReadMemory(offset + ECPAIRING_NB_BYTES_PER_SMALL_POINT, ECPAIRING_NB_BYTES_PER_LARGE_POINT);

if (!isOnG2(largeCoordinates)) {
Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

And on the curve !!!

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Actually ok: the subgroup membership tests happens in the isOnG2 method.

@powerslider powerslider merged commit 561e204 into arith-dev Jul 17, 2024
5 checks passed
@powerslider powerslider deleted the feat/issue-817/G2-membership-tests-limit branch July 17, 2024 12:14
# for free to join this conversation on GitHub. Already have an account? # to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

ECPAIRING has 1 missing limit
2 participants