Pages that link to "Item:Q4161380"

The following pages link to Monte Carlo Methods for Index Computation (mod p) (Q4161380):

Displaying 50 items.

• Effective compression maps for torus-based cryptography (Q264119) (← links)
• Fast cryptography in genus 2 (Q271578) (← links)
• Improved algorithm for the isogeny problem for ordinary elliptic curves (Q360194) (← links)
• An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
• A non-uniform birthday problem with applications to discrete logarithms (Q427899) (← links)
• Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
• Higher \(K\)-groups of smooth projective curves over finite fields (Q439067) (← links)
• Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
• Discrete logarithm problem using index calculus method (Q445390) (← links)
• Computing elliptic curve discrete logarithms with the negation map (Q454851) (← links)
• Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
• Sequences with good correlation property based on depth and interleaving techniques (Q499671) (← links)
• Computational hardness of IFP and ECDLP (Q505664) (← links)
• Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications (Q541470) (← links)
• ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem (Q556108) (← links)
• Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
• Memoryless near-collisions via coding theory (Q663464) (← links)
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem (Q733510) (← links)
• On the cost of ASIC hardware crackers: a SHA-1 case study (Q826307) (← links)
• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
• Fault attacks on hyperelliptic curve discrete logarithm problem over binary field (Q893699) (← links)
• A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
• Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
• A key distribution system equivalent to factoring (Q1112781) (← links)
• Efficient signature generation by smart cards (Q1180508) (← links)
• An interactive identification scheme based on discrete logarithms and factoring (Q1184505) (← links)
• Computing discrete logarithms with the parallelized kangaroo method. (Q1408372) (← links)
• A note on the \(x\)-coordinate of points on an elliptic curve in characteristic two (Q1607127) (← links)
• Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
• Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
• The graph structure of Chebyshev polynomials over finite fields and applications (Q1727357) (← links)
• The functional graph of linear maps over finite fields and applications (Q1727359) (← links)
• On the discrete logarithm problem for prime-field elliptic curves (Q1747918) (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• Research on attacking a special elliptic curve discrete logarithm problem (Q1793291) (← links)
• On the complexity of the discrete logarithm and Diffie-Hellman problems (Q1827563) (← links)
• Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
• Speeding up elliptic curve discrete logarithm computations with point halving (Q1943980) (← links)
• Elliptic curve discrete logarithm problem over small degree extension fields (Q1946599) (← links)
• Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices (Q1999896) (← links)
• Complexity bounds on Semaev's naive index calculus method for ECDLP (Q2025337) (← links)
• Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms (Q2068384) (← links)
• Hardware implementation of multiplication over quartic extension fields (Q2079983) (← links)
• On succinct arguments and witness encryption from groups (Q2096510) (← links)
• DLP in semigroups: algorithms and lower bounds (Q2099245) (← links)
• Multiple images encryption based on 3D scrambling and hyper-chaotic system (Q2123524) (← links)
• Optimum attack on 3-round Feistel-2 structure (Q2128756) (← links)
• Sparse polynomial interpolation based on diversification (Q2143469) (← links)
• A deterministic algorithm for the discrete logarithm problem in a semigroup (Q2154468) (← links)
• On the multi-user security of short Schnorr signatures with preprocessing (Q2170064) (← links)