Skip to main content

I am studying RSA Dynamic AccumulatorAccumulators and I have a question: why is it simpler to calculate the new accumulator value after a deletion if is known the secret ϕ(n)$\phi(N)$ is known? Is possible to calculate the deletion only with the RSA modulus N$N$?

I am studying RSA Dynamic Accumulator and I have a question: why is simpler to calculate the new accumulator value after a deletion if is known the secret ϕ(n)? Is possible to calculate the deletion only with the RSA modulus N?

I am studying RSA Dynamic Accumulators and I have a question: why is it simpler to calculate the new accumulator value after a deletion if the secret $\phi(N)$ is known? Is possible to calculate the deletion only with the RSA modulus $N$?

Tweeted twitter.com/StackCrypto/status/674011580548456451
deleted 1 character in body
Source Link
CodesInChaos
  • 25.1k
  • 2
  • 90
  • 129

I am studying RSA Dynamic Accumulator and I have a doubtquestion: why is more simplesimpler to calculate the new accumulator value after a deletion if is known the secret ϕ(n)? Is possible to calculate the deletion only with the RSA modulus N?

I am studying RSA Dynamic Accumulator and I have a doubt: why is more simple to calculate the new accumulator value after a deletion if is known the secret ϕ(n)? Is possible to calculate the deletion only with the RSA modulus N?

I am studying RSA Dynamic Accumulator and I have a question: why is simpler to calculate the new accumulator value after a deletion if is known the secret ϕ(n)? Is possible to calculate the deletion only with the RSA modulus N?

Source Link
4nf3rt
  • 145
  • 7

Deletion in RSA Accumulator

I am studying RSA Dynamic Accumulator and I have a doubt: why is more simple to calculate the new accumulator value after a deletion if is known the secret ϕ(n)? Is possible to calculate the deletion only with the RSA modulus N?