Results 21 to 30 of about 39,607 (176)
, 2023 For a surjective self-morphism on a projective variety defined over a number field, we study the preimages question, which asks if the set of rational points on the iterated preimages of an invariant closed subscheme eventually stabilize. We prove the answer is positive for self-morphisms on $\mathbb{P}^1 \times \mathbb{P}^1$.
Matsuzawa, Yohsuke, Sano, Kaoru
openaire +2 more sources
Exploiting Weak Diffusion of Gimli: Improved Distinguishers and Preimage Attacks
IACR Transactions on Symmetric Cryptology, 2021 The Gimli permutation proposed in CHES 2017 was designed for cross-platform performance. One main strategy to achieve such a goal is to utilize a sparse linear layer (Small-Swap and Big-Swap), which occurs every two rounds.
Fukang Liu, Takanori Isobe, Willi Meier
doaj +1 more source
Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations [PDF]
, 2014 We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes.
A. Finkel +16 more
core +1 more source
Preimage Attacks on Some Hashing Modes Instantiating Reduced-Round LBlock
IEEE Access, 2018 In this paper, we present preimage attacks on several hashing modes instantiating reduced-round LBlock. It is observed that the omission of the network twist in the last round and the diffusion of the permutation in round function are the key points for ...
Shiwei Chen, Chenhui Jin
doaj +1 more source
Gift-wrapping based preimage computation algorithm [PDF]
Pattern Recognition, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gerard, Yan +2 more
openaire +2 more sources
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations
, 2020 Defant, Engen, and Miller defined a permutation to be uniquely sorted if it has exactly one preimage under West's stack-sorting map. We enumerate classes of uniquely sorted permutations that avoid a pattern of length three and a pattern of length four by
Mularczyk, Hanna
core +1 more source
Path tableaux and combinatorial interpretations of immanants for class functions on $S_n$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Let $χ ^λ$ be the irreducible $S_n$-character corresponding to the partition $λ$ of $n$, equivalently, the preimage of the Schur function $s_λ$ under the Frobenius characteristic map.
Sam Clearman +2 more
doaj +1 more source
Indifferentiable hash functions in the standard model
IET Information Security, 2021 Indifferentiability of iterated hash functions is seen as evidence that there are no structural flaws in the iteration structure of the algorithm. However, it is often overlooked that such considerations only hold in the random oracle model and do not ...
Juha Partala
doaj +1 more source
Rewriting Abstract Structures: Materialization Explained Categorically [PDF]
, 2019 The paper develops an abstract (over-approximating) semantics for double-pushout rewriting of graphs and graph-like objects. The focus is on the so-called materialization of left-hand sides from abstract graphs, a central concept in previous work.
Corradini, Andrea +4 more
core +2 more sources
Improved preimage and pseudo-collision attacks on SM3 hash function
Tongxin xuebao, 2018 A preimage attack on 32-step SM3 hash function and a pseudo-collision attack on 33-step SM3 hash function respectively were shown.32-step preimage attack was based on the differential meet-in-the-middle and biclique technique,while the previously known ...
Jian ZOU, Le DONG
doaj +2 more sources