Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
51
Analysis of the Non-Perfect Table Fuzzy Rainbow Tradeoff
"... Abstract. Time memory tradeoff algorithms are tools for inverting oneway functions, and they are often used to recover passwords from unsalted password hashes. There are many publicly known tradeoff algorithms, and the rainbow tradeoff is widely believed to be the best algorithm. This work provides ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
an accurate complexity analysis of the fuzzy rainbow tradeoff algorithm, which has not yet received much attention. Based on the analysis results, we show that, when the pre-computation cost and the online efficiency are both taken into consideration, the fuzzy rainbow tradeoff may be seen as preferable
Fingerprints -- Means of . . .
"... In computer science and physics, a growing research focus is the understanding of structural characteristics of large and complex networks such as the Internet [7, 4], networks of protein interactions [8], social networks [5] and many others [1]. Conventional network analysis and exploration compris ..."
Abstract
- Add to MetaCart
In computer science and physics, a growing research focus is the understanding of structural characteristics of large and complex networks such as the Internet [7, 4], networks of protein interactions [8], social networks [5] and many others [1]. Conventional network analysis and exploration
Robust Fingerprinting for Relocatable Code
"... Robust fingerprinting of executable code contained in a mem-ory image is a prerequisite for a large number of security and forensic applications, especially in a cloud environment. Prior state of the art has focused specifically on identifying kernel versions by means of complex differential analysi ..."
Abstract
- Add to MetaCart
analysis of several aspects of the kernel code implementation. In this work, we present a novel technique that can iden-tify any relocatable code, including the kernel, based on in-herent patterns present in relocation tables. We show that such patterns are very distinct and can be used to accurately
The Complexity and Improved Heuristic Algorithms for Binary Fingerprints Clustering
"... Abstract: Binary fingerprints clustering is used in the classification analysis of gene expression data. It has important values in disease diagnosis. In this paper, we prove the binary fingerprints clustering problem for 2 missing values per fingerprint to be NP-Hard, and improve the Figueroa’s heu ..."
Abstract
- Add to MetaCart
Abstract: Binary fingerprints clustering is used in the classification analysis of gene expression data. It has important values in disease diagnosis. In this paper, we prove the binary fingerprints clustering problem for 2 missing values per fingerprint to be NP-Hard, and improve the Figueroa’s
Various Mathematical and Geometrical Models for Fingerprints: A Survey
"... Abstract- Fingerprints are the most universal, unique and persistent biometrics. The growing interest and eventually the need for advanced security, privacy and user convenience has put an access to fingerprint recognition, beyond the other biometrics recognition systems. Despite the ingenious metho ..."
Abstract
- Add to MetaCart
or dry images, different pressure and skin conditions, etc. The main objective of this paper is to review the extensive research on fingerprint recognition over the last decades and to address the present challenges. A comprehensive analysis can be made from the tabular form of the presented summary
Characterization and improvement of time-memory tradeoff based on perfect tables
- ACM TRANS. INF. SYST. SECUR
, 2008
"... Cryptanalytic time-memory trade-offs have been studied for twenty five years and have benefited from several improvements since the original work of Hellman. The ensuing variants definitely improve the original trade-off but their real impact has never been evaluated in practice. We fill this lack b ..."
Abstract
-
Cited by 14 (1 self)
- Add to MetaCart
by analyzing the perfect form of classic tables, distinguished point-based tables, and rainbow tables. We especially provide a thorough analysis of the latter variant, whose performances have never been formally calculated yet. Our analysis leads to the concept of a characteristic that enables to measure
articlepresentedatACISP2013under the sametitle. LNCS7959,pp.347–362. DOI: 10.1007/978-3-642-39059-3_24 Analysis of the Non-Perfect Table Fuzzy Rainbow Tradeoff
"... Abstract. Time memory tradeoff algorithms are tools for invertingoneway functions, and they are often used to recover passwords from unsalted password hashes. There are many publicly known tradeoff algorithms, and the rainbow tradeoff is widely believed to be the best algorithm. This work provides a ..."
Abstract
- Add to MetaCart
an accurate complexity analysis of the non-perfect table version of the fuzzy rainbow tradeoff algorithm, which has not yet received much attention. It is shown that, when the precomputation cost and the online efficiency are both taken into consideration, the non-perfect fuzzy rainbow tradeoff is preferable
IACR Cryptology ePrint Archive 2013 1 Analysis of the Rainbow Tradeoff Algorithm Used in Practice
"... Abstract—Cryptanalytic time memory tradeoff is a tool for inverting one-way functions, and the rainbow table method, the best-known tradeoff algorithm, is widely used to recover passwords. Even though extensive research has been performed on the rainbow tradeoff, the algorithm actually used in pract ..."
Abstract
- Add to MetaCart
in practice differs from the well-studied original algorithm. This work provides a full analysis of the rainbow tradeoff algorithm that is used in practice. Unlike existing works on the rainbow tradeoff, the analysis is done in the external memory model, so that the practically important issue of table
The Structure of a Depth-3 Lookup Table Representation for Prisoner’s Dilemma
"... Abstract—Fingerprinting is a mathematical technique that generates a representation-independent functional signature for a game-playing agent, allowing for systematic and automated analysis of strategies. In this study, the global structure and mutational connectivity network for a depth-3 lookup ta ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
table with prior move history playing Prisoner’s Dilemma is investigated at different choices of the time-scale parameter in the fingerprinting operator. All 2048 strategies are fingerprinted and pairwise distances computed, then principal components analysis and hierarchical clustering used to explore
Rainbow: a Robust and Versatile Measurement Tool for Kademlia-based DHT Networks
"... Abstract-In recent years, peer-to-peer (P2P) file sharing applications have dominated the Internet traffic volumes, and among them, BitTorrent and eMule constitute the majority. BitTorrent and eMule deploy their distributed networks based on Kademlia, a robust distributed hash table (DHT) protocol, ..."
Abstract
- Add to MetaCart
, to facilitate the delivery of content. Kademlia-based DHT networks have intrigued researchers in P2P community to measure and analyze them. However, to the best of our knowledge, there is still not a well-designed crawler to carry out intensive measurement and analysis on them. In this paper, we develop Rainbow
Results 1 - 10
of
51
