Results 71 to 80 of about 2,222 (156)
Homomorphic preimages of geometric paths
Discussiones Mathematicae Graph Theory, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Digital plane preimage structure [PDF]
Electronic Notes in Discrete Mathematics, 2003 Abstract In digital geometry, digital straightness is an important concept both for practical motivations and theoretical interests. Concerning the digital straightness in dimension 2, many digital straight line characterizations exist and the digital straight segment preimage is well known.
David Coeurjolly +4 more
openaire +2 more sources
Advanced Science, Volume 13, Issue 60, 28 October 2026.An electro‐templating strategy directs the relaxation of cholesteric finger loops into discrete concentric rings whose geometry is electrically programmed. The photopolymerized structures retain the topological defect pattern and, upon heating, show reversible, castle‐like surface modulation.
Jacques A. Peixoto +4 more
wiley +1 more source
Constructing Efficient Identity-Based Signatures on Lattices
IET Information SecurityIn this work, we explore the recent developments related to lattice-based signature and preimage sampling, and specify a compact identity-based signature (IBS) on an ideal lattice for practical use.
Huiwen Jia +3 more
doaj +1 more source
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, Volume 113, Issue 2, Page 169-194, October 2026.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
On digital plane preimage structure
, 2008 In digital geometry, digital straightness is an important concept both for practical motivations and theoretical interests. Concerning the digital straightness in dimension 2, many digital straight line characterizations exist and the digital straight ...
D. Coeurjolly A +3 more
core
Improved (Pseudo) Preimage Attack and Second Preimage Attack on Round-Reduced Grøstl [PDF]
, 2012 Grøstl is one of the five finalists in the third round of SHA-3 competition hosted by NIST. In this paper, we use many techniques to improve the pseudo preimage attack on Grøstl hash function, such as subspace preimage attack and guess-and-determine ...
Shuang Wu, Jian Zou, Wenling Wu, Le Dong
core +1 more source
New discretised polynomial expander and incidence estimates
Bulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.Abstract We present two applications of recent developments in incidence geometry. One is a δ$\delta$‐discretised version of a particular ‘Elekes–Rónyai’ expander problem. The second is an incidence estimate addressing the scenario in which both tubes, squares and their shadings satisfy non‐concentration assumptions.
Ciprian Demeter, William O'Regan
wiley +1 more source
Improved Preimage Attack on One-block MD4 [PDF]
, 2010 We propose an improved preimage attack on one-block MD4 with the time complexity $2^{94.98}$ MD4 compression function operations, as compared to $2^{107}$ in \cite{AokiS-sac08}.
Xuejia Lai, Jinmin Zhong
core +1 more source
Preimage and Collision Attacks on MD2 [PDF]
, 2005 This paper contains several attacks on the hash function MD2 which has a hash code size of 128 bits. At Asiacrypt 2004 Muller presents the first known preimage attack on MD2. The time complexity of the attack is about 2104 and the preimages consist always of 128 blocks.
Lars R. Knudsen, John Erik Mathiassen
openaire +2 more sources