Security-Enhanced Dynamic Routing with Cryptographic Techniques
D. L. Mills, DCN Local-Network Protocols, Request for comments (RFC 891), Dec. 1983.
T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 1990.
Gilbert S. Vernam, “Cipher printing telegraph systems for secret wire and radio telegraphic communications”, J. American Institute for Electrical Engineers, 55:109-115, 1926.
Claude E. Shannon, “Communication Theory of Secrecy Systems”, Bell Systems Technical J., 28:656-715, 1949.
Ronald L. Rivest, “Chaffing and Winnowing: Confidentiality without encryption”, Apr 1998, http://theory.lcs.mit.edu/ rivest/chaffing.txt
Ueli Maurer, “Information-Theoretic Cryptography (Extended Abstract)”, Proc. 19th Annual International Cryptology Conference, LNCS, 1666:47-64, 1999.
Christian Cachin, and Ueli Maurer, “Unconditional Security Against Memory-Bounded Adversaries”, Advances in Cryptology: CRYPTO '97, LNCS, 1294: 292-306, 1997.
Ueli Maurer, and Stefan Wolf, “Unconditionally secure key agreement and the intrinsic conditional information”, IEEE Transactions on Information Theory, 45- 2:499-514, 1999.
Manuel Gunter, Marc Brogle, and Torsten Braun, “Secure Communication: a New Application for Active Networks”, International Conference on Networking (ICN), 2001.
G.Brassard and C.Crepeau, “25 years of Quantum cryptography”, SIGACT News, 27-3:13-24,1996.
Jiri Fridrich, “Symmetric Ciphers Based On Two-Dimensional Chaotic Maps”, Intl. J. of Bifurcation and Chaos (IJBC) in Applied Sciences and Engineering, 8-6, 1998.
Federal Information Processing Standards Publication 197, Advanced Encryption Standard, Nat'l Institute of Standards and Technology, 2001.
Federal Information Processing Standards 46, Data Encryption Standards, Nat'l Bureau of Standards, 1977.
Ronald L. Rivest, Adi Shamir, and Leonard Adleman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”, Communications of the ACM, 21-2:120-126, 1978.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.