Search
Search Results
-
Linear Space Data Structures for Finite Groups with Constant Query-Time
A finite group of order n can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order n can be stored using
... -
Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures
We consider a generalization of group testing where the potentially contaminated sets are the members of a given hypergraph...
-
Lagrangian Trajectories and Closure Models in Mixed Quantum-Classical Dynamics
Mixed quantum-classical models have been proposed in several contexts to overcome the computational challenges of fully quantum approaches. However,...
-
Sequences with ideal auto-correlation derived from group actions
Bent functions have a number of practical applications in cryptography, coding theory, and other fields. Fourier transform is a key tool to study...
-
Uncertainty Modeling for Group Re-Identification
Group re-identification (GReID) aims to correctly associate images containing the same group members captured with non-overlap** camera networks,...
-
Updatable Encryption from Group Actions
Updatable Encryption (UE) allows to rotate the encryption key in the outsourced storage setting while minimizing the bandwith used. The server can...
-
Cutting the GRASS: Threshold GRoup Action Signature Schemes
Group actions are fundamental mathematical tools, with a long history of use in cryptography. Indeed, the action of finite groups at the basis of the...
-
-
Improved parallel finite element methods for the stationary Navier–Stokes problem
In this study, two improved parallel finite element algorithms based on two-grid strategies are developed to approximate the stationary Navier–Stokes...
-
Results on the Key Space of Group-Ring NTRU: The Case of the Dihedral Group
NTRU-like schemes are among the most studied lattice-based cryptosystems. Since the first scheme was introduced, many variants of NTRU have been...
-
Generic Models for Group Actions
We define the Generic Group Action Model (GGAM), an adaptation of the Generic Group Model to the setting of group actions (such as CSIDH). Compared...
-
Solving systems of algebraic equations over finite commutative rings and applications
Several problems in algebraic geometry and coding theory over finite rings are modeled by systems of algebraic equations. Among these problems, we...
-
Abelian and consta-Abelian polyadic codes over affine algebras with a finite commutative chain coefficient ring
This paper studies Abelian and consta-Abelian polyadic codes over rings defined as affine algebras over chain rings. For this purpose, we use the...
-
Classification of spinal curvature types using radiography images: deep learning versus classical methods
Scoliosis is a spinal abnormality that has two types of curves (C-shaped or S-shaped). The vertebrae of the spine reach an equilibrium at different...
-
Time-Optimal Design of Finite Field Arithmetic for SIKE on Cortex-M4
The advances in quantum technologies and the fast move toward quantum computing are threatening classical cryptography and urge the deployment of...
-
An overview of consensus models for group decision-making and group recommender systems
Group decision-making processes can be supported by group recommender systems that help groups of users obtain satisfying decision outcomes. These...
-
Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields
Consider the problem of efficiently evaluating isogenies $$\phi : \mathcal...
-
Classical and Quantum Security of Elliptic Curve VRF, via Relative Indifferentiability
Verifiable random functions ( VRFs ) are essentially pseudorandom functions for which selected outputs can be proved correct and unique, without...
-
An Efficient Strong Asymmetric PAKE Compiler Instantiable from Group Actions
Password-authenticated key exchange (PAKE) is a class of protocols enabling two parties to convert a shared (possibly low-entropy) password into a...