Ping Ngai Chung

Learn More
We give a general framework for uniform, constant-time one-and two-dimensional scalar multiplication algorithms for elliptic curves and Jacobians of genus 2 curves that operate by projecting to the x-line or Kummer surface, where we can exploit faster and more uniform pseudomultiplication, before recovering the proper " signed " output back on the curve or(More)
The prime number theorem is one of the most fundamental theorems of analytic number theory, stating that the prime counting function, π(x), is asymptotic to x/ log x. However, it says little about the parity of π(n) as an arithmetic function. Using Selberg's sieve, we prove a positive lower bound for the proportion of positive integers n such that π(n) is r(More)
  • 1