RSA system is based on the hardness of the integer factorization problem (IFP). Given an RSA modulus N = pq, it is difficult to determine the prime factors p and q efficiently. One of the most famous short exponent attacks on RSA is the Wiener attack. In 1997, Verheul and van Tilborg use an exhaustive search to extend the boundary of the Wiener attack. Their result shows that the cost of exhaus...

Automatic plagiarism detection considering a reference corpus compares a suspicious text to a set of original documents in order to relate the plagiarised fragments to their potential source. Publications on this task often assume that the search space (the set of reference documents) is a narrow set where any search strategy will produce a good output in a short time. However, this is not alwa...

This paper provides a systematic literature review and analysis of game theory to model oil gas scenarios. We select 2514 papers from Scopus, present complex three-dimensional classification the selected papers, analyze resultant citation network. According industry-based classification, surveyed can be classified in common supply chain fields. Based on types players, into that use government-c...

This paper provides an empirical analysis of the choices made by Japanese firms with respect to subcontracting status, that is, whether to take in work as subcontractor, to outsource work to subcontractors, to do both or to do neither. It shows that the probability of working as a subcontractor, a choice made by a many small firms in Japan, is negatively related to size, foreign sales and techn...

Classiication trees based on exhaustive search algorithms tend to be biased towards selecting variables that aaord more splits. As a result, such trees should be interpreted with caution. This article presents an algorithm called QUEST that has negligible bias. Its split selection strategy shares similarities with the FACT method, but it yields binary splits and the nal tree can be selected by ...

Classification trees based on exhaustive search algorithms tend to be biased towards selecting variables that afford more splits. As a result, such trees should be interpreted with caution. This article presents an algorithm called QUEST that has negligible bias. Its split selection strategy shares similarities with the FACT method, but it yields binary splits and the final tree can be selected...

Here we describe a general method for improving computational efficiency in simultaneous mapping of multiple interacting quantitative trait loci (QTL). The method uses a genetic algorithm to search for QTL in the genome instead of an exhaustive enumerative ("step-by-step") search. It can be used together with any method of QTL mapping based on a genomic search, since it only provides a more eff...