Filters








562 Hits in 4.4 sec

Page 4264 of Mathematical Reviews Vol. , Issue 94g [page]

1994 Mathematical Reviews  
Then, we show that with replacing a two-fold composition of one of the pseudorandom functions instead of the other one it is possible to construct a super pseudorandom permutation from a single pseudorandom  ...  (5-WLG-C; Wollongong) A construction for super pseudorandom permutations from a single pseudorandom function.  ... 

Feistel Networks Made Public, and Applications [chapter]

Yevgeniy Dodis, Prashant Puniya
2007 Lecture Notes in Computer Science  
In essence, our results show that in any such scenario a super-logarithmic number of Feistel rounds is necessary and sufficient to guarantee security.  ...  Feistel Network, consisting of a repeated application of the Feistel Transform, gives a very convenient and popular method for designing "cryptographically strong" permutations from corresponding "cryptographically  ...  Acknowledgments: We would like to thank Rafail Ostrovsky and Shabsi Walfish for several helpful discussions.  ... 
doi:10.1007/978-3-540-72540-4_31 fatcat:74xqfotbbfcubkilau332ltgpi

Eliminating Random Permutation Oracles in the Even-Mansour Cipher [chapter]

Craig Gentry, Zulfikar Ramzan
2004 Lecture Notes in Computer Science  
Finally, if only three Feistel rounds are used, the resulting cipher is pseudorandom, but not super pseudorandom.  ...  One can achieve a two-fold and four-fold reduction respectively in the amount of key material by a closer inspection of the proof and by instantiating the scheme using group operations other than exclusive-OR  ...  Finally, if we instantiate the permutation with three Feistel rounds, the construction is pseudorandom, but is not super pseudorandom.  ... 
doi:10.1007/978-3-540-30539-2_3 fatcat:jazu5seexvd55hch5r27tirhr4

Efficient Constructions of Variable-Input-Length Block Ciphers [chapter]

Sarvar Patel, Zulfikar Ramzan, Ganapathy S. Sundaram
2004 Lecture Notes in Computer Science  
The first construction converts it to a VIL PRP and is an efficiency improvement over the scheme of Bellare and Rogaway [4] .  ...  The second construction converts it to a VIL super pseudorandom permutation (SPRP) -that is, the resulting VIL block cipher is indistinguishable from a random permutation against adaptive chosen plaintext  ...  Luby and Rackoff [15] also considered the notion of a super pseudorandom permutation (SPRP).  ... 
doi:10.1007/978-3-540-30564-4_23 fatcat:nba4qytunjdhldsgw4zqqbdh4e

Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks [chapter]

Yevgeniy Dodis, Krzysztof Pietrzak
2010 Lecture Notes in Computer Science  
In this paper we prove positive and negative results about the feasibility of constructing leakage-resilient pseudorandom functions and permutations (i.e. block-ciphers).  ...  This complements the result from the previous item showing that a super-constant number of rounds is necessary. 1 If the power-analysis just leaks the number of wires set to 1, then this is captured, but  ...  A sufficient (but not necessary) condition on the side-channel is to require that (1) the amount of information leaked per invocation (or, in the fine-grained approach, per step) is at most λ bits and  ... 
doi:10.1007/978-3-642-14623-7_2 fatcat:nkm4mmha75cgvafebr22i4be2m

Page 2505 of Mathematical Reviews Vol. , Issue 95d [page]

1995 Mathematical Reviews  
Block ciphers—foundations and analysis (5 papers, including the following): Babak Sadeghiyan and Josef Pieprzyk, On necessary and sufficient conditions for the construction of super pseudorandom permutations  ...  (194-209); Shimon Even and Yishay Mansour, A construction of a cipher from a single pseudorandom permutation (210-224); Session 7.  ... 

Cryptography with Streaming Algorithms [chapter]

Periklis A. Papakonstantinou, Guang Yang
2014 Lecture Notes in Computer Science  
For possibility results, assuming the existence of one-way functions computable in NC 1 -e.g. factoring, lattice assumptions-we obtain streaming algorithms computing one-way functions and pseudorandom  ...  We put forth the question of whether cryptography is feasible using streaming devices. We give constructions and prove lower bounds.  ...  discussions on the PRG construction, to Frederic Magniez for thought-provoking discussions on the "folk wisdom" regarding the multi-stream model, and to Vinod Vaikuntanathan for the helpful remarks.  ... 
doi:10.1007/978-3-662-44381-1_4 fatcat:gtjuz4j56zhhtc4ejhv5xzuqjq

Pseudorandomness of Basic Structures in the Block Cipher KASUMI

Ju-Sung Kang, Bart Preneel, Heuisu Ryu, Kyo Il Chung, Chee Hang Park
2003 ETRI Journal  
Iwata et al. [9] and Gilbert and Minier [7] also independently proved that the five-round MISTY-type yields a super-pseudorandom permutation.  ...  Recently, Iwata et al. [10] provided an improved result on the super-pseudorandomness of the MISTY-type transformation by proving that the second round permutation in the five-round MISTY-type transformation  ...  ACKNOWLEDGEMENTS Thanks to Tetsu Iwata for pointing out some flaws in the proof of Theorem 1 of [12] . We also appreciate the anonymous referees' valuable comments.  ... 
doi:10.4218/etrij.03.0102.0210 fatcat:ei45bb3zrzawnms2s6oyeupupe

Computational Extractors and Pseudorandomness [chapter]

Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin
2012 Lecture Notes in Computer Science  
We study the necessity of one-way functions in the construction of computational extractors and determine matching lower and upper bounds on the "black-box efficiency" of generic constructions of computational  ...  for generic constructions of computational extractors and confirming the intuition that to build a computational extractor via a PRG one needs to make up for the entropy gap intrinsic to statistical extractors  ...  Using the results of [Gol90, HILL99] , constructing such a pair of distributions is sufficient to construct pseudorandom generators (PRG). This in turn implies the existence of OWF.  ... 
doi:10.1007/978-3-642-28914-9_22 fatcat:x3dlclzc5bfrdjr4mwsqa33kni

Towards a Theory of Extractable Functions [chapter]

Ran Canetti, Ronny Ramzi Dakdouk
2009 Lecture Notes in Computer Science  
Other questions, such as constructing extractable pseudorandom generators from extractable one way functions, remain open.  ...  Examples include reductions from extractable weak one-way functions to extractable strong ones, from extractable pseudorandom generators to extractable pseudorandom functions, and from extractable one-way  ...  So, we address the issue of amplifying extraction. We show how to do so under a necessary (for the class of injective functions) and sufficient assumption on the function.  ... 
doi:10.1007/978-3-642-00457-5_35 fatcat:zgu5ebozurdqvanv4er47a3sfq

Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks [chapter]

Benoît Cogliati, Yevgeniy Dodis, Jonathan Katz, Jooyoung Lee, John Steinberger, Aishwarya Thiruvengadam, Zhe Zhang
2018 Lecture Notes in Computer Science  
When the permutation step is linear (which is the case for most existing designs), we show that 3 SPN rounds are necessary and sufficient for security.  ...  As an application, our construction can turn two public n-bit permutations (or fixed-key block ciphers) into a tweakable block cipher working on wn-bit inputs, 6n-bit key and an n-bit tweak (for any w  ...  The work of Yevgeniy Dodis was done in part while visiting the University of Maryland, and was supported by gifts from VMware Labs and Google, as well as NSF grants 1619158, 1319051, and 1314568.  ... 
doi:10.1007/978-3-319-96884-1_24 fatcat:u7z372fmpfd33k65wn3lvra5qy

Implementing Huge Sparse Random Graphs [chapter]

Moni Naor, Asaf Nussboim
2007 Lecture Notes in Computer Science  
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size.  ...  We cover a wide range of densities including random graphs' famous threshold density for containing a giant component (p ∼ 1/N ), and for achieving connectivity (p ∼ ln N/N ).  ...  We thank Gil Segev, Noam Livne and the anonymous referees for carefully reading and commenting on a draft of this paper.  ... 
doi:10.1007/978-3-540-74208-1_43 fatcat:tumvviftkng2dld5r4hvnoxvea

Permutation Generators Based on Unbalanced Feistel Network: Analysis of the Conditions of Pseudorandomness [article]

Kwangsu Lee
2017 arXiv   pre-print
A block cipher is a principle component in a cryptosystem because the security of a cryptosystem depends on the security of a block cipher.  ...  One way to construct block ciphers with large input-output size is to use an unbalanced Feistel network that is the generalization of a previous Feistel network.  ...  Analysis of Unbalanced Feistel Networks In this chapter, we analyze the conditions for permutation generators based on Feistel networks to be pseudorandom. This chapter is summarized as follows.  ... 
arXiv:1703.08306v1 fatcat:ejrsugr5orhsrcr3p7cjnyp7cm

Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers [article]

Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein
2022 arXiv   pre-print
A shallow, O(log n)-depth cipher of the type described here can be used in constructing a polynomial-overhead scheme for computation on encrypted data proposed in another publication as an alternative  ...  We argue that these conditions can be satisfied by n-bit block ciphers implemented via random reversible circuits with O(n log n) gates arranged on a tree structure, with layers of n/3 3-bit gates, for  ...  ACKNOWLEDGMENTS The authors would like to thank Shiyu Zhou and Luowen Qian for useful discussions at the early stages of this paper, and Ran Canetti for many enlightening conversations and for stimulating  ... 
arXiv:2011.06546v3 fatcat:ihqeh7gjh5bbnlacvg67tkck7m

Deterministic Sparse Fourier Transform with an 𝓁_{∞} Guarantee

Yi Li, Vasileios Nakos, Emanuela Merelli, Anuj Dawar, Artur Czumaj
2020 International Colloquium on Automata, Languages and Programming  
Our first construction matches a previous randomized construction of Nelson, Nguyen and Woodruff (RANDOM'12), where there was no constraint on the form of the incoherent matrix.  ...  We focus on the stronger 𝓁_∞/𝓁₁ guarantee and the closely related problem of incoherent matrices.  ...  , under the pseudorandom permutations.  ... 
doi:10.4230/lipics.icalp.2020.77 dblp:conf/icalp/0002N20 fatcat:sjemergttbdufhmba6cwbotwnm
« Previous Showing results 1 — 15 out of 562 results