Results 161 to 170 of about 93,599 (182)
Some of the next articles are maybe not open access.

One-Key Compression Function Based MAC with Security Beyond Birthday Bound

2016
Gaži et al. [CRYPTO 2014] analyzed the NI-MAC construction proposed by An and Bellare [CRYPTO 1999] and gave a tight birthday-bound of $$O\ell q^{2}/2^{n}$$, as an improvement over the previous bound of $$O\ell ^{2}q^{2}/2^{n}$$. In this paper, we design a simple extension of NI-MAC, called $$\mathrm{NI}^{+}$$-MAC, and prove that it has security bound ...
Avijit Dutta, Mridul Nandi, Goutam Paul
openaire   +1 more source

Efficient beyond-birthday-bound secure authenticated encryption modes

Science China Information Sciences, 2018
Ping Zhang, Honggang Hu, Peng Wang
openaire   +1 more source

XOCB: Beyond-Birthday-Bound Secure Authenticated Encryption Mode with Rate-One Computation

2023
Zhenzhen Bao   +5 more
openaire   +1 more source

Quantum attacks on Beyond-Birthday-Bound MACs

Physica A: Statistical Mechanics and Its Applications, 2023
Su-Juan Qin, Fei Gao
exaly  

Beyond-birthday security for permutation-based Feistel networks

Designs, Codes, and Cryptography, 2021
Chun Guo, Guo Chun
exaly  

Minimizing beyond-birthday-bound secure permutation-based pseudorandom function

Discrete Mathematics
Ping Zhang   +4 more
openaire   +1 more source

Attacks on Beyond-Birthday-Bound MACs in the Quantum Setting

Lecture Notes in Computer Science, 2021
exaly  

Generic Attacks Against Beyond-Birthday-Bound MACs

Lecture Notes in Computer Science, 2018
Gaëtan Leurent, Mridul Nandi
exaly  

Home - About - Disclaimer - Privacy