Pors: proofs of retrievability for large files
- A. Juels, B. Kaliski
- Computer ScienceConference on Computer and Communications…
- 28 October 2007
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…
Analyzing and comparing Montgomery multiplication algorithms
- Ç. Koç, T. Acar, B. Kaliski
- Computer Science, MathematicsIEEE Micro
- 1 June 1996
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.
PKCS #5: Password-Based Cryptography Specification Version 2.0
- B. Kaliski
- Computer Science, MathematicsRequest for Comments
- 1 September 2000
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…
A Cryptographic Library for the Motorola DSP56000
- Steve Dusse, B. Kaliski
- Computer Science, MathematicsInternational Conference on the Theory and…
- 1 February 1991
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.
Server-assisted generation of a strong secret from a password
- W. Ford, B. Kaliski
- Computer Science, MathematicsProceedings IEEE 9th International Workshops on…
- 4 June 2000
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.
Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1
- J. Jonsson, B. Kaliski
- Computer Science, MathematicsRequest for Comments
- 1 February 2003
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…
The Montgomery Inverse and Its Applications
- B. Kaliski
- MathematicsIEEE Trans. Computers
- 1 August 1995
The right-shifting binary algorithm for modular inversion is shown naturally to compute the new inverse in fewer operations than the ordinary modular inverse.
Linear Cryptanalysis Using Multiple Approximations
- B. Kaliski, M. Robshaw
- Mathematics, Computer ScienceAnnual International Cryptology Conference
- 21 August 1994
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.
Moore's Law
- B. Kaliski
- PhysicsEncyclopedia of Cryptography and Security
- 2005
A sealing arrangement between rotating and stationary parts of grinding mills, particularly those operated at pressure above atmospheric. A barrier air chamber is connected through a gap with the…
An unknown key-share attack on the MQV key agreement protocol
- B. Kaliski
- Computer ScienceACM Transactions on Privacy and Security
- 1 August 2001
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.
...
...