scholarly journals The Compressed Storage in Time Memory Tradeoff Attack

2015 ◽  
Author(s):  
Lijun Zhang ◽  
Qingbing Ji ◽  
Fei Yu ◽  
Yu Zhou
Keyword(s):  
Compressed Storage ◽  
Time Memory Tradeoff

scholarly journals Analysis of the Perfect Table Fuzzy Rainbow Tradeoff

2014 ◽  
Vol 2014 ◽  
pp. 1-19 ◽  
Author(s):  
Byoung-Il Kim ◽  
Jin Hong
Keyword(s):  
Complexity Analysis ◽  
Digital Documents ◽  
Time Memory Tradeoff ◽  
Better Than ◽  
Do So

Cryptanalytic time memory tradeoff algorithms are tools for inverting one-way functions, and they are used in practice to recover passwords that restrict access to digital documents. This work provides an accurate complexity analysis of the perfect table fuzzy rainbow tradeoff algorithm. Based on the analysis results, we show that the lesser known fuzzy rainbow tradeoff performs better than the original rainbow tradeoff, which is widely believed to be the best tradeoff algorithm. The fuzzy rainbow tradeoff can attain higher online efficiency than the rainbow tradeoff and do so at a lower precomputation cost.

Password Recovery Research and its Future Direction

2012 ◽  
pp. 192-206
Author(s):  
Vrizlynn L. L. Thing ◽  
Hwei-Ming Ying
Keyword(s):  
Human Nature ◽  
Digital Forensics ◽  
The Other ◽  
Sorting Algorithm ◽  
Other Hand ◽  
Rainbow Table ◽  
Password Protection ◽  
Recovery Performance ◽  
Time Memory Tradeoff ◽  
Future Direction

As users become increasingly aware of the need to adopt strong password, it brings challenges to digital forensics investigators due to the password protection of potential evidentiary data. On the other hand, due to human nature and their tendency to select memorable passwords, which compromises security for convenience, users may select strong passwords by considering a permutation of dictionary words. In this chapter, the authors discuss the existing password recovery methods and identify promising password recovery approaches. They also present their previous work on the design of a time-memory tradeoff pre-computed table coupled with a new sorting algorithm, and its two new storage mechanisms. The results on the evaluation of its password recovery performance are also presented. In this chapter, the authors propose the design of a new password recovery table by integrating the construction of common passwords within the enhanced rainbow table to incorporate the two promising password recovery approaches. They then present the theoretical proof of the feasibility of this technique.

A parallel time-memory tradeoff attack on the Hill cipher

Cryptologia ◽  
2018 ◽  
Vol 42 (5) ◽  
pp. 408-426
Author(s):  
Tim McDevitt ◽  
Jessica Lehr ◽  
Ting Gu
Keyword(s):  
Parallel Time ◽  
Hill Cipher ◽  
Time Memory Tradeoff ◽  
The Hill

Fast Prediction of Temperature by FEM in Hot Strip Rolling

2012 ◽  
Vol 482-484 ◽  
pp. 616-620
Author(s):  
Rui Bin Mei ◽  
Ban Cai ◽  
Chang Sheng Li ◽  
Xiang Hua Liu
Keyword(s):  
Rolling Process ◽  
Computational Time ◽  
Hot Strip Rolling ◽  
Strip Rolling ◽  
Simulation Tools ◽  
Solution Of Equations ◽  
Compressed Storage ◽  
Capacity Matrix ◽  
Fast Prediction ◽  
Solution Efficiency

Finite element method (FEM) has been one of the most important numerical simulation tools with the development of computer technology. However, it is only used to simulate and analyze different process offline in many fields because of the longer computational time. The influencing factors of prediction of temperature in the strip rolling by FEM including equations, mesh and storage of matrix was investigated in the paper. The lumped heat capacity matrix was introduced to resolve the oscillation problem and improve precision. Furthermore, the refined elements layer upon layer was discussed to improve solution efficiency and precision. In addition, in order to improve the solution efficiency one dimensional compressed storage method was employed to carry out in the solution of equations. The FEM program code for the solution of temperature was embed in the online rolling control system program successfully. The predictive results are in good agreement with the measured value. The computational time and precision are satisfied in the strip rolling process.

Scalable and queryable compressed storage structure for raster data

2017 ◽  
Vol 72 ◽  
pp. 179-204 ◽  
Author(s):  
Susana Ladra ◽  
José R. Paramá ◽  
Fernando Silva-Coira
Keyword(s):  
Raster Data ◽  
Storage Structure ◽  
Compressed Storage

scholarly journals Mining Frequent Itemsets Without Candidate Generation In Machine Learning

2021 ◽  
Vol 12 (5) ◽  
pp. 1551-1558
Author(s):  
B. Satheesh, Et. al.
Keyword(s):  
Machine Learning ◽  
Time Series ◽  
Group Action ◽  
Associate Degree ◽  
Frequent Itemsets ◽  
Test Method ◽  
Frequent Patterns ◽  
Frequency Pattern ◽  
Compressed Storage ◽  
Mining Frequent Itemsets

Mining of regular trends in group action databases, time series databases, and lots of different database types was popularly studied in data processing research. Most previous studies follow the generation-and-test method of associate degree Apriori-like candidate collection. In this study, we seem to propose a particular frequency tree like structure, which is associated degree of prefix-tree like structure that is extended to be used for compressed storage, crucial knowledge of the frequency pattern, associated degrees create an economic FP-tree mining methodology, FP growth, by the growth of pattern fragments for the mining of the entire set of frequent patterns. Three different mining techniques are used to outsize the information which is compressed into small structures such as FP-tree that avoids repetitive information scans, cost. The proposed FP-tree-based mining receives an example philosophy of section creation to stay away from the exorbitant age of several competitor sets, and an apportioning-based, separating and-overcoming technique is used to divide the mining task into a contingent knowledge base for restricted mining designs that effectively reduces the investigation field.

Sign in / Sign up

Export Citation Format

Share Document