[PDF][PDF] An algebraic method for public-key cryptography
I Anshel, M Anshel, D Goldfeld - Mathematical Research Letters, 1999 - intlpress.com
Mathematical Research Letters 6, 287–291 (1999) AN ALGEBRAIC METHOD FOR PUBLIC-KEY
CRYPTOGRAPHY Iris Anshel, Michael Anshel, a Page 1 Mathematical Research Letters 6 …
CRYPTOGRAPHY Iris Anshel, Michael Anshel, a Page 1 Mathematical Research Letters 6 …
PKI, elliptic curve cryptography, and digital signatures
WJ Caelli, EP Dawson, SA Rea - Computers & Security, 1999 - Elsevier
Global electronic commerce (E-comm) necessitates a high degree of trust in its operation for
widespread acceptance at government, enterprise and individual levels. In order to achieve …
widespread acceptance at government, enterprise and individual levels. In order to achieve …
Speeding up the discrete log computation on curves with automorphisms
LNCS 1716 - Speeding up the Discrete Log Computation on Curves with Automorphisms Page
1 Speeding up the Discrete Log Computation on Curves with Automorphisms I. Duursma1, P …
1 Speeding up the Discrete Log Computation on Curves with Automorphisms I. Duursma1, P …
Key preassigned traceability schemes for broadcast encryption
DR Stinson, R Wei - Selected Areas in Cryptography: 5th Annual …, 1999 - Springer
Traceability schemes for broadcast encryption are defined by Chor, Fiat and Naor in [6] to
protect against a possible coalition of users producing an illegal decryption key. Their …
protect against a possible coalition of users producing an illegal decryption key. Their …
Some parallel algorithms for integer factorisation
RP Brent - Euro-Par'99 Parallel Processing: 5th International Euro …, 1999 - Springer
Algorithms for finding the prime factors of large composite numbers are of practical
importance because of the widespread use of public key cryptosystems whose security …
importance because of the widespread use of public key cryptosystems whose security …
[图书][B] High performance data mining: scaling algorithms, applications and systems
Y Guo, RL Grossman - 1999 - books.google.com
High Performance Data Mining: Scaling Algorithms, Applications and Systems brings
together in one place important contributions and up-to-date research results in this fast …
together in one place important contributions and up-to-date research results in this fast …
[图书][B] Improved algorithms for arithmetic on anomalous binary curves
JA Solinas - 1999 - Citeseer
It has become increasingly common to implement discretelogarithm based public-key
protocols on elliptic curves over nite elds. The basic operation is scalar multiplication: taking …
protocols on elliptic curves over nite elds. The basic operation is scalar multiplication: taking …
[PDF][PDF] Attacks on the elliptic curve discrete logarithm problem
KJ Giuliani - 1999 - Citeseer
Elliptic curve cryptosystems appear to be more secure and e cient while requiring a smaller
key size to implement than other public key cryptosystems. Its security is based upon the di …
key size to implement than other public key cryptosystems. Its security is based upon the di …
[PDF][PDF] Computing discrete logarithms in arithmetic progressions
E Teske - Electron. Paper, 1999 - researchgate.net
We discuss computing the discrete logarithm x= logg h for the case that xa mod q for some
given numbers a and q. This can be done using an expected number of O (p ordg= q) group …
given numbers a and q. This can be done using an expected number of O (p ordg= q) group …
Optimizing the Menezes-Okamoto-Vanstone (MOV) algorithm for non-supersingular elliptic curves
Abstract We address the Menezes-Okamoto-Vanstone (MOV) algorithm for attacking elliptic
curve cryptosystems which is completed in subexponential time for supersingular elliptic …
curve cryptosystems which is completed in subexponential time for supersingular elliptic …