87 Hits in 3.7 sec

Breaking DVB-CSA [chapter]

Erik Tews, Julian Wälde, Michael Weiner
2012 Lecture Notes in Computer Science  
We first propose a method to identify plaintexts in an encrypted transmission and then use a precomputed rainbow table to recover the corresponding keys.  ...  The attack can be executed on a standard PC, and the precomputations can be accelerated using GPUs.  ...  These so called compute units provide only limited amounts of fast memory/cache suited for lookup tables.  ... 
doi:10.1007/978-3-642-34159-5_4 fatcat:3wnyrrbgybej5c35uasdsgjoxy

Breaking GSM with rainbow Tables [article]

Steven Meyer
2011 arXiv   pre-print
encryption in 30 seconds with 200'000 hardware and precomputed rainbow tables.  ...  Since 1998 the GSM security has been academically broken but no real attack has ever been done until in 2008 when two engineers of Pico Computing (FPGA manufacture) revealed that they could break the GSM  ...  To understand Rainbow tables it is important to understand precomputed tables .  ... 
arXiv:1107.1086v1 fatcat:i6puldwdgbaonlhv4n73eu7rn4

Heterogeneous Rainbow Table Widths Provide Faster Cryptanalyses

Gildas Avoine, Xavier Carpent
2017 Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security - ASIA CCS '17  
We stress that the optimal width of each rainbow table should be individually -although not independently -calculated. So it goes for the memory allocated to each table.  ...  We demonstrate in this paper that rainbow tables are underexploited due to this assumption never being challenged.  ...  This assumption has never been challenged since the original publication of rainbow tables.  ... 
doi:10.1145/3052973.3053030 dblp:conf/ccs/AvoineC17 fatcat:esihh2cr3vcevjtqfcdhs4zvji

How to Handle Rainbow Tables with External Memory [chapter]

Gildas Avoine, Xavier Carpent, Barbara Kordy, Florent Tardif
2017 Lecture Notes in Computer Science  
Such a technique requires large-scale precomputation that is performed once for all and whose result is stored in a fast-access internal memory.  ...  In this paper, we consider the rainbow tables -the most widely spread version of time-memory trade-offs.  ...  This work has been partly supported by the COST Action IC1403 (Cryptacus). Xavier Carpent was supported, in part, by a fellowship of the Belgian American Educational Foundation.  ... 
doi:10.1007/978-3-319-60055-0_16 fatcat:ymnf576irfeqjhk654ptxea2ba

Improving the Rainbow Attack by Reusing Colours [chapter]

Martin Ågren, Thomas Johansson, Martin Hell
2009 Lecture Notes in Computer Science  
Existing techniques include the Hellman attack and the rainbow attack, where the latter uses different reduction functions ("colours") within a table.  ...  ., repeating the reduction functions, in the rainbow attack. We show how this outperforms the Hellman and the rainbow attack in a model of fixed resources.  ...  The precomputation is large, but similar for all different attacks, so we do not consider this part in detail.  ... 
doi:10.1007/978-3-642-10433-6_24 fatcat:ybq34u7zcrggpofx2h4ruivesm

Improved Time-Memory Trade-Offs with Multiple Data [chapter]

Alex Biryukov, Sourav Mukhopadhyay, Palash Sarkar
2006 Lecture Notes in Computer Science  
Finally we consider the analysis of the rainbow method of Oechslin and show that for multiple data, the TMTO curve of the rainbow method is inferior to the TMTO curve of the Hellman method.  ...  For example, AES with 128-bit key has only 85-bit security if 2 43 encryptions of an arbitrary fixed text under different keys are available to the attacker.  ...  So far, it has been believed that any multiple data TMTO is either BG or BS.  ... 
doi:10.1007/11693383_8 fatcat:o2qo4l7qhrbfxe5nyt23dx267m

Optimization of hologram computation for real-time display

Mark E. Lucente, Stephen A. Benton
1992 Practical Holography VI  
An order of magnitude speed increase is obtained through the use of precomputed look-up tables containing a large array of elemental interference patterns corresponding to point source contributions from  ...  RESULTS Using the methods of bipolar intensity summation and precomputed elemental fringe patterns, hologram computation has been implemented for use in the MIT real-time display system.  ...  One way to reduce the size of the tables is to precompute values for each ∆ x (x ; x p ) rather than for each x and each x p . In this way, the tables are reduced to rank two.  ... 
doi:10.1117/12.59617 fatcat:2ywmt2qobzel7jrwfouqwksp7q

A Comparison of Cryptanalytic Tradeoff Algorithms

Jin Hong, Sunghwan Moon
2012 Journal of Cryptology  
Specifically, the classical tradeoff algorithm by Hellman, the distinguished point tradeoff method, and the rainbow table method, in their non-perfect table versions, are treated.  ...  The analysis of tradeoff efficiency presented in this paper does not ignore the effects of false alarms and also covers techniques for reducing storage, such as ending point truncations and index tables  ...  The table lookup is repeatedly done for each recursively computed y k j = F k (y k j−1 ), until y k t = F t k (x) has been searched for in the table.  ... 
doi:10.1007/s00145-012-9128-3 fatcat:63tq6ittvngwti2zjjiu7hvn4i

