Since February 2023, I am a postdoc researcher in mathematics at the Austrian Academy of Sciences, RICAM in Linz, in the research project Multivariate Algorithms and Quasi-Monte Carlo Methods.

My current research interest includes problems in information-based complexity, digital nets and sequences and its relation to coding theory.

I am also interested in problems in number theory motivated by cryptography, in particular I am interested in:

  • Pseudorandom sequences from hyperelliptic curves
  • Elliptic curves and abelian varieties over finite fields,
  • Finite fields,
  • Uniform distribution and number theoretic problems in Quasi Monte Carlo methods.

I finished my PhD in January 2023 at the Johannes Kepler University under the supervision of Dr. László Mérai, where I studied pseudorandom sequences from genus 2 curves.

I also enjoy teaching.

Contact

E-Mail: vishnupriya.anupindi@ricam.oeaw.ac.at

Preprints

  • V. Anupindi, P. Kritzer (2025) Reduced digital nets, (submitted) arXiv

Publications

  • V. Anupindi, P. Kritzer (2025) Column reduced digital nets. Numerical Algorithms (2025). link

  • E. Agathocleous, V. Anupindi, A. Bachmayr, C. Martindale, R. Y. N. Nchiwo, M. Stanojkovski (2024, online 2023) On homomorphic encryption using abelian groups: Classical security analysis, doi:10.1007/978-3-031-52163-8, arXiv, ePrint

  • V. Anupindi (2022) Linear complexity of sequences on Koblitz curves of genus 2. Uniform Distribution Theory 17, no. 2, 1-20. link, arXiv

  • V. Anupindi, L. Mérai (2022, online: 2021) Linear complexity of some sequences derived from hyperelliptic curves of genus 2. Cryptography and Communications, Bd. 14 (1), S. 117--134. doi:10.1007/s12095-021-00521-y, arXiv