Amanote Research

Amanote Research

    RegisterSign In

The Average Complexity of the Euclidean Algorithm and Hyperelliptic Cryptography

doi 10.22215/etd/2003-05374
Full Text
Open PDF
Abstract

Available in full text

Date

Unknown

Authors
Stephen Savard
Publisher

Carleton University


Related search

Origins of the Analysis of the Euclidean Algorithm

Historia Mathematica
MathematicsHistory
1994English

A Note on the Euclidean Algorithm

Journal of Mathematics and System Science
2018English

The Emerging Theory of Average-Case Complexity

1990English

Extended Euclidean Algorithm

2008English

Some Perspectives on Complexity-Based Cryptography

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Architecture for the Secret-Key Bc3 Cryptography Algorithm

ITB Journal of Information and Communication Technology
2011English

The Complexity of the Simplex Algorithm.

English

Average-Case Bounds for the Complexity of Path-Search

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1998English

Virus Detection Using Cryptography Algorithm

Iraqi Journal for Computers and Informatics
1996English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy