ASIACRYPT 2008 | Sciweavers

32

ASIACRYPT
2008
Springer

106views Cryptology» more ASIACRYPT 2008»

Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits

14 years 1 months ago

We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...

Mathias Herrmann, Alexander May

claim paper

Read More »

41

click to vote

ASIACRYPT
2008
Springer

86views Cryptology» more ASIACRYPT 2008»

Twisted Edwards Curves Revisited

14 years 1 months ago

Download eprint.iacr.org

This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...

Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Car...

claim paper

Read More »

27

click to vote

ASIACRYPT
2008
Springer

87views Cryptology» more ASIACRYPT 2008»

On the Security of HB# against a Man-in-the-Middle Attack

14 years 1 months ago

Download lasecwww.epfl.ch

Khaled Ouafi, Raphael Overbeck, Serge Vaudenay

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers