2015-09-05 20:30:20 +02:00
|
|
|
package cryptfs
|
|
|
|
|
|
|
|
// File content encryption / decryption
|
|
|
|
|
|
|
|
import (
|
2015-09-06 09:47:01 +02:00
|
|
|
"bytes"
|
2015-09-05 20:30:20 +02:00
|
|
|
"crypto/cipher"
|
2015-10-03 13:36:49 +02:00
|
|
|
"crypto/md5"
|
2015-10-07 22:58:22 +02:00
|
|
|
"encoding/binary"
|
2015-10-03 13:36:49 +02:00
|
|
|
"encoding/hex"
|
2015-10-04 14:36:20 +02:00
|
|
|
"errors"
|
|
|
|
"os"
|
2015-09-05 20:30:20 +02:00
|
|
|
)
|
|
|
|
|
2015-10-03 13:36:49 +02:00
|
|
|
const (
|
|
|
|
// A block of 4124 zero bytes has this md5
|
|
|
|
ZeroBlockMd5 = "64331af89bd15a987b39855338336237"
|
|
|
|
)
|
|
|
|
|
|
|
|
// md5sum - debug helper, return md5 hex string
|
|
|
|
func md5sum(buf []byte) string {
|
|
|
|
rawHash := md5.Sum(buf)
|
|
|
|
hash := hex.EncodeToString(rawHash[:])
|
|
|
|
return hash
|
|
|
|
}
|
|
|
|
|
2015-09-05 20:30:20 +02:00
|
|
|
type CryptFile struct {
|
|
|
|
file *os.File
|
2015-10-04 14:36:20 +02:00
|
|
|
gcm cipher.AEAD
|
2015-09-05 20:30:20 +02:00
|
|
|
}
|
|
|
|
|
2015-09-06 09:47:01 +02:00
|
|
|
// DecryptBlocks - Decrypt a number of blocks
|
2015-10-06 22:27:37 +02:00
|
|
|
func (be *CryptFS) DecryptBlocks(ciphertext []byte, firstBlockNo uint64) ([]byte, error) {
|
2015-09-06 09:47:01 +02:00
|
|
|
cBuf := bytes.NewBuffer(ciphertext)
|
|
|
|
var err error
|
|
|
|
var pBuf bytes.Buffer
|
|
|
|
for cBuf.Len() > 0 {
|
|
|
|
cBlock := cBuf.Next(int(be.cipherBS))
|
2015-09-30 20:31:41 +02:00
|
|
|
var pBlock []byte
|
2015-10-06 22:27:37 +02:00
|
|
|
pBlock, err = be.DecryptBlock(cBlock, firstBlockNo)
|
2015-09-06 09:47:01 +02:00
|
|
|
if err != nil {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
pBuf.Write(pBlock)
|
2015-10-06 22:27:37 +02:00
|
|
|
firstBlockNo++
|
2015-09-06 09:47:01 +02:00
|
|
|
}
|
|
|
|
return pBuf.Bytes(), err
|
|
|
|
}
|
|
|
|
|
|
|
|
// DecryptBlock - Verify and decrypt GCM block
|
2015-10-03 13:34:33 +02:00
|
|
|
//
|
|
|
|
// Corner case: A full-sized block of all-zero ciphertext bytes is translated
|
|
|
|
// to an all-zero plaintext block, i.e. file hole passtrough.
|
2015-10-06 22:27:37 +02:00
|
|
|
func (be *CryptFS) DecryptBlock(ciphertext []byte, blockNo uint64) ([]byte, error) {
|
2015-09-05 20:30:20 +02:00
|
|
|
|
|
|
|
// Empty block?
|
|
|
|
if len(ciphertext) == 0 {
|
|
|
|
return ciphertext, nil
|
|
|
|
}
|
|
|
|
|
2015-10-03 13:34:33 +02:00
|
|
|
// All-zero block?
|
|
|
|
if bytes.Equal(ciphertext, be.allZeroBlock) {
|
|
|
|
Debug.Printf("DecryptBlock: file hole encountered\n")
|
|
|
|
return make([]byte, be.plainBS), nil
|
|
|
|
}
|
|
|
|
|
2015-09-05 20:30:20 +02:00
|
|
|
if len(ciphertext) < NONCE_LEN {
|
2015-09-05 20:36:26 +02:00
|
|
|
Warn.Printf("decryptBlock: Block is too short: %d bytes\n", len(ciphertext))
|
2015-09-05 20:30:20 +02:00
|
|
|
return nil, errors.New("Block is too short")
|
|
|
|
}
|
|
|
|
|
|
|
|
// Extract nonce
|
|
|
|
nonce := ciphertext[:NONCE_LEN]
|
2015-10-03 13:36:49 +02:00
|
|
|
ciphertextOrig := ciphertext
|
2015-09-05 20:30:20 +02:00
|
|
|
ciphertext = ciphertext[NONCE_LEN:]
|
|
|
|
|
|
|
|
// Decrypt
|
|
|
|
var plaintext []byte
|
2015-10-06 22:27:37 +02:00
|
|
|
aData := make([]byte, 8)
|
|
|
|
binary.BigEndian.PutUint64(aData, blockNo)
|
2015-09-05 20:30:20 +02:00
|
|
|
plaintext, err := be.gcm.Open(plaintext, nonce, ciphertext, nil)
|
2015-09-06 10:38:43 +02:00
|
|
|
|
2015-09-05 20:30:20 +02:00
|
|
|
if err != nil {
|
2015-10-03 13:36:49 +02:00
|
|
|
Warn.Printf("DecryptBlock: %s, len=%d, md5=%s\n", err.Error(), len(ciphertextOrig), Warn.Md5sum(ciphertextOrig))
|
2015-10-04 00:26:20 +02:00
|
|
|
Debug.Println(hex.Dump(ciphertextOrig))
|
2015-09-05 20:30:20 +02:00
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
return plaintext, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// encryptBlock - Encrypt and add MAC using GCM
|
2015-10-07 22:58:22 +02:00
|
|
|
func (be *CryptFS) EncryptBlock(plaintext []byte, blockNo uint64) []byte {
|
2015-09-05 20:30:20 +02:00
|
|
|
|
|
|
|
// Empty block?
|
|
|
|
if len(plaintext) == 0 {
|
|
|
|
return plaintext
|
|
|
|
}
|
|
|
|
|
|
|
|
// Get fresh nonce
|
|
|
|
nonce := gcmNonce.Get()
|
|
|
|
|
|
|
|
// Encrypt plaintext and append to nonce
|
2015-10-06 22:27:37 +02:00
|
|
|
aData := make([]byte, 8)
|
|
|
|
binary.BigEndian.PutUint64(aData, blockNo)
|
2015-09-05 20:30:20 +02:00
|
|
|
ciphertext := be.gcm.Seal(nonce, nonce, plaintext, nil)
|
|
|
|
|
|
|
|
return ciphertext
|
|
|
|
}
|
|
|
|
|
2015-09-08 00:54:24 +02:00
|
|
|
// Split a plaintext byte range into (possibly partial) blocks
|
2015-09-05 20:30:20 +02:00
|
|
|
func (be *CryptFS) SplitRange(offset uint64, length uint64) []intraBlock {
|
|
|
|
var b intraBlock
|
|
|
|
var parts []intraBlock
|
|
|
|
|
|
|
|
b.fs = be
|
|
|
|
|
|
|
|
for length > 0 {
|
|
|
|
b.BlockNo = offset / be.plainBS
|
2015-10-04 14:24:43 +02:00
|
|
|
b.Skip = offset % be.plainBS
|
2015-10-04 14:36:20 +02:00
|
|
|
b.Length = be.minu64(length, be.plainBS-b.Skip)
|
2015-09-05 20:30:20 +02:00
|
|
|
parts = append(parts, b)
|
|
|
|
offset += b.Length
|
|
|
|
length -= b.Length
|
|
|
|
}
|
|
|
|
return parts
|
|
|
|
}
|
|
|
|
|
|
|
|
// PlainSize - calculate plaintext size from ciphertext size
|
|
|
|
func (be *CryptFS) PlainSize(size uint64) uint64 {
|
2015-09-16 19:32:37 +02:00
|
|
|
|
2015-09-05 20:30:20 +02:00
|
|
|
// Zero sized files stay zero-sized
|
2015-09-16 19:32:37 +02:00
|
|
|
if size == 0 {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
|
|
|
|
overhead := be.cipherBS - be.plainBS
|
|
|
|
nBlocks := (size + be.cipherBS - 1) / be.cipherBS
|
2015-10-04 14:36:20 +02:00
|
|
|
if nBlocks*overhead > size {
|
2015-09-16 19:32:37 +02:00
|
|
|
Warn.Printf("PlainSize: Negative size, returning 0 instead\n")
|
|
|
|
return 0
|
2015-09-05 20:30:20 +02:00
|
|
|
}
|
2015-09-16 19:32:37 +02:00
|
|
|
size -= nBlocks * overhead
|
|
|
|
|
2015-09-05 20:30:20 +02:00
|
|
|
return size
|
|
|
|
}
|
|
|
|
|
2015-09-30 22:36:53 +02:00
|
|
|
// CipherSize - calculate ciphertext size from plaintext size
|
|
|
|
func (be *CryptFS) CipherSize(size uint64) uint64 {
|
|
|
|
overhead := be.cipherBS - be.plainBS
|
|
|
|
nBlocks := (size + be.plainBS - 1) / be.plainBS
|
|
|
|
size += nBlocks * overhead
|
|
|
|
|
|
|
|
return size
|
|
|
|
}
|
|
|
|
|
2015-09-05 20:30:20 +02:00
|
|
|
func (be *CryptFS) minu64(x uint64, y uint64) uint64 {
|
|
|
|
if x < y {
|
|
|
|
return x
|
|
|
|
}
|
|
|
|
return y
|
|
|
|
}
|
2015-09-06 09:47:01 +02:00
|
|
|
|
2015-09-08 00:54:24 +02:00
|
|
|
// CiphertextRange - Get byte range in backing ciphertext corresponding
|
|
|
|
// to plaintext range. Returns a range aligned to ciphertext blocks.
|
2015-09-08 22:34:42 +02:00
|
|
|
func (be *CryptFS) CiphertextRange(offset uint64, length uint64) (alignedOffset uint64, alignedLength uint64, skipBytes int) {
|
2015-09-08 00:54:24 +02:00
|
|
|
// Decrypting the ciphertext will yield too many plaintext bytes. Skip this number
|
|
|
|
// of bytes from the front.
|
|
|
|
skip := offset % be.plainBS
|
|
|
|
|
|
|
|
firstBlockNo := offset / be.plainBS
|
2015-10-04 14:36:20 +02:00
|
|
|
lastBlockNo := (offset + length - 1) / be.plainBS
|
2015-09-08 00:54:24 +02:00
|
|
|
|
2015-09-08 22:34:42 +02:00
|
|
|
alignedOffset = firstBlockNo * be.cipherBS
|
|
|
|
alignedLength = (lastBlockNo - firstBlockNo + 1) * be.cipherBS
|
2015-09-08 00:54:24 +02:00
|
|
|
|
2015-09-08 22:34:42 +02:00
|
|
|
skipBytes = int(skip)
|
|
|
|
return alignedOffset, alignedLength, skipBytes
|
2015-09-08 00:54:24 +02:00
|
|
|
}
|
|
|
|
|
2015-09-06 09:47:01 +02:00
|
|
|
// Get the byte range in the ciphertext corresponding to blocks
|
|
|
|
// (full blocks!)
|
|
|
|
func (be *CryptFS) JoinCiphertextRange(blocks []intraBlock) (uint64, uint64) {
|
|
|
|
|
|
|
|
offset, _ := blocks[0].CiphertextRange()
|
|
|
|
last := blocks[len(blocks)-1]
|
|
|
|
length := (last.BlockNo - blocks[0].BlockNo + 1) * be.cipherBS
|
|
|
|
|
|
|
|
return offset, length
|
|
|
|
}
|
|
|
|
|
|
|
|
// Crop plaintext that correspons to complete cipher blocks down to what is
|
|
|
|
// requested according to "iblocks"
|
|
|
|
func (be *CryptFS) CropPlaintext(plaintext []byte, blocks []intraBlock) []byte {
|
2015-10-04 14:24:43 +02:00
|
|
|
offset := blocks[0].Skip
|
2015-09-06 09:47:01 +02:00
|
|
|
last := blocks[len(blocks)-1]
|
|
|
|
length := (last.BlockNo - blocks[0].BlockNo + 1) * be.plainBS
|
|
|
|
var cropped []byte
|
2015-10-04 14:36:20 +02:00
|
|
|
if offset+length > uint64(len(plaintext)) {
|
2015-10-07 22:58:22 +02:00
|
|
|
cropped = plaintext[offset:]
|
2015-09-06 09:47:01 +02:00
|
|
|
} else {
|
2015-10-04 14:36:20 +02:00
|
|
|
cropped = plaintext[offset : offset+length]
|
2015-09-06 09:47:01 +02:00
|
|
|
}
|
|
|
|
return cropped
|
|
|
|
}
|
2015-09-08 00:54:24 +02:00
|
|
|
|
|
|
|
// MergeBlocks - Merge newData into oldData at offset
|
|
|
|
// New block may be bigger than both newData and oldData
|
|
|
|
func (be *CryptFS) MergeBlocks(oldData []byte, newData []byte, offset int) []byte {
|
|
|
|
|
|
|
|
// Make block of maximum size
|
|
|
|
out := make([]byte, be.plainBS)
|
|
|
|
|
|
|
|
// Copy old and new data into it
|
|
|
|
copy(out, oldData)
|
|
|
|
l := len(newData)
|
2015-10-04 14:36:20 +02:00
|
|
|
copy(out[offset:offset+l], newData)
|
2015-09-08 00:54:24 +02:00
|
|
|
|
|
|
|
// Crop to length
|
|
|
|
outLen := len(oldData)
|
|
|
|
newLen := offset + len(newData)
|
|
|
|
if outLen < newLen {
|
|
|
|
outLen = newLen
|
|
|
|
}
|
|
|
|
return out[0:outLen]
|
|
|
|
}
|
2015-10-04 11:03:40 +02:00
|
|
|
|
|
|
|
// Get the block number at plain-text offset
|
|
|
|
func (be *CryptFS) BlockNoPlainOff(plainOffset uint64) uint64 {
|
2015-10-04 14:36:20 +02:00
|
|
|
return plainOffset / be.plainBS
|
2015-10-04 11:03:40 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Get the block number at ciphter-text offset
|
|
|
|
func (be *CryptFS) BlockNoCipherOff(cipherOffset uint64) uint64 {
|
2015-10-04 14:36:20 +02:00
|
|
|
return cipherOffset / be.cipherBS
|
2015-10-04 11:03:40 +02:00
|
|
|
}
|