( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Generating Large Instances of the Gong-Harn Cryptosystem.

, и . IMACC, том 2260 из Lecture Notes in Computer Science, стр. 317-328. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Guang Rao

Guang Bai

Guang Yu

Guang Guo

Guang Li

 

Другие публикации лиц с тем же именем

Some Notes on Constructions of Binary Sequences with Optimal Autocorrelation., и . CoRR, (2014)An Upper Bound of the Set Size of Perfect Sequences with Optimal Cross-correlation., , и . ISIT, стр. 532-535. IEEE, (2022)Generalized constructions of polyphase sequence families using shift and addition of multiplicative character sequences., и . ISIT, стр. 1258-1262. IEEE, (2010)PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model., , , , и . Public Key Cryptography (1), том 12110 из Lecture Notes in Computer Science, стр. 396-427. Springer, (2020)Efficient key agreement and signature schemes using compact representations in GF(p10)., и . ISIT, стр. 13. IEEE, (2004)New Implementations of the WG Stream Cipher., , и . IEEE Trans. Very Large Scale Integr. Syst., 22 (9): 1865-1878 (2014)Generating Large Instances of the Gong-Harn Cryptosystem., и . IMACC, том 2260 из Lecture Notes in Computer Science, стр. 317-328. Springer, (2001)A conjecture on binary sequences with the "Trinomial property"., и . IEEE Trans. Inf. Theory, 47 (1): 426-427 (2001)New designs for signal sets with low cross correlation, balance property, and largelinear span: GF(p) case.. IEEE Trans. Inf. Theory, 48 (11): 2847-2867 (2002)Nonlinear Generators of Binary Sequences with Controllable Complexity and Double Key.. AUSCRYPT, том 453 из Lecture Notes in Computer Science, стр. 32-36. Springer, (1990)