It's said that quantum computers can break block ciphers with 2^(n/2) queries (being n the key size).
I read this paper: https://eprint.iacr.org/2016/197
It says that CTR and OFB modes are safe against quantum adversaries.
That left me doubts.
Can a quantum adversary break a block cipher in CTR/OFB mode with 2^(n/2) queries? Or the queries will be like classic computing ( 2^(n/2) )?
I have another question.
I have an external HD fully encrypted with Threefish block cipher in CTR mode with 3 layers of 1024-bit keys. I know that CTR is vulnerable to meet-in-the-middle attacks and I have in practice 2049-bits of security only (despite the adversary having to store 2^1024 blocks in memory).
/\ In case the security of CTR be 2^n (being n the key size) in a quantum scenario, will I have 2049-bits of post-quantum security using CTR mode with 3 1024-keys in CTR mode?