Pages that link to "Item:Q4154061"

The following pages link to An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.) (Q4154061):

Displayed 50 items.

• ID-based threshold digital signature schemes on the elliptic curve discrete logarithm problem (Q556108) ‎ (← links)
• A traceable proxy multisignature scheme based on the elliptic curve cryptosystem (Q702590) ‎ (← links)
• Sequence acquisition using bit estimation techniques (Q801872) ‎ (← links)
• Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) ‎ (← 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)
• 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 note on Girault's self-certified model (Q1007639) ‎ (← 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)
• Unmediated communication in repeated games with imperfect monitoring. (Q1420518) ‎ (← links)
• A traceable group signature scheme. (Q1597121) ‎ (← links)
• Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves (Q1772239) ‎ (← links)
• A serial version of the Pohlig-Hellman algorithm for computing discrete logarithms (Q1803561) ‎ (← links)
• Prime-number algorithm for public-key systems (Q1816016) ‎ (← links)
• A practical anonymous payment scheme for electronic commerce (Q1876490) ‎ (← links)
• Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) ‎ (← links)
• Complexity of a determinate algorithm for the discrete logarithm (Q1898267) ‎ (← links)
• A novel ID-based group signature (Q1969685) ‎ (← links)
• One-way permutations on elliptic curves (Q2277234) ‎ (← links)
• A conference key distribution system based on cross-product (Q2365938) ‎ (← links)
• A low-memory algorithm for point counting on Picard curves (Q2491278) ‎ (← links)
• The GN-authenticated key agreement (Q2572038) ‎ (← links)
• Several security schemes constructed using ECC-based self-certified public key cryptosystems (Q2572699) ‎ (← links)
• On random walks for Pollard's rho method (Q2701566) ‎ (← links)
• A new password authentication mechanism based on two phases encryption (Q2780800) ‎ (← links)
• Computing Logarithms in Finite Fields of Characteristic Two (Q3320493) ‎ (← links)
• A double large prime variation for small genus hyperelliptic index calculus (Q3420442) ‎ (← links)
• Security analysis of discrete logarithm based cryptosystems (Q3443271) ‎ (← links)
• Efficient Finite Fields in the Maxima Computer Algebra System (Q3519552) ‎ (← links)
• An Identity-Based Key Agreement Protocol for the Network Layer (Q3540060) ‎ (← links)
• Bug Attacks (Q3600222) ‎ (← links)
• ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message (Q3600317) ‎ (← links)
• Speeding Up the Pollard Rho Method on Prime Fields (Q3600392) ‎ (← links)
• Polylogarithmic two-round argument systems (Q3612244) ‎ (← links)