Amanote Research

Amanote Research

    RegisterSign In

Speeding Up Discrete Log and Factoring Based Schemes via Precomputations

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0054129
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1998

Authors
Victor BoykoMarcus PeinadoRamarathnam Venkatesan
Publisher

Springer Berlin Heidelberg


Related search

Speeding Up Cyclic Update Schemes by Pattern Searches

English

Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation

English

Speeding Up Elliptic Curve Discrete Logarithm Computations With Point Halving

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2011English

Speeding-Up Mutation Testing via Data Compression and State Infection

2016English

Speeding Up of the Complex Discrete Wavelet Transform by Using Lifting Scheme

Journal of Signal Processing
2019English

A New Digital Signature Scheme Based on Factoring and Discrete Logarithms

Journal of Mathematics and Statistics
MathematicsStatisticsProbability
2008English

Speeding Up Snakes

2006English

Speeding Up and Parallelizing the GARFIELD++

EPJ Web of Conferences
AstronomyPhysics
2018English

Speeding Up Local Patch Dissimilarity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy