Can the RSA accumulator scheme be converted to Elliptic Curve math?

Can the RSA accumulator scheme be converted to Elliptic Curve math?

Is it possible to translate the RSA accumulator scheme directly to EC without requiring bilinear pairings?

In RSA we have:

A_{n+1} = A_n^c st. {c prime|c ∈ [A,B]}

W = A_n

A_{n+1} == W^c

Would this work in EC like this?

A_{n+1} = c A_n

W = A_n

A_{n+1} == c W

Where A0 is a generator point on the curve and c is prime.

If not, then why?

submitted by /u/narodism
[link] [comments]

top scoring links : crypto
Cryptography is the art of creating mathematical assurances for who can do what with data, including but not limited the classical example of encrypting messages so that only the key-holder can read it. Cryptography lives at an intersection of math, programming, and computer science. This subreddit covers the theory and practice of modern and *strong* cryptography, and it is a technical subreddit focused on the algorithms and implementations of cryptography.

Related posts

Leave a Comment