B. Kaliski

Publications178
h-index36
Citations8,255
Highly Influential Citations521
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • M. Bellare
  • 285 Publications • 47,937 Citations
  • R. Rivest
  • 351 Publications • 64,074 Citations
  • Oded Goldreich
  • 567 Publications • 47,704 Citations
  • P. Rogaway
  • 154 Publications • 28,352 Citations
  • Publications
  • Influence
Pors: proofs of retrievability for large files
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a… Expand
Analyzing and comparing Montgomery multiplication algorithms
TLDR
The operations involved in computing the Montgomery product are studied, several high-speed, space-efficient algorithms for computing MonPro(a, b), and their time and space requirements are described. Expand
PKCS #5: Password-Based Cryptography Specification Version 2.0
This memo represents a republication of PKCS #5 v2.0 from RSA Laboratories' Public-Key Cryptography Standards (PKCS) series, and change control is retained within the PKCS process. The body of this… Expand
Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1
This memo represents a republication of PKCS #1 v2.1 from RSA Laboratories' Public-Key Cryptography Standards (PKCS) series, and change control is retained within the PKCS process. The body of this… Expand
A Cryptographic Library for the Motorola DSP56000
TLDR
A cryptographic library for the Motorola DSP56000 that provides hardware speed yet software flexibility, and an algorithm for modular multiplication that interleaves multiplication with Montgomery modular reduction to give a very fast implementation of RSA. Expand
Server-assisted generation of a strong secret from a password
  • W. Ford, B. Kaliski
  • Computer Science
  • Proceedings IEEE 9th International Workshops on…
  • 4 June 2000
TLDR
This work describes a credentials server model and supporting protocol that overcomes the vulnerability to exhaustive password guessing attack at the server, and provides for securely generating a strong secret from a weak secret (password) based on communications exchanges with two or more independent servers. Expand
An unknown key-share attack on the MQV key agreement protocol
  • B. Kaliski
  • Computer Science
  • ACM Trans. Inf. Syst. Secur.
  • 1 August 2001
TLDR
The MQV key agreement protocol is shown in its basic form to be vulnerable to an unknown key-share attack, and the attack is noteworthy in the principles it illustrates about protocol design. Expand
PKCS #5: Password-Based Cryptography Specification Version 2.1
This document provides recommendations for the implementation of password-based cryptography, covering key derivation functions, encryption schemes, message authentication schemes, and ASN.1 syntax… Expand
The Montgomery Inverse and Its Applications
  • B. Kaliski
  • Mathematics, Computer Science
  • IEEE Trans. Computers
  • 1 August 1995
TLDR
The right-shifting binary algorithm for modular inversion is shown naturally to compute the new inverse in fewer operations than the ordinary modular inverse. Expand
Linear Cryptanalysis Using Multiple Approximations
TLDR
A technique is presented which aids in the linear cryptanalysis of a block cipher and allows for a reduction in the amount of data required for a successful attack, and it is illustrated that it is generally applicable and might be exceptionally successful when applied to other block ciphers. Expand
...
1
2
3
4
5
...