S. Ramesh Raju

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We introduce a new approach for randomizing the digit sets of binary integer representations used in elliptic curve cryptography, and present a formal analysis of the sparsity of such representations. The motivation is to improve the sparseness of integer representations and to provide a tool for defense against side channel attacks. Existing alternative(More)
  • 1