Encryption and Error-Correction Coding Using D Sequences
暂无分享,去创建一个
[1] Leonard M. Adleman,et al. A subexponential algorithm for the discrete logarithm problem with applications to cryptography , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[2] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[3] Subhash C. Kak. A Structural Redundancy in d-Sequences , 1983, IEEE Transactions on Computers.
[4] R. G. Stoneham. The reciprocals of integral powers of primes and normal numbers , 1964 .
[5] Martin E. Hellman,et al. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[6] M.E. Hellman,et al. Privacy and authentication: An introduction to cryptography , 1979, Proceedings of the IEEE.
[7] G. Hardy,et al. An Introduction to the Theory of Numbers , 1938 .
[8] Manuel Blum,et al. Comparison of Two Pseudo-Random Number Generators , 1982, CRYPTO.
[9] Don Coppersmith,et al. Fast evaluation of logarithms in fields of characteristic two , 1984, IEEE Trans. Inf. Theory.
[10] Justin M. Reyneri,et al. Fast Computation of Discrete Logarithms in GF(q) , 1982, CRYPTO.
[11] Subhash C. Kak,et al. On decimal sequences , 1981, IEEE Trans. Inf. Theory.
[12] Joseph J. Liang,et al. Weak radix representation and cyclic codes over euclidean domains , 1976 .
[13] S. Kak,et al. On decimal sequences (Corresp.) , 1981 .