On Nearly Orthogonal Lattice Bases and Random Lattices
暂无分享,去创建一个
[1] M. Rudelson,et al. Smallest singular value of random matrices and geometry of random polytopes , 2005 .
[2] Dan Craigen,et al. Experience with formal methods in critical systems , 1994, IEEE Software.
[3] R. Kannan. ALGORITHMIC GEOMETRY OF NUMBERS , 1987 .
[4] Miklós Ajtai,et al. The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.
[5] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[6] Brant Hashii,et al. Lessons learned using alloy to formally specify MLS-PCA trusted security architecture , 2004, FMSE '04.
[7] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[8] K. Caplan,et al. Building an international security standard , 1999 .
[9] Carl Friedrich Gauß. Carl Friedrich Gauss' Untersuchungen über höhere Arithmetik. (Disquisitiones arithmeticae. Theorematis arithmetici demonstratio nova. Summatio quarundam serierum singularium ó. ). Deutsch hrsg. von H. Mas , 1889 .
[10] Brigitte Vallée,et al. An Upper Bound on the Average Number of Iterations of the LLL Algorithm , 1994, Theor. Comput. Sci..
[11] Dawn M. Cappelli,et al. Comparing Insider IT Sabotage and Espionage: A Model-Based Analysis , 2006 .
[12] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.
[13] John Rushby,et al. Formal Methods and the Certification of Critical Systems , 2004 .
[14] J. W. Silverstein. The Smallest Eigenvalue of a Large Dimensional Wishart Matrix , 1985 .
[15] Shafi Goldwasser,et al. Complexity of lattice problems , 2002 .
[16] Manu Sridharan,et al. A micromodularity mechanism , 2001, ESEC/FSE-9.
[17] Shari Lawrence Pfleeger,et al. Software Quality: The Elusive Target , 1996, IEEE Softw..
[18] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[19] Alan Bundy,et al. Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.
[20] Daniel Jackson,et al. Software Abstractions - Logic, Language, and Analysis , 2006 .
[21] Jacques Stern,et al. Lattice Reduction in Cryptology: An Update , 2000, ANTS.
[22] Guy Kindler,et al. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard , 2003, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[23] Gaurav Sharma,et al. Digital color imaging , 1997, IEEE Trans. Image Process..
[24] Joan L. Mitchell,et al. JPEG: Still Image Data Compression Standard , 1992 .
[25] V. Rich. Personal communication , 1989, Nature.
[26] Jonathan P. Bowen,et al. Ten Commandments of Formal Methods , 1995, Computer.
[27] Mohamed Oussama Damen,et al. Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.
[28] John Laurence Donaldson,et al. Minkowski Reduction of Integral Matrices , 1979 .
[29] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[30] Daniel Jackson,et al. Alloy: a lightweight object modelling notation , 2002, TSEM.
[31] Sanjeeb Dash,et al. JPEG compression history estimation for color images , 2003, IEEE Transactions on Image Processing.
[32] Damien Stehlé,et al. Low-dimensional lattice basis reduction revisited , 2004, TALG.
[33] Subhash Khot,et al. Hardness of approximating the shortest vector problem in lattices , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[34] Premkumar T. Devanbu,et al. Software engineering for security: a roadmap , 2000, ICSE '00.
[35] Mario Piattini,et al. A common criteria based security requirements engineering process for the development of secure information systems , 2007, Comput. Stand. Interfaces.
[36] Noureddine El Karoui,et al. Recent Results About the Largest Eigenvalue of Random Covariance Matrices and Statistical Application , 2005 .
[37] Jean-François Marckert,et al. On the Reduction of a Random Basis , 2006, ANALCO.
[38] László Babai,et al. On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..
[39] Amerson H Lin. Automated Analysis of Security APIs , 2005 .
[40] Charles A. Poynton,et al. A technical introduction to digital video , 1996 .
[41] Heinz H. Bauschke,et al. Recompression of JPEG images by requantization , 2003, IEEE Trans. Image Process..
[42] Anthony Hall,et al. Seven myths of formal methods , 1990, IEEE Software.
[43] J. Michael Spivey,et al. Understanding Z : A specification language and its formal semantics , 1985, Cambridge tracts in theoretical computer science.
[44] Edmund M. Clarke,et al. Formal Methods: State of the Art and Future Directions Working Group Members , 1996 .
[45] Alexander Vardy,et al. Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.
[46] Guy Kindler,et al. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard , 1998, Electron. Colloquium Comput. Complex..
[47] Richard G. Baraniuk,et al. Inverse problems in image processing , 2004 .
[48] Stephanie Motre,et al. Using B Method to Formalize the Java Card Runtime Security Policy for a Common Criteria Evaluation , 1999 .
[49] Eugene Goldberg,et al. BerkMin: A Fast and Robust Sat-Solver , 2002 .