Filters








15 Hits in 4.3 sec

Second Preimage Analysis of Whirlwind [chapter]

Riham AlTawy, Amr M. Youssef
2015 Lecture Notes in Computer Science  
In this paper, we evaluate the second preimage resistance of the Whirlwind hash function.  ...  Finally, by adopting another meet in the middle attack, we are able to generate n-block message second preimages of the 5 and 6-round reduced hash function with time complexity of 2 449 and 2 505 and memory  ...  The authors would like to thank the anonymous reviewers for their valuable comments and suggestions that helped improve the quality of the paper.  ... 
doi:10.1007/978-3-319-16745-9_17 fatcat:usi7fzjqebg5bfx36di6xvwe5u

Preimage Analysis of the Maelstrom-0 Hash Function [chapter]

Riham AlTawy, Amr M. Youssef
2015 Lecture Notes in Computer Science  
Maelstrom-0 is the second member of a family of AES-based hash functions whose designs are pioneered by Paulo Baretto and Vincent Rijmen.  ...  Using our approach, preimages of the 6-round reduced Maelstrom-0 hash function are generated with time complexity of 2 505 and memory complexity of 2 112 .  ...  This work is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC).  ... 
doi:10.1007/978-3-319-24126-5_7 fatcat:ik66ccianvblpmgsdxzbo5ttda

LOCHA: A Light-weight One-way Cryptographic Hash Algorithm for Wireless Sensor Network

Amrita Roy Chowdhury, Tanusree Chatterjee, Sipra DasBit
2014 Procedia Computer Science  
We claim the algorithm fulfils all the basic properties such as preimage resistance, collision resistance of a one-way unkeyed hash function.  ...  Finally the comparative usability of the hash algorithm in the said application domain is worked out and that shows the dominance of our scheme over two of the state-of-the-art hashing schemes.  ...  In security analysis, they have shown that the signature scheme is preimage and second preimage resistant.  ... 
doi:10.1016/j.procs.2014.05.453 fatcat:37avlf3rqzccdomufytcztjbre

Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes

Zhenzhen Bao, Lin Ding, Jian Guo, Haoyang Wang, Wenying Zhang
2020 IACR Transactions on Symmetric Cryptology  
To the best of our knowledge, these are the first preimage attacks against 8-round AES hashing modes.  ...  Sasaki in 2011, introduced the first preimage attack against AES hashing modes with the AES block cipher reduced to 7 rounds, by the method of meet-in-the-middle.  ...  Acknowledgments We thank Lei Wang for helpful discussions during the early phase of this work.  ... 
doi:10.46586/tosc.v2019.i4.318-347 fatcat:cjytpk6ikjg7rdj5wdy4tzobbm

Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes

Zhenzhen Bao, Lin Ding, Jian Guo, Haoyang Wang, Wenying Zhang
2020 IACR Transactions on Symmetric Cryptology  
To the best of our knowledge, these are the first preimage attacks against 8-round AES hashing modes.  ...  Sasaki in 2011, introduced the first preimage attack against AES hashing modes with the AES block cipher reduced to 7 rounds, by the method of meet-in-the-middle.  ...  Acknowledgments We thank Lei Wang for helpful discussions during the early phase of this work.  ... 
doi:10.13154/tosc.v2019.i4.318-347 dblp:journals/tosc/BaoDGWZ19 fatcat:sw6m76lsufgt3ho5cwy4mdkhty

Coalescence under Preimage Constraints [article]

Benjamin Otto
2019 arXiv   pre-print
The primary goal of this document is to record the asymptotic effects that preimage constraints impose upon the sizes of the iterated images of a random function.  ...  The robust theory of singularity analysis allows one to completely answer this question if one accepts that 0∈P, that P contains an element bigger than 1, and that (P)=1; only the third of these conditions  ...  Acknowledgments The author is grateful to a number of people, most especially to Cheyne Homberger for several illuminating discussions and to Art Drisko and Art Pittenger for careful comments on an earlier  ... 
arXiv:1903.00542v1 fatcat:kdj46uoc6bhvlj7bfqjiw2utra

A Meet in the Middle Attack on Reduced Round Kuznyechik

Riham ALTAWY, Amr M. YOUSSEF
2015 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
For the 5-round reduced cipher, the 256-bit master key is recovered with a time complexity of 2 140.3 , a memory complexity of 2 153.3 , and a data complexity of 2 113 .  ...  The adopted partial sequence matching approach enables successful key recovery by matching parts of the generated sequence instead of the full sequence matching used in the traditional settings of this  ...  Additionally, MitM preimage attacks on hash functions have been presented on HAS-160 [17] , Whirlpool [22] , Whirlwind [5] , and Streebog [4] .  ... 
doi:10.1587/transfun.e98.a.2194 fatcat:t67kextbdzbc3caw4l7odk7jxa

