A note on the reducibility of binary affine polynomials
Designs, Codes and Cryptography
Efficient software implementations of large finite fields GF(2n) for secure storage applications
ACM Transactions on Storage (TOS)
Efficiently constructible huge graphs that preserve first order properties of random graphs
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
| Hi-index | 0.00 |