SSE Implementation of Multivariate PKCs on Modern x86 CPUs [chapter]

Anna Inn-Tung Chen, Ming-Shing Chen, Tien-Ren Chen, Chen-Mou Cheng, Jintai Ding, Eric Li-Hsiang Kuo, Frost Yu-Shuang Lee, Bo-Yin Yang
2009 Lecture Notes in Computer Science  
It also has been known for efficiency compared to "traditional" alternatives.  ...  For example, Rainbow over F31 can be up to 2× faster than prior implementations of similarly-sized systems over F16.  ...  CC thanks the National Science Council of Taiwan for support under grants NSC 97-2628-E-001-010-and Taiwan Information Security Center (grant 98-2219-E-011-001), BY for grant NSC 96-2221-E-001-031-MY3.  ... 
doi:10.1007/978-3-642-04138-9_3 fatcat:6r4oljnu2fakvnmpykjoavaf3q

Performance Evaluation of Android Pattern Authentication Systems

Robert Wang, Stephan Chan, Yung-Cheng Chang
2019 Zenodo  
Mobile security is critical today as the usage of mobile devices has been increasing; consequently mobile security becomes more crucial.  ...  But these systems are not safe, and are subjected to pre-computation attacks like dictionaries, rainbow tables and brute-force attacks.  ...  This pepper value always prevents the pattern passwords from precomputations such as dictionary and rainbow table attacks and brute-forcing.  ... 
doi:10.5281/zenodo.3774820 fatcat:i7chpcedtrfojpmwrfhue5o7ty

Adaptive Spectral Mapping for Real-Time Dispersive Refraction [chapter]

Damon Blanchette, Emmanuel Agu
2012 Lecture Notes in Computer Science  
A great thanks goes to Professor Matthew Ward for agreeing to be the reader for this thesis.  ...  One of these effects is dispersion, the phenomenon that creates a rainbow when white light shines through a prism.  ...  Before splatting, the totals are scaled so all dispersed waves are not bright white. Table 3 : 3 Frame rates for each test object.  ... 
doi:10.1007/978-3-642-33179-4_9 fatcat:y6c2nedsyzf7lbqrxtsjfzon3q

Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs [chapter]

Elad Barkan, Eli Biham, Adi Shamir
2006 Lecture Notes in Computer Science  
The evolution of a path in the stateful random graph depends on a hidden state such as the color in the Rainbow scheme or the table number in the classical Hellman scheme.  ...  These bounds hold for an overwhelming majority of the functions f , and their proofs are based on a rigorous combinatorial analysis.  ...  Acknowledgements We would like to thank Joel Spencer for his contribution to the proof of the single table coverage bound in 1981, and Eran Tromer for his careful review and helpful comments on earlier  ... 
doi:10.1007/11818175_1 fatcat:5rfdibzlfbeenni7fh6wucarw4

Compact Dilithium Implementations on Cortex-M3 and Cortex-M4

Denisa O. C. Greconici, Matthias J. Kannwischer, Daan Sprenkels
2020 Transactions on Cryptographic Hardware and Embedded Systems  
For Dilithium3, we achieve on average 2 562 kilocycles for key generation, 10 667 kilocycles for signing, and 2 321 kilocycles for verification.Additionally, we present stack consumption optimizations  ...  We present three different strategies for the signing procedure which allow trading more stack and flash memory for faster speed or viceversa.  ...  Acknowledgements This work has been supported by the European Commission through the ERC Starting Grant 805031 (EPOQUE).  ... 
doi:10.46586/tches.v2021.i1.1-24 fatcat:kzlbjzxvojdmzl5cnqcqtf6vam

A Bitslice Implementation of Anderson's Attack on A5/1

Vadim Bulavintsev, Alexander Semenov, Oleg Zaikin, Stepan Kochemazov
2018 Open Engineering  
The A5/1 keystream generator is a part of Global System for Mobile Communications (GSM) protocol, employed in cellular networks all over the world.  ...  To test the performance of the implementation, a volunteer computing project was launched. 10 instances of A5/1 cryptanalysis have been successfully solved in this project in a single week.  ...  The most practical method for A5/1 cryptanalysis is based on the use of the so-called Rainbow tables [1] .  ... 
doi:10.1515/eng-2018-0002 fatcat:m6lwb74w2jelfhuxs6rlz74b7a

Grand Challenges in Satellite Remote Sensing

Oleg Dubovik, Gregory L. Schuster, Feng Xu, Yongxiang Hu, Hartmut Bösch, Jochen Landgraf, Zhengqiang Li
2021 Frontiers in Remote Sensing  
For example, new algorithms tend to rely upon fast and accurate atmospheric modeling (instead of using precomputed Look-Up-Tables, or LUT) and are capable of retrieving a large number of parameters.  ...  never been flown in space before (Illingsworth et al., 2015) .  ...  polarimeter HIRS high-resolution infrared radiation sounder IASI infrared atmospheric sounding interferometer IMG interferometric monitor for greenhouse gases LEO low earth orbit LUT look-up-tables LPP  ... 
doi:10.3389/frsen.2021.619818 fatcat:ty6etuacnzg7xilcz3m3ilxlne
« Previous Showing results 1 — 15 out of 87 results