Pages that link to "Item:Q4154061"
From MaRDI portal
The following pages link to An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.) (Q4154061):
Displaying 50 items.
- Effective compression maps for torus-based cryptography (Q264119) (← links)
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Bug attacks (Q321310) (← links)
- The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves (Q321311) (← links)
- Collapse of the hierarchy of constant-depth exact quantum circuits (Q347120) (← links)
- Analysis of the fault attack ECDLP over prime field (Q410803) (← links)
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Accelerating Pollard's rho algorithm on finite fields (Q431795) (← links)
- Discrete logarithm based additively homomorphic encryption and secure data aggregation (Q433021) (← 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)
- Solving systems of diagonal polynomial equations over finite fields (Q507442) (← links)
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← 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)
- Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach (Q657907) (← links)
- A traceable proxy multisignature scheme based on the elliptic curve cryptosystem (Q702590) (← links)
- Parallel use of multiplicative congruential random number generators (Q710021) (← links)
- Sequence acquisition using bit estimation techniques (Q801872) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- On index calculus algorithms for subfield curves (Q832332) (← links)
- Fast generators for the Diffie-Hellman key agreement protocol and malicious standards (Q845702) (← links)
- Applying quick exponentiation for block upper triangular matrices (Q865509) (← links)
- Studying the performance of artificial neural networks on problems related to cryptography (Q867941) (← links)
- Fault attacks on hyperelliptic curve discrete logarithm problem over binary field (Q893699) (← links)
- A discrete logarithm implementation of perfect zero-knowledge blobs (Q913490) (← links)
- Low complexity normal bases for \(F_{2^{mn}}\) (Q918710) (← links)
- Low complexity normal bases (Q923627) (← links)
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm (Q968774) (← links)
- Ramanujan's class invariants and their use in elliptic curve cryptography (Q988264) (← links)
- A note on Girault's self-certified model (Q1007639) (← links)
- Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852) (← links)
- Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves (Q1037232) (← links)
- Analysis of the Herlestam and Johannesson discrete logarithm scheme in \(GF(2^ N)\) for large N (Q1059674) (← links)
- A VLSI architecture for performing finite field arithmetic with reduced table lookup (Q1099611) (← links)
- A construction for authentication/secrecy codes from certain combinatorial designs (Q1112007) (← links)
- A key distribution system equivalent to factoring (Q1112781) (← links)
- A key-exchange system based on imaginary quadratic fields (Q1112782) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Über die mathematischen Grundlagen einiger Chiffrierverfahren (Q1164602) (← links)
- On computing logarithms over GF(2**p) (Q1168369) (← links)
- Smoothness and factoring polynomials over finite fields (Q1178194) (← links)
- Cryptology: The mathematics of secure communication (Q1259538) (← links)
- The Pohlig-Hellman method generalized for group structure computation (Q1300626) (← links)
- Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
- An authentication-combined access control scheme using a one-way function (Q1324344) (← links)
- Controlling access in tree hierarchies (Q1328542) (← links)
- A practical anonymous multi-authority e-cash scheme. (Q1412636) (← links)
