摘要:
springer.com 
sci-hub.se 参考文章(97)
Wade Trappe, Ruoheng Liu, Securing Wireless Communications at the Physical Layer ,(2014)
Marc Mézard, Riccardo Zecchina, Random K -satisfiability problem: From an analytic solution to an efficient algorithm Physical Review E. ,vol. 66, pp. 056126- ,(2002) , 10.1103/PHYSREVE.66.056126
J. Nicholas Laneman, Matthieu R. Bloch, Secrecy from Resolvability ,(2011)
Ueli M. Maurer, The Strong Secret Key Rate of Discrete Random Triples Springer, Boston, MA. pp. 271- 285 ,(1994) , 10.1007/978-1-4615-2694-0_27
Thierry P. Berger, Pierre-Louis Cayrel, Philippe Gaborit, Ayoub Otmani, Reducing Key Length of the McEliece Cryptosystem international conference on cryptology in africa. pp. 77- 97 ,(2009) , 10.1007/978-3-642-02384-2_6
Jacques Stern, A method for finding codewords of small weight Proceedings of the third international colloquium on Coding theory and applications. pp. 106- 113 ,(1989) , 10.1007/BFB0019850
Emin Martinian, Jonathan S. Yedidia, Iterative Quantization Using Codes On Graphs arXiv: Information Theory. ,(2004)
Luis Pérez-Freire, Fernando Pérez-González, Exploiting security holes in lattice data hiding information hiding. ,vol. 4567, pp. 159- 173 ,(2007) , 10.1007/978-3-540-77370-2_11
Alfred J Menezes, Paul C van Oorschot, Scott A Vanstone, Handbook of Applied Cryptography ,(1996)
Ueli Maurer, Stefan Wolf, Information-theoretic key agreement: from weak to strong secrecy for free theory and application of cryptographic techniques. pp. 351- 368 ,(2000) , 10.1007/3-540-45539-6_24