Results 51 to 60 of about 2,222 (156)
ABSTRACT We show that the percentile–percentile (P–P) process constructed from an independent and identically distributed sample of pairs converges in distribution in L1[0,1]$$ {L}^1\left[0,1\right] $$ if and only if the associated P–P curve is absolutely continuous.
Brendan K. Beare, Tetsuya Kaji
wiley +1 more source
Local multiplicativity of perverse filtrations
Abstract Let f:S→C$f:S\rightarrow C$ be a proper surjective morphism from a smooth Kähler surface to a smooth curve. We show that the local perverse filtration associated with the induced map S[n]→C(n)$S^{[n]}\rightarrow C^{(n)}$ is multiplicative on each fiber if and only if f$f$ is an elliptic fibration.
Zili Zhang
wiley +1 more source
Hash function requirements for Schnorr signatures
We provide two necessary conditions on hash functions for the Schnorr signature scheme to be secure, assuming compact group representations such as those which occur in elliptic curve groups. We also show, via an argument in the generic group model, that
Neven Gregory +2 more
doaj +1 more source
A preimage attack on reduced GIMLI‐HASH with unbalanced squeezing phase
In Conference on Cryptographic Hardware and Embedded System 2017, Bernstein et al. proposed GIMLI, a 384‐bit permutation with 24 rounds, which aims to provide high performance on various platforms.
Yongseong Lee +3 more
doaj +1 more source
Context‐free graphs and their transition groups
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
Higher-Order Differential Meet-in-the-middle Preimage Attacks on SHA-1 and BLAKE [PDF]
International audienceAt CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulation of advanced meet-in-the-middle techniques for preimage attacks on hash functions.
Thomas Espitau +5 more
core +2 more sources
Implementation and Optimization of Zero-Knowledge Proof Circuit Based on Hash Function SM3
With the increasing demand for privacy protection in the blockchain, the universal zero-knowledge proof protocol has been developed and widely used. Because hash function is an important cryptographic primitive in a blockchain, the zero-knowledge proof ...
Yang Yang +7 more
doaj +1 more source
The Legendrian Hopf link has exactly two Lagrangian fillings
Abstract We prove that there are precisely two embedded exact Lagrangian fillings of the standard Legendrian Hopf link, up to compactly supported Hamiltonian isotopy. It was known that the standard Legendrian Hopf link admitted at least two such Lagrangian fillings: we show these are all.
Bryce Thomson
wiley +1 more source
Preimage and pseudo-collision attacks on 29-step SM3 hash function with padding
The security of SM3 hash function was revaluated by using the meet-in-the-middle attack. The preimage and pseudo-collision attack on 29-step SM3 hash function (from the 1-st step) with padding was presented.
Gao-li WANG, Yan-zhao SHEN
doaj +2 more sources
On Radical of Intuitionistic Fuzzy Primary Submodule
In this paper, we further study the theory of Intuitionistic fuzzy submodules and we will define intuitionistic fuzzy primary submodule with the help of the definition of a radical submodule, and we also study the properties of these submodules ...
Abbas Taherpour +3 more
doaj +1 more source

