Efficient key agreement and signature schemes using compact representations in GF(p/sup 10/)
暂无分享,去创建一个
[1] Alice Silverberg,et al. Torus-Based Cryptography , 2003, CRYPTO.
[2] Valentin Evgenʹevich Voskresenskiĭ,et al. Algebraic Groups and Their Birational Invariants , 1998 .
[3] Michael O. Rabin,et al. Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..
[4] Chris J. Skinner,et al. A Public-Key Cryptosystem and a Digital Signature System BAsed on the Lucas Function Analogue to Discrete Logarithms , 1994, ASIACRYPT.
[5] Atsuko Miyaji,et al. Efficient Elliptic Curve Exponentiation Using Mixed Coordinates , 1998, ASIACRYPT.
[6] Solomon W. Golomb,et al. Shift Register Sequences , 1981 .
[7] Guang Gong,et al. Analogues to the Gong-Harn and XTR Cryptosystems , 2022 .
[8] Guang Gong,et al. Public-key cryptosystems based on cubic finite field extensions , 1999, IEEE Trans. Inf. Theory.
[9] Arjen K. Lenstra,et al. The XTR Public Key System , 2000, CRYPTO.
[10] Eric R. Verheul,et al. Looking beyond XTR , 2002, ASIACRYPT.
[11] Eric R. Verheul,et al. Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems , 2001, Journal of Cryptology.