package zuc import ( "github.com/emmansun/gmsm/cipher" "github.com/emmansun/gmsm/internal/alias" "github.com/emmansun/gmsm/internal/byteorder" "github.com/emmansun/gmsm/internal/subtle" ) const ( RoundWords = 32 WordSize = 4 RoundBytes = RoundWords * WordSize ) type eea struct { zucState32 x [WordSize]byte // remaining bytes buffer xLen int // number of remaining bytes initState zucState32 used uint64 } // NewCipher create a stream cipher based on key and iv aguments. // The key must be 16 bytes long and iv must be 16 bytes long for zuc 128; // or the key must be 32 bytes long and iv must be 23 bytes long for zuc 256; // otherwise, an error will be returned. func NewCipher(key, iv []byte) (cipher.SeekableStream, error) { s, err := newZUCState(key, iv) if err != nil { return nil, err } c := new(eea) c.zucState32 = *s c.initState = *s c.used = 0 return c, nil } // NewEEACipher create a stream cipher based on key, count, bearer and direction arguments according specification. // The key must be 16 bytes long and iv must be 16 bytes long, otherwise, an error will be returned. // The count is the 32-bit counter value, the bearer is the 5-bit bearer identity and the direction is the 1-bit // transmission direction flag. func NewEEACipher(key []byte, count, bearer, direction uint32) (cipher.SeekableStream, error) { iv := make([]byte, 16) byteorder.BEPutUint32(iv, count) copy(iv[8:12], iv[:4]) iv[4] = byte(((bearer << 1) | (direction & 1)) << 2) iv[12] = iv[4] return NewCipher(key, iv) } func genKeyStreamRev32Generic(keyStream []byte, pState *zucState32) { for len(keyStream) >= WordSize { z := genKeyword(pState) byteorder.BEPutUint32(keyStream, z) keyStream = keyStream[WordSize:] } } func (c *eea) XORKeyStream(dst, src []byte) { if len(dst) < len(src) { panic("zuc: output smaller than input") } if alias.InexactOverlap(dst[:len(src)], src) { panic("zuc: invalid buffer overlap") } used := len(src) if c.xLen > 0 { // handle remaining key bytes n := subtle.XORBytes(dst, src, c.x[:c.xLen]) c.xLen -= n dst = dst[n:] src = src[n:] if c.xLen > 0 { copy(c.x[:], c.x[n:c.xLen+n]) c.used += uint64(used) return } } words := (len(src) + WordSize - 1) / WordSize rounds := words / RoundWords var keyBytes [RoundBytes]byte for i := 0; i < rounds; i++ { genKeyStreamRev32(keyBytes[:], &c.zucState32) subtle.XORBytes(dst, src, keyBytes[:]) dst = dst[RoundBytes:] src = src[RoundBytes:] } if processedWords := rounds * RoundWords; processedWords < words { byteLen := WordSize * (words - processedWords) genKeyStreamRev32(keyBytes[:byteLen], &c.zucState32) n := subtle.XORBytes(dst, src, keyBytes[:]) // save remaining key bytes c.xLen = byteLen - n if c.xLen > 0 { copy(c.x[:], keyBytes[n:byteLen]) } } c.used += uint64(used) } func (c *eea) reset() { c.zucState32 = c.initState c.xLen = 0 c.used = 0 } func (c *eea) XORKeyStreamAt(dst, src []byte, offset uint64) { if len(dst) < len(src) { panic("zuc: output smaller than input") } if alias.InexactOverlap(dst[:len(src)], src) { panic("zuc: invalid buffer overlap") } if offset < c.used { // reset the state to the initial state c.reset() } else if offset == c.used { c.XORKeyStream(dst, src) return } diff := offset - c.used if diff <= uint64(c.xLen) { c.xLen -= int(diff) c.used += diff c.XORKeyStream(dst, src) return } // forward the state to the offset // this part can be optimized by a little bit stepLen := uint64(RoundBytes) var keys [RoundWords]uint32 for ; diff >= uint64(stepLen); diff -= stepLen { genKeyStream(keys[:], &c.zucState32) c.used += stepLen } if diff > 0 { words := (diff + WordSize - 1) / WordSize genKeyStream(keys[:words], &c.zucState32) partiallyUsed := int(diff % WordSize) c.used += words * WordSize if partiallyUsed > 0 { // save remaining key bytes (less than 4 bytes) c.xLen = WordSize - partiallyUsed c.used -= uint64(c.xLen) byteorder.BEPutUint32(c.x[:], keys[words-1]) copy(c.x[:], c.x[partiallyUsed:]) } } c.XORKeyStream(dst, src) }