query: Rationale behind IETF-ChaChaPoly's padding during MAC computation
positive_passages.docid: 148445
positive_passages.text: chacha20-poly1305 padding and length encoding
negative_passages.docid: 64892
negative_passages.text: Easy explanation of "IND-" security notions?
negative_passages.docid: 141850
negative_passages.text: Why does this memory address %fs:0x28 ( fs[0x28] ) have a random value?
negative_passages.docid: 150836
negative_passages.text: Padding in Keccak SHA3 hashing algorithm
negative_passages.docid: 1737
negative_passages.text: How does the key schedule of Rijndael looks for keysizes other than 128 bit?
negative_passages.docid: 30730
negative_passages.text: Padding behavior
negative_passages.docid: 17900
negative_passages.text: Early propagation of carries in the BLAKE hash function
negative_passages.docid: 138956
negative_passages.text: How could Fully Homomorphic Encryption support power operations?
negative_passages.docid: 61030
negative_passages.text: Deep Analysis of Const Qualifier in C
negative_passages.docid: 5140
negative_passages.text: CBC-MAC Padding weaknesses
negative_passages.docid: 158415
negative_passages.text: Is Poly1305 an information-theoretically secure MAC?
negative_passages.docid: 143728
negative_passages.text: Is there a way of maintaining malleability in a homomorphic encryption system while making it infeasible to perform chosen ciphertext attacks?
negative_passages.docid: 114578
negative_passages.text: Design properties of the Rijndael finite field?
negative_passages.docid: 80847
negative_passages.text: Simple Python Challenge: Fastest Bitwise XOR on Data Buffers
negative_passages.docid: 155162
negative_passages.text: Practical Use of Zero-Length Bitfields
negative_passages.docid: 73999
negative_passages.text: Why can the last block contain a full block of padding in CBC Encryption?
negative_passages.docid: 23795
negative_passages.text: Dr. StrangeNumbers or: How I Learned to Stop Worrying and Love Floating Point Arithmetic