2967 search results - page 251 / 594 » Cryptology |
155
click to vote
FIWAC
1993
15 years 11 months ago
1993
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
153
click to vote
FSE
1993
Springer
15 years 11 months ago
1993
Springer
: A new non-proprietary secret-key block-enciphering algorithm, SAFER K-64 (for Secure And Fast Encryption Routine with a Key of length 64 bits) is described. The blocklength is 64...
230
click to vote
ASIACRYPT
1992
Springer
15 years 11 months ago
1992
Springer
: Nonperfect secret sharing schemes NSSs have an advantage such that the size of shares can be shorter than that of perfect secret sharing schemes. This paper shows some basic prop...
153
click to vote
CRYPTO
1992
Springer
15 years 11 months ago
1992
Springer
Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of broadcast messages in threshold schemes with disenrollment. In an effort to examine the conjecture, w...
182
Voted
CRYPTO
1989
Springer
15 years 11 months ago
1989
Springer
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...