搜索结果: 1-15 共查到“Isomorphism”相关记录30条 . 查询时间(0.044 秒)
A signature scheme from the finite field isomorphism problem
Digital signatures finite field isomorphism problem lattice-based signature
2018/7/16
In a recent paper the authors and their collaborators proposed a new hard problem, called the finite field isomorphism problem, and they used it to construct a fully homomorphic encryption scheme. In ...
Fully Homomorphic Encryption from the Finite Field Isomorphism Problem
Finite field isomorphism fully homomorphic encryption lattice-based cyrptopgraphy
2017/6/9
If qq is a prime and nn is a positive integer then any two finite fields of order qnqn are isomorphic. Elements of these fields can be thought of as polynomials with coefficients chosen modulo qq, and...
ALMOST ISOMORPHISM FOR COUNTABLE STATE MARKOV SHIFTS
ALMOST ISOMORPHISM COUNTABLE STATE MARKOV SHIFTS
2015/9/29
Countable state Markov shifts are a natural generalization of the well-known subshifts of finite type. They are the subject of current research both for their own sake and as models for smooth dynamic...
We show that strongly positively recurrent Markov shifts (including shifts of finite type) are classified up to Borel conjugacy by their entropy, period and their numbers of periodic points.
THE SATAKE ISOMORPHISM FOR SPECIAL MAXIMAL PARAHORIC HECKE ALGEBRAS
PARAHORIC HECKE Algebra
2015/9/29
Let G denote a connected reductive group over a nonarchimedean
local field F. Let K denote a special maximal parahoric subgroup of G(F). We
establish a Satake isomorphism for the Hecke algebra...
New Insight into the Isomorphism of Polynomials problem IP1S and its Use in Cryptography
secret-key cryptography
2014/3/5
This paper investigates the mathematical structure of the ``Isomorphism of Polynomial with One Secret'' problem (IP1S). Our purpose is to understand why for practical parameter values of IP1S most ran...
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers
polynomial-time algorithm, group isomorphism, solvable group
2012/12/3
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial nlog n bound on the time complexity for the general case has not been improved over the past fou...
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
Group Isomorphism Permutational Isomorphism Code Equivalence
2012/12/4
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The trivial nlog n bound on the time complexity for the general case has not been improved upon over the pas...
Spline Smoothing for Estimation of Circular Probability Distributions via Spectral Isomorphism and its Spatial Adaptation
Non-parametric density estimation circular data Smoothing Spline empirical Fourier coeffcients Fourier Basis Detection of Localisation Edge preserving function estima-tion
2012/11/22
Consider the problem when $X_1,X_2,..., X_n$ are distributed on a circle following an unknown distribution $F$ on $S^1$. In this article we have consider the absolute general set-up where the density ...
On Isomorphism Testing of Groups with Normal Hall Subgroups
Group Isomorphism Problem Normal Hall Subgroups Computational Complexity
2012/12/3
A normal Hall subgroup N of a group G is a normal subgroup with its order coprime with its index. Schur-Zassenhaus theorem states that every normal Hall subgroup has a complement subgroup, that is a s...
Isomorphism classes of Edwards curves over finite fields
Elliptic curves Edwards curves Isomorphisms
2012/3/28
Edwards curves are an alternate model for elliptic curves, which have attracted notice in cryptography. We give exact formulas for the number of $\Fq$-isomorphism classes of Edwards curves and twisted...
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in p 2 . In the case of linear matroids, which are
represented over polynomially growing fie...
The isomorphism problem for groups given by their multiplication tables has long been known to be solvable in time nlog n+O(1). The decades-old quest for a
polynomial-time algorithm has focused on th...
Stable orbit equivalence of Bernoulli actions of free groups and isomorphism of some of their factor actions
Stable orbit equivalence Bernoulli actions isomorphism Dynamical Systems Group Theory
2011/8/26
Abstract: We give an elementary proof for Lewis Bowen's theorem saying that two Bernoulli actions of two free groups, each having arbitrary base probability spaces, are stably orbit equivalent. Our me...
Sherali-Adams Relaxations of Graph Isomorphism Polytopes
Sherali-Adams Relaxations Graph Isomorphism Polytopes Combinatorics
2011/8/24
Abstract: We investigate the Sherali-Adams lift & project hierarchy applied to a graph isomorphism polytope whose integer points encode the isomorphisms between two graphs. In particular, the Sherali-...