Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Sule, Virendra"'
Autor:
Sule, Virendra
This Paper defines and explores solution to the problem of \emph{Inversion of a finite Sequence} over the binary field, that of finding a prefix element of the sequence which confirms with a \emph{Recurrence Relation} (RR) rule defined by a polynomia
Externí odkaz:
http://arxiv.org/abs/2406.19610
This paper discusses the observability of nonlinear Dynamical Systems over Finite Fields (DSFF) through the Koopman operator framework. In this work, given a nonlinear DSFF, we construct a linear system of the smallest dimension, called the Linear Ou
Externí odkaz:
http://arxiv.org/abs/2404.02336
Autor:
Sule, Virendra
This paper develops the notion of \emph{Word Linear Complexity} ($WLC$) of vector valued sequences over finite fields $\ff$ as an extension of Linear Complexity ($LC$) of sequences and their ensembles. This notion of complexity extends the concept of
Externí odkaz:
http://arxiv.org/abs/2311.06574
Autor:
Sule, Virendra
This paper addresses the computational problem of deciding invertibility (or one to one-ness) of a Boolean map $F$ in $n$-Boolean variables. This problem has a special case of deciding invertibilty of a map $F:\mathbb{F}_{2}^n\rightarrow\mathbb{F}_{2
Externí odkaz:
http://arxiv.org/abs/2307.07788
Autor:
Sule, Virendra
This paper is a short summery of results announced in a previous paper on a new universal method for Cryptanalysis which uses a Black Box linear algebra approach to computation of local inversion of nonlinear maps in finite fields. It is shown that o
Externí odkaz:
http://arxiv.org/abs/2207.03247
Publikováno v:
In Finite Fields and Their Applications October 2024 99
Autor:
Sule, Virendra
This paper presents algorithms for local inversion of maps and shows how several important computational problems such as cryptanalysis of symmetric encryption algorithms, RSA algorithm and solving the elliptic curve discrete log problem (ECDLP) can
Externí odkaz:
http://arxiv.org/abs/2202.06584
Autor:
Sule, Virendra
For a map (function) $F(x):\ftwo^n\rightarrow\ftwo^n$ and a given $y$ in the image of $F$ the problem of \emph{local inversion} of $F$ is to find all inverse images $x$ in $\ftwo^n$ such that $y=F(x)$. In Cryptology, such a problem arises in Cryptana
Externí odkaz:
http://arxiv.org/abs/2105.07332
This paper formulates and solves the problem of robust compensation of multiport active network. This is an important engineering problem as networks designed differ in parameter values due to tolerance during manufacture from their actual realizatio
Externí odkaz:
http://arxiv.org/abs/2010.13419
This paper defines a linear representation for nonlinear maps $F:\mathbb{F}^n\rightarrow\mathbb{F}^n$ where $\mathbb{F}$ is a finite field, in terms of matrices over $\mathbb{F}$. This linear representation of the map $F$ associates a unique number $
Externí odkaz:
http://arxiv.org/abs/2010.14601