Sciweavers

62 search results - page 1 / 13
» Making a List...Checking it Twice
Sort
View
IPL
1998
177views more  IPL 1998»
13 years 7 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
JaeCheol Ha, Sang-Jae Moon
WWW
2009
ACM
14 years 8 months ago
What makes conversations interesting?: themes, participants and consequences of conversations in online social media
Rich media social networks promote not only creation and consumption of media, but also communication about the posted media item. What causes a conversation to be interesting, th...
Ajita John, Dorée D. Seligmann, Hari Sundar...
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
13 years 11 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro
CGO
2011
IEEE
12 years 11 months ago
Practical memory checking with Dr. Memory
—Memory corruption, reading uninitialized memory, using freed memory, and other memory-related errors are among the most difficult programming bugs to identify and fix due to t...
Derek Bruening, Qin Zhao