On the success probability of the quantum algorithm for the short DLP

Eker{\aa} and H{\aa}stad have introduced a variation of Shor's algorithm for the discrete logarithm problem (DLP). Unlike Shor's original algorithm, Eker{\aa}-H{\aa}stad's algorithm solves the short DLP in groups of unknown order. In this work, we prove a lower bound on the probability of Eker{\aa}-H{\aa}stad's algorithm recovering the short logarithm $d$ in a single run. By our bound, the success probability can easily be pushed as high as $1 - 10^{-10}$ for any short $d$. A key to achieving such a high success probability is to efficiently perform a limited search in the classical post-processing by leveraging meet-in-the-middle techniques. Asymptotically, in the limit as the bit length $m$ of $d$ tends to infinity, the success probability tends to one if the limits on the search space are parameterized in $m$. Our results are directly applicable to Diffie-Hellman in safe-prime groups with short exponents, and to RSA via a reduction from the RSA integer factoring problem (IFP) to the short DLP

Quality Analysis in Phase Modulated Radio Over Fiber in WDM/DWDM Network

There has been increasing demand for connection setup with a higher quality of service (QoS) in WDM/DWDM networks, especially in fields like radio over fibers, where phase modulation affects the link quality. Hence to meet guaranteed QoS in a phase modulated link, the effects of phase modulation on link quality is very much needed. The link quality is termed as quality factor (Q-factor). The primary objective is to use effectively the connections available to optimize the computed number of connections and reduce the blocked connections but at the same time guarantying QoS as per client’s need. The analysis has been done by taking care of routing and wavelength assignment (RWA) techniques. The performance analysis is presented in terms of blocking probability. This work includes detailed mathematical analysis of how phase modulation affects link Q-factor.Eight bands complimentary inner outer band, four bands complimentary inner outer band, and middle outer band wavelength assignment techniques are used for analysis.Blocking probability versus connection requests, blocking probability versus wavelengths assigned, connections accepted for a given source-destination pair were analyzed for different wavelength assignment techniques

The Critical Middle Years and the Relationship of Early Access to Algebra on High School Math Course Completion and College Readiness

Many students who enroll in higher education are unprepared to meet the challenges of postsecondary education. The probability that students will make a successful transition from high school to college is linked to the degree to which their secondary educational experiences have prepared them for the expectations and demands they will encounter in college. National findings provide continuing evidence that focusing on improving student achievement in mathematics will positively impact college readiness. The main problem addressed in this quantitative study was how educators can best prepare students for college readiness. Since college readiness is highly dependent upon math achievement in middle schools, postsecondary educators need additional research that explores how math curricula may ultimately impact the readiness of their college students. Therefore, seemingly benign decisions about placement of students in middle school math may ultimately impact greatly on their college readiness. In addition, the study focused on the implications of those placement decisions. Chi-square Automatic Interaction Detection (CHAID) was used to determine those variables that were most significantly associated with students\u27 math-related college readiness as evidenced by advanced mathematics coursework taken beyond Algebra I

A Distinguisher on PRESENT-Like Permutations with Application to SPONGENT

At Crypto 2015, Blondeau et al. showed a known-key analysis on the full PRESENT lightweight block cipher. Based on some of the best differential distinguishers, they introduced a meet in the middle (MitM) layer to pre-add the differential distinguisher, which extends the number of attacked rounds on PRESENT from 26 rounds to full rounds without reducing differential probability. In this paper, we generalize their method and present a distinguisher on a kind of permutations called PRESENT-like permutations. This generic distinguisher is divided into two phases. The first phase is a truncated differential distinguisher with strong bias, which describes the unbalancedness of the output collision on some fixed bits, given the fixed input in some bits, and we take advantage of the strong relation between truncated differential probability and capacity of multidimensional linear approximation to derive the best differential distinguishers. The second phase is the meet-in-the-middle layer, which is pre-added to the truncated differential to propagate the differential properties as far as possible. Different with Blondeau et al.\u27s work, we extend the MitM layers on a 64-bit internal state to states with any size, and we also give a concrete bound to estimate the attacked rounds of the MitM layer. As an illustration, we apply our technique to all versions of SPONGENT permutations. In the truncated differential phase, as a result we reach one, two or three rounds more than the results shown by the designers. In the meet-in-the-middle phase, we get up to 11 rounds to pre-add to the differential distinguishers. Totally, we improve the previous distinguishers on all versions of SPONGENT permutations by up to 13 rounds

Equal-Subset-Sum Faster Than the Meet-in-the-Middle

In the Equal-Subset-Sum problem, we are given a set S of n integers and the problem is to decide if there exist two disjoint nonempty subsets A,B subseteq S, whose elements sum up to the same value. The problem is NP-complete. The state-of-the-art algorithm runs in O^*(3^(n/2)) <= O^*(1.7321^n) time and is based on the meet-in-the-middle technique. In this paper, we improve upon this algorithm and give O^*(1.7088^n) worst case Monte Carlo algorithm. This answers a question suggested by Woeginger in his inspirational survey. Additionally, we analyse the polynomial space algorithm for Equal-Subset-Sum. A naive polynomial space algorithm for Equal-Subset-Sum runs in O^*(3^n) time. With read-only access to the exponentially many random bits, we show a randomized algorithm running in O^*(2.6817^n) time and polynomial space

Percolation on hyperbolic lattices

The percolation transitions on hyperbolic lattices are investigated numerically using finite-size scaling methods. The existence of two distinct percolation thresholds is verified. At the lower threshold, an unbounded cluster appears and reaches from the middle to the boundary. This transition is of the same type and has the same finite-size scaling properties as the corresponding transition for the Cayley tree. At the upper threshold, on the other hand, a single unbounded cluster forms which overwhelms all the others and occupies a finite fraction of the volume as well as of the boundary connections. The finite-size scaling properties for this upper threshold are different from those of the Cayley tree and two of the critical exponents are obtained. The results suggest that the percolation transition for the hyperbolic lattices forms a universality class of its own.Comment: 17 pages, 18 figures, to appear in Phys. Rev.

The process of irreversible nucleation in multilayer growth. II. Exact results in one and two dimensions

We study irreversible dimer nucleation on top of terraces during epitaxial growth in one and two dimensions, for all values of the step-edge barrier. The problem is solved exactly by transforming it into a first passage problem for a random walker in a higher-dimensional space. The spatial distribution of nucleation events is shown to differ markedly from the mean-field estimate except in the limit of very weak step-edge barriers. The nucleation rate is computed exactly, including numerical prefactors.Comment: 22 pages, 10 figures. To appear in Phys. Rev.