1 citations · 1 across the 8 of their papers we have counts for
9 papers
Methods for Collisions in Some Algebraic Hash Functions
Simran Tinani
This paper focuses on devising methods for producing collisions in algebraic hash functions that may be seen as generalized forms of the well-known Zémor and Tillich-Zémor hash fun…
Cryptanalysis of a System based on Twisted Dihedral Group Algebras
Simran Tinani
Several cryptographic protocols constructed based on less-known algorithmic problems, such as those in non-commutative groups, group rings, semigroups, etc., which claim quantum se…
On the Conjugacy Search Problem in Extraspecial -Groups
Simran Tinani
In the recently emerging field of group-based cryptography, the Conjugacy Search Problem (CSP) has gained traction as a non-commutative replacement of the Discrete Log Problem (DLP…
Cryptanalysis of some Nonabelian Group-Based Key Exchange Protocols
Simran Tinani, Carlo Matteotti, Joachim Rosenthal
In the recently emerging field of nonabelian group-based cryptography, a prominently used one-way function is the Conjugacy Search Problem (CSP), and two important classes of platf…
A Number Theoretic Approach to Cycles in LDPC Codes
Julia Lieb, Simran Tinani
LDPC codes constructed from permutation matrices have recently attracted the interest of many researchers. A crucial point when dealing with such codes is trying to avoid cycles of…
Local to global principle over number fields for higher moments
Giacomo Micheli, Severin Schraven, Simran Tinani +1
The local to global principle for densities is a very convenient tool proposed by Poonen and Stoll to compute the density of a given subset of the integers. In this paper we provid…
On Cyclic Matroids and their Applications
Gianira N. Alfarano, Karan Khathuria, Simran Tinani
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely…
A Deterministic Algorithm for the Discrete Logarithm Problem in a Semigroup
Simran Tinani, Joachim Rosenthal
The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mat…
Existence and Cardinality of -Normal Elements in Finite Fields
Simran Tinani, Joachim Rosenthal
Normal bases in finite fields constitute a vast topic of large theoretical and practical interest. Recently, -normal elements were introduced as a natural extension of normal el…