scientific article; zbMATH DE number 3353398
From MaRDI portal
Publication:5628224
zbMath0223.12006MaRDI QIDQ5628224
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (72)
New algorithm for the elliptic curve discrete logarithm problem with auxiliary inputs ⋮ Fast cryptography in genus 2 ⋮ Some Methods for Evaluating the Regulator of a Real Quadratic Function Field ⋮ Evaluating the Cache Side Channel Attacks Against ECDSA ⋮ On the hardness of the computational ring-LWR problem and its applications ⋮ Cubic fields, a congruential criterion for Scholz's theorem and new real quadratic fields with 3-rank equal to 4 ⋮ Bootstrapping for approximate homomorphic encryption ⋮ A Terr algorithm for computations in the infrastructure of real-quadratic number fields ⋮ A deterministic algorithm for the discrete logarithm problem in a semigroup ⋮ InfoMod: a visual and computational approach to Gauss' binary quadratic forms ⋮ Bad Directions in Cryptographic Hash Functions ⋮ Counting points on elliptic curves over finite fields ⋮ A key-exchange system based on imaginary quadratic fields ⋮ Computational aspects of sturdy and flimsy numbers ⋮ Reusing nonces in Schnorr signatures (and keeping it secure...) ⋮ Calcul du nombre de classes d'un corps quadratique imaginaire ou réel, d'après Shanks, Williams, McCurley, A. K. Lenstra et Schnorr ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ An efficient approach for secure multi-party computation without authenticated channel ⋮ Baby-step giant-step algorithms for the symmetric group ⋮ A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity ⋮ Approximating Euler products and class number computation in algebraic function fields ⋮ Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs ⋮ Extremal product-one free sequences over \(C_n \rtimes_sC_2\) ⋮ A proof of the conjectured run time of the Hafner-McCurley class group algorithm ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Generic models for group actions ⋮ Computational Number Theory, Past, Present, and Future ⋮ Fine-grained non-interactive key-exchange: constructions and lower bounds ⋮ How to compress encrypted data ⋮ Differential fault attack on Montgomery ladder and in the presence of scalar randomization ⋮ Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation ⋮ Fast multiquadratic S-unit computation and application to the calculation of class groups ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ Explicit methods in number theory. Abstracts from the workshop held July 18--24, 2021 (hybrid meeting) ⋮ Accelerating Pollard's rho algorithm on finite fields ⋮ CSIDH: an efficient post-quantum commutative group action ⋮ ON FINDING SOLUTIONS TO EXPONENTIAL CONGRUENCES ⋮ Fault-based attack on Montgomery's ladder algorithm ⋮ Analysis of low Hamming weight products ⋮ Computing low-weight discrete logarithms ⋮ Non-Interactive Key Exchange ⋮ Václav Šimerka: quadratic forms and factorization ⋮ Efficient Compression of SIDH Public Keys ⋮ Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem ⋮ Linear and sublinear time algorithms for the basis of abelian groups ⋮ Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? ⋮ Speeding Up the Pollard Rho Method on Prime Fields ⋮ Complexity bounds on Semaev's naive index calculus method for ECDLP ⋮ Riemann's hypothesis and tests for primality ⋮ A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents ⋮ Finding Invalid Signatures in Pairing-Based Batches ⋮ Research on attacking a special elliptic curve discrete logarithm problem ⋮ An exponent one-fifth algorithm for deterministic integer factorisation ⋮ Об использовании групп классов идеалов квадратичных полей для построения криптографических систем с открытым ключом ⋮ Improvement of FPPR method to solve ECDLP ⋮ Halfway to a solution of \(x^ 2 - Dy^ 2 = -3\) ⋮ Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых ⋮ A computable formula for the class number of the imaginary quadratic field \(\mathbb{Q}(\sqrt{-p})\), \(p = 4n-1\) ⋮ Improved classical cryptanalysis of SIKE in practice ⋮ Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms ⋮ Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms ⋮ Some computational aspects of, and the use of computers in, algebraic number theory ⋮ Papers from the conference 21st Journées Arithmétiques held at the Università Lateranense, Rome, July 12--16, 2001 ⋮ Computing Interval Discrete Logarithm Problem with Restricted Jump Method ⋮ New types of quadratic fields having three invariants divisible by 3 ⋮ Computing the cycles in the perfect shuffle permutation ⋮ DLP in semigroups: algorithms and lower bounds ⋮ Analysis of algorithms on problems in general abelian groups ⋮ An Overview of Factoring ⋮ Class numbers of cyclotomic fields ⋮ Computing in general Abelian groups is hard ⋮ Computing a basis for a finite Abelian p-group
This page was built for publication:
