English
Related papers

Related papers: Minimal Logarithmic Signatures for one type of Cla…

200 papers

In earlier work, Katz exhibited some very simple one parameter families of exponential sums which gave rigid local systems on the affine line in characteristic p whose geometric (and usually, arithmetic) monodromy groups were SL(2,q), and…

Number Theory · Mathematics 2017-10-09 Robert M. Guralnick , Nicholas M. Katz , Pham Huu Tiep

Lawrence-Krammer representations (LK-representations for short) are linear representations of Artin-Tits groups of small type, which are of importance since they are known to be faithful when the type is spherical, or more generally when…

Group Theory · Mathematics 2008-12-18 Anatole Castella

The determination of scalars involved in Lusztig's conjecture for finite reductive groups $G(F_q)$ was achieved by Waldspurger in the case of symplectic groups or orthogonal groups, under the condition that $p,q$ are large enough. Here $p$…

Representation Theory · Mathematics 2007-12-17 Toshiaki Shoji

Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric…

Discrete Mathematics · Computer Science 2022-05-03 Jaime Gutierrez , Jorge Jimenez Urroz

Our aim is to study topological minimality of some natural matrix groups. We show that the special upper triangular group $SUT(n,\mathbb{F})$ is minimal for every local field $\mathbb{F}$ of characteristic $\neq 2$. This result is new even…

General Topology · Mathematics 2022-10-07 Michael Megrelishvili , Menachem Shlossberg

We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…

Quantum Physics · Physics 2007-05-23 Julia Kempe , Laszlo Pyber , Aner Shalev

The partial least squares (PLS) is a popular modeling technique commonly used in social sciences. The traditional PLS algorithm deals with variables measured on interval scales while data are often collected on ordinal scales: a…

Methodology · Statistics 2012-12-21 Gabriele Cantaluppi

In this article we construct a large family of $R$-matrices for various extensions of small quantum groups by grouplike elements. The extensions are in correspondence to lattices between root and weight lattice and admit $R$-matrices in…

Quantum Algebra · Mathematics 2015-04-02 Simon Lentner , Daniel Nett

Lexicographically minimal string rotation (LMSR) is a problem to find the minimal one among all rotations of a string in the lexicographical order, which is widely used in equality checking of graphs, polygons, automata and chemical…

Quantum Physics · Physics 2024-02-05 Qisheng Wang , Mingsheng Ying

Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…

Cryptography and Security · Computer Science 2018-09-18 Aurore Guillevic

We produce new short laws in two variables valid in finite groups of Lie type. Our result improves upon results of Kozma and the second named author, and is sharp up to logarithmic factors, for all families except possibly the Suzuki…

Group Theory · Mathematics 2022-10-06 Henry Bradford , Andreas Thom

In this paper we study the minimal faithful permutation representations of $SL_n(\mathbb F_q)$ and $GL_n(\mathbb F_q)$.

Group Theory · Mathematics 2023-04-03 Neelima Borade , Ramin Takloo-Bighash

Construct the first provably secure linear homomorphic ring signature scheme. Ring signatures allow a signer to anonymously sign a message on behalf of a user group (ring) and are widely applied in areas such as identity protection,…

Cryptography and Security · Computer Science 2026-03-30 Heng Guo , Jia Li , Yanan Wang , Fengxia Liu , Zhiyong Zheng , Kun Tian

Digital signatures are fundamental cryptographic primitives that ensure the authenticity and integrity of digital communication. However, in scenarios involving sensitive interactions -- such as e-voting or e-cash -- there is a growing need…

Cryptography and Security · Computer Science 2025-06-04 Shanu Poddar , Sweta Mishra , Tapaswini Mohanty , Vikas Srivastava , Sugata Gangopadhyay

Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…

Logic in Computer Science · Computer Science 2026-02-02 Amirhossein Akbar Tabatabai , Raheleh Jalali

Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication codes, secret sharing schemes and strongly regular graphs.…

Information Theory · Computer Science 2024-05-20 Shudi Yang , Tonghui Zhang , Zheng-An Yao

This paper introduces a novel cryptographic approach based on the continuous logarithm in the complex circle, designed to address the challenges posed by quantum computing. By leveraging its multi-valued and spectral properties, this…

Cryptography and Security · Computer Science 2025-01-22 Jaafar Gaber

We construct explicitly the quantization of classical linear maps of $SL(2, R)$ on toroidal phase space, of arbitrary modulus, using the holomorphic (chiral) version of the metaplectic representation. We show that Finite Quantum Mechanics…

High Energy Physics - Theory · Physics 2008-11-26 G. G. Athanasiu , E. G. Floratos , S. Nicolis

We construct a Hennings type logarithmic invariant for restricted quantum $\mathfrak{sl}(2)$ at a $2\mathsf{p}$-th root of unity. This quantum group $U$ is not braided, but factorizable. The invariant is defined for a pair: a 3-manifold $M$…

Geometric Topology · Mathematics 2018-12-19 Anna Beliakova , Christian Blanchet , Nathan Geer

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

Number Theory · Mathematics 2025-02-25 Guido Lido
‹ Prev 1 4 5 6 7 8 10 Next ›