Results 1 -
1 of
1
Efficient Public Key Generation for Multivariate Cryptosystems
, 2003
"... Asymmetric cryptographic systems using multivariate polynomials over finite fields have been proposed several times since the 1980s. Although some of them have been successfully broken, the area is still vital and promises interesting algorithms with low computational costs, short message, and signa ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
Asymmetric cryptographic systems using multivariate polynomials over finite fields have been proposed several times since the 1980s. Although some of them have been successfully broken, the area is still vital and promises interesting algorithms with low computational costs, short message, and signature sizes.
