Hard Instances of the Constrained Discrete Logarithm Problem

The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the set. Motivated by cryptographic applications, we study sets with succinct representation for which the constrained DLP is hard. We draw on earlier results due to Erd\"os et al. and Schnorr, develop geometric tools such as generalized Menelaus' theorem for proving lower bounds on the complexity of the constrained DLP, and construct sets with succinct representation with provable non-trivial lower bounds

Parity Violation in Proton-Proton Scattering

Measurements of parity-violating longitudinal analyzing powers (normalized asymmetries) in polarized proton-proton scattering provide a unique window on the interplay between the weak and strong interactions between and within hadrons. Several new proton-proton parity violation experiments are presently either being performed or are being prepared for execution in the near future: at TRIUMF at 221 MeV and 450 MeV and at COSY (Kernforschungsanlage Juelich) at 230 MeV and near 1.3 GeV. These experiments are intended to provide stringent constraints on the set of six effective weak meson-nucleon coupling constants, which characterize the weak interaction between hadrons in the energy domain where meson exchange models provide an appropriate description. The 221 MeV is unique in that it selects a single transition amplitude (3P2-1D2) and consequently constrains the weak meson-nucleon coupling constant h_rho{pp}. The TRIUMF 221 MeV proton-proton parity violation experiment is described in some detail. A preliminary result for the longitudinal analyzing power is Az = (1.1 +/-0.4 +/-0.4) x 10^-7. Further proton-proton parity violation experiments are commented on. The anomaly at 6 GeV/c requires that a new multi-GeV proton-proton parity violation experiment be performed.Comment: 13 Pages LaTeX, 5 PostScript figures, uses espcrc1.sty. Invited talk at QULEN97, International Conference on Quark Lepton Nuclear Physics -- Nonperturbative QCD Hadron Physics & Electroweak Nuclear Processes --, Osaka, Japan May 20--23, 199

Correction to: Plant invasion impacts on fungal community structure and function depend on soil warming and nitrogen enrichment

ISSN:0029-8549ISSN:1432-193

Potentialtöpfe und kurzperiodische Übergitter: GaInAs(P)InP-Heterostrukturen für Feldeffekttransistoren und elektrooptische Modulatoren

Abstract. We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete logarithms equal to products in groups of unknown order. As an example of application, we show that this new algorithm enables to cryptanalyse a variant of the GPS scheme proposed by Girault and Lefranc at CHES 2004 conference in which the private key is equal to the product of two sub-private keys of low Hamming weight. We also describe a second attack based on a known variant of the Baby-Step Giant-Step algorithm using the low Hamming weight of the sub-private keys. Key words: Baby-Step Giant-Step algorithm, discrete logarithm, GPS scheme, binary trees, low Hamming weight.