Exhaustion and Recycling

Attila Simon
2021 Central European Cultures  
They reuse certain elements of the myth in order to address some of the crucial issues of cultural transmission: interpretation, poetic tradition and communication.  ...  This paper examines the works of representative modernist authors who have rewritten the myth of the Danaids in a self-reflective way.  ...  interpretation only appears in the "analysis" of names.  ... 
doi:10.47075/cec.2021-2.04 fatcat:iqcxjrm2ffa25aftxwbgyt5xoi

Lecture Notes on General Relativity [article]

Sean M. Carroll
1997 arXiv   pre-print
These notes represent approximately one semester's worth of lectures on introductory general relativity for beginning graduate students in physics.  ...  For some subset U ⊂ N, the set of elements of M which get mapped to U is called the preimage of U under φ, or φ −1 (U).  ...  Special Relativity and Flat Spacetime We will begin with a whirlwind tour of special relativity (SR) and life in flat spacetime.  ... 
arXiv:gr-qc/9712019v1 fatcat:gldkw5tatncqzaoxppnwivoxge

The Chabauty-Kim Method for Relative Completions [article]

Noam Kantor
2020 arXiv   pre-print
In this thesis we develop a Chabauty-Kim theory for the relative completion of motivic fundamental groups, including Selmer stacks and moduli spaces of admissible torsors for the relative completion of  ...  On the other hand, the unipotent part provides a natural extension of the recent work of Lawrence and Venkatesh.  ...  The reader is directed to the invaluable works [80] and [79] for a highlevel (and highly homotopical) analysis of relative Malcev completions of fundamental groups.  ... 
arXiv:2006.10725v1 fatcat:npzybourc5bydk4snuoelpqsmq

Topological Modeling for Vector Graphics

Boris Dalstein, Jim Foley
2019 IEEE Computer Graphics and Applications  
I conducted most of the theoretical analysis and derivations, and wrote the manuscript. Michiel van de Panne provided  ...  Second, based on this theoretical understanding, we introduce the vector graphics complex (VGC) as a simple data structure that supports fundamental topological modeling operations for vector graphics  ...  the Whirlwind project a few years earlier.  ... 
doi:10.1109/mcg.2019.2891277 fatcat:cevdtpwzd5gejia5kgh63bwidi

The Algebra of Open and Interconnected Systems [article]

Brendan Fong
2016 arXiv   pre-print
To illustrate these principles, the second part of this thesis details applications to linear time-invariant dynamical systems and passive linear networks.  ...  The first part of this thesis develops the theory of hypergraph categories. In particular, we introduce the tools of decorated cospans and corelations.  ...  The main idea is that composition glues together any pair of terminal that have the same preimage under the cospan maps.  ... 
arXiv:1609.05382v1 fatcat:rxuhgb2ub5c67otn5ij2y7g6iq

Using blockchain technology to enable reproducible science [article]

Nicholas Pritchard
2021
of Western Australia and where applicable, any partner institution responsible for the joint-award of this degree.  ...  In the future, no part of this thesis will be used in a submission in my name, for any other degree or diploma in any university or other tertiary institution without the prior approval of The University  ...  More specifically, a proper hashing function has: • Preimage resistance -The function is one-way, meaning it is computationally infeasible to find the input that produced a given digest. • Second preimage  ... 
doi:10.26182/vp42-zr06 fatcat:ejufrbnuwjfx5kk5zlfjhaalz4

Investigations of Metrology in Optomechanics and Quantum Information Theory [article]

Ruvindha Lecamwasam, University, The Australian National
2021
This analysis is then applied to a variety of experimental schemes including two-laser cooling, and a detailed investigation of photothermal effects.  ...  We introduce a new quantity, the coherence of encoding, which quantifies how much information is lost due to choice of projective measurement basis, and apply this to derive new bounds on the error of  ...  -Veeravalli Varadarajan, Geometry of Quantum Theory This chapter provides a whirlwind tour of optics and optomechanics.  ... 
doi:10.25911/7exv-5s17 fatcat:kdrvsrhxjjgqvm2n6inbotpztu

Archive and Trace - Curating as Co-belonging

VICTORIA LYNN
2020
This exegesis considers the concepts of archive and trace in contemporary art practice through the frame of two exhibitions that I have curated: TarraWarra International 2017: All that is solid... and  ...  I argue that, in the light of the ways in which these artists approach the many components and fragments that make up their artworks, contemporary curating can be seen as a form of "co-belonging", a term  ...  It is instead an anxious gaze, a journey fraught with a set of what the artist terms 'preimages'.  ... 
doi:10.26180/5ecb2f832ca49 fatcat:ecwa36ye6zgkzhpvrxzk4s5una