P. Kocher, Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems Advances in Cryptology -CRYPTO '96. Volume 1109 of Lecture Notes in Computer Science, pp.104-113, 1996.

P. C. Kocher, J. Jaffe, and B. Jun, Differential Power Analysis, Lecture Notes in Computer Science, vol.1666, pp.388-397, 1999.
DOI : 10.1007/3-540-48405-1_25

J. A. Halderman, S. D. Schoen, N. Heninger, W. Clarkson, W. Paul et al., Lest we remember, USENIX Security Symposium, USENIX Association, pp.45-60, 2008.
DOI : 10.1145/1506409.1506429

N. Heninger and H. Shacham, Reconstructing RSA Private Keys from Random Key Bits, Proceedings of Crypto 2009, pp.1-17, 2009.
DOI : 10.1007/978-3-642-03356-8_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.6281

S. Skorobogatov, Low temperature data remanence in static RAM, 2002.

A. Tsow, An Improved Recovery Algorithm for Decayed AES Key Schedule Images, Lecture Notes in Computer Science, vol.5867, pp.215-230, 2009.
DOI : 10.1007/978-3-642-05445-7_14

M. R. Albrecht and C. Cid, Cold Boot Key Recovery by Solving Polynomial Systems with Noise, Lecture Notes in Computer Science, vol.6715, pp.57-72, 2011.
DOI : 10.1007/978-3-642-05445-7_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.486

M. Brickenstein and A. Dreyer, PolyBoRi: A framework for Gr??bner-basis computations with Boolean polynomials, Journal of Symbolic Computation, vol.44, issue.9, pp.1326-1345, 2009.
DOI : 10.1016/j.jsc.2008.02.017

A. Shamir and N. Van-someren, Playing ???Hide and Seek??? with Stored Keys, pp.118-124, 1999.
DOI : 10.1007/3-540-48390-X_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.4467

C. Maartmann-moe, S. E. Thorkildsen, and A. Arnes, The persistence of memory: Forensic identification and extraction of cryptographic keys, Digital Investigation, pp.132-140, 2009.
DOI : 10.1016/j.diin.2009.06.002

B. Kaplan, Extracting Disk Encryption Keys From Volatile Memory, 2007.

N. Courtois, G. V. Bard, and D. Wagner, Algebraic and Slide Attacks on KeeLoq, Lecture Notes in Computer Science, vol.5086, pp.97-115, 2008.
DOI : 10.1007/978-3-540-71039-4_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.2872

N. Courtois and G. Bard, Algebraic Cryptanalysis of the Data Encryption Standard, Cryptography and Coding, pp.152-169, 2007.
DOI : 10.1007/978-3-540-77272-9_10

J. Erickson, J. Ding, and C. Christensen, Algebraic Cryptanalysis of SMS4: Gr??bner Basis Attack and SAT Attack Compared, Lecture Notes in Computer Science, vol.5984, pp.73-86, 2009.
DOI : 10.1007/978-3-642-14423-3_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.7408

B. Buchberger, In: Gröbner-Bases: An Algorithmic Method in Polynomial Ideal Theory, pp.184-232, 1985.

J. Buchmann, A. Pyshkin, and R. P. Weinmann, Block Ciphers Sensitive to Gr??bner Basis Attacks, Lecture Notes in Computer Science, vol.3860, pp.313-331, 2006.
DOI : 10.1007/11605805_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.4015

T. Eibach, E. Pilz, and G. Völkel, Attacking Bivium Using SAT Solvers, Proceedings of the 11th international conference on Theory and applications of satisfiability testing. SAT'08, pp.63-76, 2008.
DOI : 10.1007/978-3-540-79719-7_7

N. Courtois, S. O-'neil, and J. J. Quisquater, Practical Algebraic Attacks on the Hitag2 Stream Cipher, Lecture Notes in Computer Science, vol.24, pp.167-176, 2009.
DOI : 10.1007/3-540-39466-4_17

N. T. Courtois, K. Nohl, and S. O-'neil, Algebraic Attacks on the Crypto-1 Stream Cipher in MiFare Classic and Oyster Cards, Cryptology ePrint Archive Report, vol.166, 2008.

V. Velichkov, V. Rijmen, and B. Preneel, Algebraic cryptanalysis of a small-scale version of stream cipher Lex, IET Information Security, vol.4, issue.2, pp.49-61, 2010.
DOI : 10.1049/iet-ifs.2009.0118

I. Mironov and L. Zhang, Applications of SAT Solvers to Cryptanalysis of Hash Functions, Lecture Notes in Computer Science, vol.4121, pp.102-115, 2006.
DOI : 10.1007/11814948_13

D. De, A. Kumarasubramanian, and R. Venkatesan, Inversion Attacks on Secure Hash Functions Using sat Solvers, Lecture Notes in Computer Science, vol.4501, pp.377-382, 2007.
DOI : 10.1007/978-3-540-72788-0_36

M. Sugita, M. Kawazoe, L. Perret, and H. Imai, Algebraic Cryptanalysis of 58-Round SHA-1, Lecture Notes in Computer Science, vol.4593, pp.349-365, 2007.
DOI : 10.1007/978-3-540-74619-5_22
URL : https://hal.archives-ouvertes.fr/hal-01336553

X. Wang, Y. L. Yin, and H. Yu, Finding Collisions in the Full SHA-1, Lecture Notes in Computer Science, vol.3621, pp.17-36, 2005.
DOI : 10.1007/11535218_2

A. Segers, Algebraic Attacks from a Groebner Basis Perspective, 2004.

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

J. Daemen and V. Rijmen, The Design of Rijndael: AES -The Advanced Encryption Standard, 2002.
DOI : 10.1007/978-3-662-04722-4

R. Anderson, E. Biham, and L. Knudsen, Serpent: A Proposal for the Advanced Encryption Standard, 2012.

A. Kamal and A. Youssef, Applications of SAT Solvers to AES Key Recovery from Decayed Key Schedule Images, 2010 Fourth International Conference on Emerging Security Information, Systems and Technologies, pp.216-220, 2010.
DOI : 10.1109/SECURWARE.2010.42