scientific article; zbMATH DE number 1088932
From MaRDI portal
Publication:4365757
zbMath0879.94026MaRDI QIDQ4365757
Publication date: 14 January 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (14)
PRIMITIVE ELEMENT PAIRS WITH A PRESCRIBED TRACE IN THE CUBIC EXTENSION OF A FINITE FIELD ⋮ Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields ⋮ Mechanically proving termination using polynomial interpretations ⋮ Reusing nonces in Schnorr signatures (and keeping it secure...) ⋮ The Brun gcd algorithm in high dimensions is almost always subtractive ⋮ A new strategy for generating shortest addition sequences ⋮ Star reduction among minimal length addition chains ⋮ Faster Addition and Doubling on Elliptic Curves ⋮ Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions ⋮ ECM using Edwards curves ⋮ Speeding up exponentiation using an untrusted computational resource ⋮ Twisted Edwards Curves Revisited ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ Binary Addition Chain on EREW PRAM
This page was built for publication:
