5 papers
Reduced digital nets
Vishnupriya Anupindi, Peter Kritzer
In the recent papers ``The fast reduced QMC matrix-vector product'' (J. Comput. Appl. Math. 440, 115642, 2024) and ``Column reduced digital nets'' (submitted), it was proposed to u…
Column reduced digital nets
Vishnupriya Anupindi, Peter Kritzer
Digital nets provide an efficient way to generate integration nodes of quasi-Monte Carlo (QMC) rules. For certain applications, as e.g. in Uncertainty Quantification, we are intere…
On homomorphic encryption using abelian groups: Classical security analysis
Eleni Agathocleous, Vishnupriya Anupindi, Annette Bachmayr +3
In [15], Leonardi and Ruiz-Lopez propose an additively homomorphic public key encryption scheme whose security is expected to depend on the hardness of the learning homomorphism wi…
Linear Complexity of Sequences on Koblitz Curves of Genus 2
Vishnupriya Anupindi
In this paper, we consider the hyperelliptic analogue of the Frobenius endomorphism generator and show that it produces sequences with large linear complexity on the Jacobian of ge…
Linear complexity of some sequences derived from hyperelliptic curves of genus 2
Vishnupriya Anupindi, László Mérai
For a given hyperelliptic curve over a finite field with Jacobian , we consider the hyperelliptic analogue of the congruential generator defined by for $n\…