History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 69 total

Improved Practical Attacks on Round-Reduced Keccak. (English)
J. CryptologyJ. Cryptology 27, N0. 2, 183-209(2014)
1
Composition of low-error 2-query PCPs using decodable PCPs. (English)
SIAM J. Comput. 42, No. 6, 2452-2486 (2013).
2
Key recovery attacks on 3-round even-mansour, 8-step LED-128, and full $\mathrm{AES}^{2}$. (English)
Sako, Kazue (ed.) et al., Advances in cryptology ‒ ASIACRYPT 2013. 19th international conference on the theory and application of cryptology and information security, Bengaluru, India, December 1‒5, 2013. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-42032-0/pbk). Lecture Notes in Computer Science 8269, 337-356 (2013).
3
Clustering in the Boolean hypercube in a list decoding regime. (English)
Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8‒12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 413-424 (2013).
4
Special issue: Selected papers based on the presentations at the 27th annual IEEE conference on computational complexity (CCC 2012), Porto, Portugal, June 26‒29, 2012. (English)
Comput. Complexity 22, No. 2, 215-462 (2013).
5
Covering CSPs. (English)
IEEE Conference on Computational Complexity, 207-218(2013)
6
PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring. (English)
FOCS, 340-349(2013)
7
Special Issue "Conference on Computational Complexity 2012" Guest editors’ foreword. (English)
Computational ComplexityComputational Complexity 22, N0. 2, 215-217(2013)
8
Applying cube attacks to stream ciphers in realistic scenarios. (English)
Cryptogr. Commun. 4, No. 3-4, 217-232 (2012).
9
New attacks on Keccak-224 and Keccak-256. (English)
Canteaut, Anne (ed.), Fast software encryption. 19th international workshop, FSE 2012, Washington, DC, USA, March 19‒21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34046-8/pbk). Lecture Notes in Computer Science 7549, 442-461 (2012).
10
Improved attacks on full GOST. (English)
Canteaut, Anne (ed.), Fast software encryption. 19th international workshop, FSE 2012, Washington, DC, USA, March 19‒21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34046-8/pbk). Lecture Notes in Computer Science 7549, 9-28 (2012).
11
Efficient dissection of composite problems, with applications to cryptanalysis, knapsacks, and combinatorial search problems. (English)
Safavi-Naini, Reihaneh (ed.) et al., Advances in cryptology ‒ CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19‒23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32008-8/pbk). Lecture Notes in Computer Science 7417, 719-740 (2012).
12
An experimentally verified attack on full Grain-128 using dedicated reconfigurable hardware. (English)
Lee, Dong Hoon (ed.) et al., Advances in cryptology ‒ ASIACRYPT 2011. 17th international conference on the theory and application of cryptology and information security, Seoul, South Korea, December 4‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25384-3/pbk). Lecture Notes in Computer Science 7073, 327-343 (2011).
13
PCP characterizations of NP: toward a polynomially-small error-probability. (English)
Comput. Complexity 20, No. 3, 413-504 (2011).
14
Probabilistically checkable proofs and codes. (English)
Bhatia, Rajendra (ed.) et al., Proceedings of the international congress of mathematicians (ICM 2010), Hyderabad, India, August 19‒27, 2010. Vol. I: Plenary lectures and ceremonies. Hackensack, NJ: World Scientific; New Delhi: Hindustan Book Agency (ISBN 978-981-4324-30-4/set; 978-81-85931-08-3/hbk; 978-981-4324-31-1/hbk; 978-981-4324-35-9/ebook). 265-285 (2011).
15
Derandomized parallel repetition via structured PCPs. (English)
Comput. Complexity 20, No. 2, 207-327 (2011).
16
Dense locally testable codes cannot have constant rate and distance. (English)
Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 507-518 (2011).
17
Dense locally testable codes cannot have constant rate and distance. (English)
Electron. Colloq. Comput. Complex. 18, 55 (2011).
18
Breaking Grain-128 with dynamic cube attacks. (English)
Joux, Antoine (ed.), Fast software encryption. 18th international workshop, FSE 2011, Lyngby, Denmark, February 13‒16, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-21701-2/pbk). Lecture Notes in Computer Science 6733, 167-187 (2011).
19
An improved algebraic attack on Hamsi-256. (English)
Joux, Antoine (ed.), Fast software encryption. 18th international workshop, FSE 2011, Lyngby, Denmark, February 13‒16, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-21701-2/pbk). Lecture Notes in Computer Science 6733, 88-106 (2011).
20
first | previous | 1 21 41 61 | next | last

Result 1 to 20 of 69 total