Smooth functions with simple structures on 3-dimensional closed manifolds with prescribed Reeb graphs and preimages [PDF]
arXiv, 2021 We give a new answer to so-called realization problems of graphs as Reeb graphs of smooth functions with prescribed preimages of regular values having nice structures. We present a best possible answer for functions on 3-dimensional closed manifolds. The Reeb space of a smooth function is the quotient space of the manifold of the domain induced from ...
arxiv
Hash function based on arithmetic coding and public-key cryptography [PDF]
arXiv, 2010 We propose a hash function based on arithmetic coding and public-key cryptography. The resistance of the hash function to second preimage attack, collision and differential cryptanalysis is based on the properties of arithmetic coding as a non-linear dynamical system.
arxiv
Preimage attacks on reduced‐round Keccak hash functions by solving algebraic systems [PDF]
, 2022 Junling Pei, Lusheng Chen
openalex +1 more source
RankSign: an efficient signature algorithm based on the rank metric [PDF]
arXiv, 2016 In this paper we propose a new approach to code-based signatures that makes use in particular of rank metric codes. When the classical approach consists in finding the unique preimage of a syndrome through a decoding algorithm, we propose to introduce the notion of mixed decoding of erasures and errors for building signature schemes.
arxiv
Enhancing SAT solvers with glue variable predictions [PDF]
arXiv, 2020 Modern SAT solvers routinely operate at scales that make it impractical to query a neural network for every branching decision. NeuroCore, proposed by Selsam and Bjorner, offered a proof-of-concept that neural networks can still accelerate SAT solvers by only periodically refocusing a score-based branching heuristic.
arxiv
A Genetic Algorithm Enabled Similarity-Based Attack on Cancellable Biometrics [PDF]
10th IEEE International Conference on Biometrics: Theory,
Applications and Systems (BTAS),23-26 September 2019, Tampa, Florida, 2019 Cancellable biometrics (CB) as a means for biometric template protection approach refers to an irreversible yet similarity preserving transformation on the original template. With similarity preserving property, the matching between template and query instance can be performed in the transform domain without jeopardizing accuracy performance ...
arxiv
Preimage entropy dimension of topological dynamical systems [PDF]
arXiv, 2014 We propose a new definition of preimage entropy dimension for continuous maps on compact metric spaces, investigate fundamental properties of the preimage entropy dimension, and compare the preimage entropy dimension with the topological entropy dimension.
arxiv
Wave: A New Family of Trapdoor One-Way Preimage Sampleable Functions Based on Codes [PDF]
arXiv, 2018 We present here a new family of trapdoor one-way Preimage Sampleable Functions (PSF) based on codes, the Wave-PSF family. The trapdoor function is one-way under two computational assumptions: the hardness of generic decoding for high weights and the indistinguishability of generalized $(U,U+V)$-codes. Our proof follows the GPV strategy [GPV08].
arxiv
Preimage Cardinalities of Continuous Functions [PDF]
arXiv, 2020 We find all subsets of $\mathbb{N}$ which occur as the set of possible cardinalities of preimages of a continuous function. We also study and answer this question for various subclasses of continuous functions.
arxiv
Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes [PDF]
, 2020 Zhenzhen Bao +4 more
openalex +3 more sources