generated by bibbase.org
  2021 (3)
Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices. Albrecht, M. R.; Davidson, A.; Deo, A.; and Smart, N. P. In Public-Key Cryptography - PKC 2021 - 24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10-13, 2021, Proceedings, Part II, pages 261–289, 2021.
Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices [link]Paper   doi   bibtex  
Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices. Albrecht, M. R.; and Lai, R. W. F. IACR Cryptol. ePrint Arch., 2021: 202. 2021.
Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices [link]Paper   bibtex  
Mesh Messaging in Large-scale Protests: Breaking Bridgefy. Albrecht, M. R.; Blasco, J.; Jensen, R. B.; and Mareková, L. IACR Cryptol. ePrint Arch., 2021: 214. 2021.
Mesh Messaging in Large-scale Protests: Breaking Bridgefy [link]Paper   bibtex  
  2020 (8)
Multilinear Maps from Obfuscation. Albrecht, M. R.; Farshim, P.; Han, S.; Hofheinz, D.; Larraia, E.; and Paterson, K. G. J. Cryptol., 33(3): 1080–1113. 2020.
Multilinear Maps from Obfuscation [link]Paper   doi   bibtex  
Estimating Quantum Speedups for Lattice Sieves. Albrecht, M. R.; Gheorghiu, V.; Postlethwaite, E. W.; and Schanck, J. M. In Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part II, pages 583–613, 2020.
Estimating Quantum Speedups for Lattice Sieves [link]Paper   doi   bibtex  
Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k\(^\mbox1/(2k)\) Time k\(^\mboxk/8+o(k)\). Albrecht, M. R.; Bai, S.; Fouque, P.; Kirchner, P.; Stehlé, D.; and Wen, W. In Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II, pages 186–212, 2020.
Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k\(^\mbox1/(2k)\) Time k\(^\mboxk/8+o(k)\) [link]Paper   doi   bibtex  
The Vacuity of the Open Source Security Testing Methodology Manual. Albrecht, M. R.; and Jensen, R. B. In Security Standardisation Research - 6th International Conference, SSR 2020, London, UK, November 30 - December 1, 2020, Proceedings, pages 114–147, 2020.
The Vacuity of the Open Source Security Testing Methodology Manual [link]Paper   doi   bibtex  
The Vacuity of the Open Source Security Testing Methodology Manual. Albrecht, M. R.; and Jensen, R. B. CoRR, abs/2010.06377. 2020.
The Vacuity of the Open Source Security Testing Methodology Manual [link]Paper   bibtex  
Faster Enumeration-based Lattice Reduction: Root Hermite Factor k\^(1/(2k)) in Time k\^(k/8 + o(k)). Albrecht, M. R.; Bai, S.; Fouque, P.; Kirchner, P.; Stehlé, D.; and Wen, W. IACR Cryptol. ePrint Arch., 2020: 707. 2020.
Faster Enumeration-based Lattice Reduction: Root Hermite Factor k\^(1/(2k)) in Time k\^(k/8 + o(k)) [link]Paper   bibtex  
Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Performance. Albrecht, M. R.; Bai, S.; Li, J.; and Rowell, J. IACR Cryptol. ePrint Arch., 2020: 1260. 2020.
Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Performance [link]Paper   bibtex  
On Bounded Distance Decoding with Predicate: Breaking the "Lattice Barrier" for the Hidden Number Problem. Albrecht, M. R.; and Heninger, N. IACR Cryptol. ePrint Arch., 2020: 1540. 2020.
On Bounded Distance Decoding with Predicate: Breaking the "Lattice Barrier" for the Hidden Number Problem [link]Paper   bibtex  
  2019 (14)
Implementing RLWE-based Schemes Using an RSA Co-Processor. Albrecht, M. R.; Hanser, C.; Höller, A.; Pöppelmann, T.; Virdia, F.; and Wallner, A. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019(1): 169–208. 2019.
Implementing RLWE-based Schemes Using an RSA Co-Processor [link]Paper   doi   bibtex  
libInterMAC: Beyond Confidentiality and Integrity in Practice. Albrecht, M. R.; Hansen, T. B.; and Paterson, K. G. IACR Trans. Symmetric Cryptol., 2019(1): 46–83. 2019.
libInterMAC: Beyond Confidentiality and Integrity in Practice [link]Paper   doi   bibtex  
Algebraic Cryptanalysis of STARK-Friendly Designs: Application to MARVELlous and MiMC. Albrecht, M. R.; Cid, C.; Grassi, L.; Khovratovich, D.; Lüftenegger, R.; Rechberger, C.; and Schofnegger, M. In Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8-12, 2019, Proceedings, Part III, pages 371–397, 2019.
Algebraic Cryptanalysis of STARK-Friendly Designs: Application to MARVELlous and MiMC [link]Paper   doi   bibtex  
Feistel Structures for MPC, and More. Albrecht, M. R.; Grassi, L.; Perrin, L.; Ramacher, S.; Rechberger, C.; Rotaru, D.; Roy, A.; and Schofnegger, M. In Computer Security - ESORICS 2019 - 24th European Symposium on Research in Computer Security, Luxembourg, September 23-27, 2019, Proceedings, Part II, pages 151–171, 2019.
Feistel Structures for MPC, and More [link]Paper   doi   bibtex  
The General Sieve Kernel and New Records in Lattice Reduction. Albrecht, M. R.; Ducas, L.; Herold, G.; Kirshanova, E.; Postlethwaite, E. W.; and Stevens, M. In Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part II, pages 717–746, 2019.
The General Sieve Kernel and New Records in Lattice Reduction [link]Paper   doi   bibtex  
Exploring Trade-offs in Batch Bounded Distance Decoding. Albrecht, M. R.; Curtis, B. R.; and Wunderer, T. In Selected Areas in Cryptography - SAC 2019 - 26th International Conference, Waterloo, ON, Canada, August 12-16, 2019, Revised Selected Papers, pages 467–491, 2019.
Exploring Trade-offs in Batch Bounded Distance Decoding [link]Paper   doi   bibtex  
The General Sieve Kernel and New Records in Lattice Reduction. Albrecht, M. R.; Ducas, L.; Herold, G.; Kirshanova, E.; Postlethwaite, E. W.; and Stevens, M. IACR Cryptol. ePrint Arch., 2019: 89. 2019.
The General Sieve Kernel and New Records in Lattice Reduction [link]Paper   bibtex  
libInterMAC: Beyond Confidentiality and Integrity in Practice. Albrecht, M. R.; Hansen, T. B.; and Paterson, K. G. IACR Cryptol. ePrint Arch., 2019: 165. 2019.
libInterMAC: Beyond Confidentiality and Integrity in Practice [link]Paper   bibtex  
Feistel Structures for MPC, and More. Albrecht, M. R.; Grassi, L.; Perrin, L.; Ramacher, S.; Rechberger, C.; Rotaru, D.; Roy, A.; and Schofnegger, M. IACR Cryptol. ePrint Arch., 2019: 397. 2019.
Feistel Structures for MPC, and More [link]Paper   bibtex  
Algebraic Cryptanalysis of STARK-Friendly Designs: Application to MARVELlous and MiMC. Albrecht, M. R.; Cid, C.; Grassi, L.; Khovratovich, D.; Lüftenegger, R.; Rechberger, C.; and Schofnegger, M. IACR Cryptol. ePrint Arch., 2019: 419. 2019.
Algebraic Cryptanalysis of STARK-Friendly Designs: Application to MARVELlous and MiMC [link]Paper   bibtex  
Homomorphic Encryption Standard. Albrecht, M. R.; Chase, M.; Chen, H.; Ding, J.; Goldwasser, S.; Gorbunov, S.; Halevi, S.; Hoffstein, J.; Laine, K.; Lauter, K. E.; Lokam, S.; Micciancio, D.; Moody, D.; Morrison, T.; Sahai, A.; and Vaikuntanathan, V. IACR Cryptol. ePrint Arch., 2019: 939. 2019.
Homomorphic Encryption Standard [link]Paper   bibtex  
Exploring Trade-offs in Batch Bounded Distance Decoding. Albrecht, M. R.; Curtis, B. R.; and Wunderer, T. IACR Cryptol. ePrint Arch., 2019: 1122. 2019.
Exploring Trade-offs in Batch Bounded Distance Decoding [link]Paper   bibtex  
Quantum speedups for lattice sieves are tenuous at best. Albrecht, M. R.; Gheorghiu, V.; Postlethwaite, E. W.; and Schanck, J. M. IACR Cryptol. ePrint Arch., 2019: 1161. 2019.
Quantum speedups for lattice sieves are tenuous at best [link]Paper   bibtex  
Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices. Albrecht, M. R.; Davidson, A.; Deo, A.; and Smart, N. P. IACR Cryptol. ePrint Arch., 2019: 1271. 2019.
Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices [link]Paper   bibtex  
  2018 (7)
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT. Albrecht, M. R.; Deo, A.; and Paterson, K. G. IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018(3): 173–213. 2018.
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT [link]Paper   doi   bibtex  
Prime and Prejudice: Primality Testing Under Adversarial Conditions. Albrecht, M. R.; Massimo, J.; Paterson, K. G.; and Somorovsky, J. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, October 15-19, 2018, pages 281–298, 2018.
Prime and Prejudice: Primality Testing Under Adversarial Conditions [link]Paper   doi   bibtex  
Estimate All the \LWE, NTRU\ Schemes!. Albrecht, M. R.; Curtis, B. R.; Deo, A.; Davidson, A.; Player, R.; Postlethwaite, E. W.; Virdia, F.; and Wunderer, T. In Security and Cryptography for Networks - 11th International Conference, SCN 2018, Amalfi, Italy, September 5-7, 2018, Proceedings, pages 351–367, 2018.
Estimate All the \LWE, NTRU\ Schemes! [link]Paper   doi   bibtex  
Estimate all the \LWE, NTRU\ schemes!. Albrecht, M. R.; Curtis, B. R.; Deo, A.; Davidson, A.; Player, R.; Postlethwaite, E. W.; Virdia, F.; and Wunderer, T. IACR Cryptol. ePrint Arch., 2018: 331. 2018.
Estimate all the \LWE, NTRU\ schemes! [link]Paper   bibtex  
Learning with Errors on RSA Co-Processors. Albrecht, M. R.; Hanser, C.; Höller, A.; Pöppelmann, T.; Virdia, F.; and Wallner, A. IACR Cryptol. ePrint Arch., 2018: 425. 2018.
Learning with Errors on RSA Co-Processors [link]Paper   bibtex  
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT. Albrecht, M. R.; Deo, A.; and Paterson, K. G. IACR Cryptol. ePrint Arch., 2018: 672. 2018.
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT [link]Paper   bibtex  
Prime and Prejudice: Primality Testing Under Adversarial Conditions. Albrecht, M. R.; Massimo, J.; Paterson, K. G.; and Somorovsky, J. IACR Cryptol. ePrint Arch., 2018: 749. 2018.
Prime and Prejudice: Primality Testing Under Adversarial Conditions [link]Paper   bibtex  
  2017 (11)
Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography. Melchor, C. A.; Albrecht, M. R.; and Ricosset, T. In Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings, pages 3–19, 2017.
Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography [link]Paper   doi   bibtex  
Large Modulus Ring-LWE \(\geq\) Module-LWE. Albrecht, M. R.; and Deo, A. In Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I, pages 267–296, 2017.
Large Modulus Ring-LWE \(\geq\) Module-LWE [link]Paper   doi   bibtex  
Revisiting the Expected Cost of Solving uSVP and Applications to LWE. Albrecht, M. R.; Göpfert, F.; Virdia, F.; and Wunderer, T. In Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I, pages 297–322, 2017.
Revisiting the Expected Cost of Solving uSVP and Applications to LWE [link]Paper   doi   bibtex  
Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. Albrecht, M. R.; Orsini, E.; Paterson, K. G.; Peer, G.; and Smart, N. P. In Computer Security - ESORICS 2017 - 22nd European Symposium on Research in Computer Security, Oslo, Norway, September 11-15, 2017, Proceedings, Part I, pages 29–46, 2017.
Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts [link]Paper   doi   bibtex  
On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL. Albrecht, M. R. In Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part II, pages 103–129, 2017.
On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL [link]Paper   doi   bibtex  
Notes on GGH13 Without the Presence of Ideals. Albrecht, M. R.; Davidson, A.; and Larraia, E. In Cryptography and Coding - 16th IMA International Conference, IMACC 2017, Oxford, UK, December 12-14, 2017, Proceedings, pages 135–158, 2017.
Notes on GGH13 Without the Presence of Ideals [link]Paper   doi   bibtex  
On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL. Albrecht, M. R. IACR Cryptol. ePrint Arch., 2017: 47. 2017.
On dual lattice attacks against small-secret LWE and parameter choices in HElib and SEAL [link]Paper   bibtex  
Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts. Albrecht, M. R.; Orsini, E.; Paterson, K. G.; Peer, G.; and Smart, N. P. IACR Cryptol. ePrint Arch., 2017: 354. 2017.
Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts [link]Paper   bibtex  
Large Modulus Ring-LWE \textgreater= Module-LWE. Albrecht, M. R.; and Deo, A. IACR Cryptol. ePrint Arch., 2017: 612. 2017.
Large Modulus Ring-LWE \textgreater= Module-LWE [link]Paper   bibtex  
Revisiting the Expected Cost of Solving uSVP and Applications to LWE. Albrecht, M. R.; Göpfert, F.; Virdia, F.; and Wunderer, T. IACR Cryptol. ePrint Arch., 2017: 815. 2017.
Revisiting the Expected Cost of Solving uSVP and Applications to LWE [link]Paper   bibtex  
Notes On GGH13 Without The Presence Of Ideals. Albrecht, M. R.; Davidson, A.; Larraia, E.; and Pellet-Mary, A. IACR Cryptol. ePrint Arch., 2017: 906. 2017.
Notes On GGH13 Without The Presence Of Ideals [link]Paper   bibtex  
  2016 (9)
Polly Cracker, revisited. Albrecht, M. R.; Faugère, J.; Farshim, P.; Herold, G.; and Perret, L. Des. Codes Cryptogr., 79(2): 261–302. 2016.
Polly Cracker, revisited [link]Paper   doi   bibtex  
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. Albrecht, M. R.; Grassi, L.; Rechberger, C.; Roy, A.; and Tiessen, T. In Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part I, pages 191–219, 2016.
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity [link]Paper   doi   bibtex  
A Surfeit of SSH Cipher Suites. Albrecht, M. R.; Degabriele, J. P.; Hansen, T. B.; and Paterson, K. G. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, October 24-28, 2016, pages 1480–1491, 2016.
A Surfeit of SSH Cipher Suites [link]Paper   doi   bibtex  
A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes. Albrecht, M. R.; Bai, S.; and Ducas, L. In Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part I, pages 153–178, 2016.
A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes [link]Paper   doi   bibtex  
Lucky Microseconds: A Timing Attack on Amazon's s2n Implementation of TLS. Albrecht, M. R.; and Paterson, K. G. In Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part I, pages 622–643, 2016.
Lucky Microseconds: A Timing Attack on Amazon's s2n Implementation of TLS [link]Paper   doi   bibtex  
Multilinear Maps from Obfuscation. Albrecht, M. R.; Farshim, P.; Hofheinz, D.; Larraia, E.; and Paterson, K. G. In Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, pages 446–473, 2016.
Multilinear Maps from Obfuscation [link]Paper   doi   bibtex  
A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and Graded Encoding Schemes. Albrecht, M. R.; Bai, S.; and Ducas, L. IACR Cryptol. ePrint Arch., 2016: 127. 2016.
A subfield lattice attack on overstretched NTRU assumptions: Cryptanalysis of some FHE and Graded Encoding Schemes [link]Paper   bibtex  
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. Albrecht, M. R.; Grassi, L.; Rechberger, C.; Roy, A.; and Tiessen, T. IACR Cryptol. ePrint Arch., 2016: 492. 2016.
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity [link]Paper   bibtex  
Ciphers for MPC and FHE. Albrecht, M. R.; Rechberger, C.; Schneider, T.; Tiessen, T.; and Zohner, M. IACR Cryptol. ePrint Arch., 2016: 687. 2016.
Ciphers for MPC and FHE [link]Paper   bibtex  
  2015 (8)
Algebraic algorithms for LWE problems. Albrecht, M. R.; Cid, C.; Faugère, J.; Fitzpatrick, R.; and Perret, L. ACM Commun. Comput. Algebra, 49(2): 62. 2015.
Algebraic algorithms for LWE problems [link]Paper   doi   bibtex  
On the complexity of the BKW algorithm on LWE. Albrecht, M. R.; Cid, C.; Faugère, J.; Fitzpatrick, R.; and Perret, L. Des. Codes Cryptogr., 74(2): 325–354. 2015.
On the complexity of the BKW algorithm on LWE [link]Paper   doi   bibtex  
On the concrete hardness of Learning with Errors. Albrecht, M. R.; Player, R.; and Scott, S. J. Math. Cryptol., 9(3): 169–203. 2015.
On the concrete hardness of Learning with Errors [link]Paper   bibtex  
Implementing Candidate Graded Encoding Schemes from Ideal Lattices. Albrecht, M. R.; Cocis, C.; Laguillaumie, F.; and Langlois, A. In Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29 - December 3, 2015, Proceedings, Part II, pages 752–775, 2015.
Implementing Candidate Graded Encoding Schemes from Ideal Lattices [link]Paper   doi   bibtex  
Ciphers for MPC and FHE. Albrecht, M. R.; Rechberger, C.; Schneider, T.; Tiessen, T.; and Zohner, M. In Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I, pages 430–454, 2015.
Ciphers for MPC and FHE [link]Paper   doi   bibtex  
On the concrete hardness of Learning with Errors. Albrecht, M. R.; Player, R.; and Scott, S. IACR Cryptol. ePrint Arch., 2015: 46. 2015.
On the concrete hardness of Learning with Errors [link]Paper   bibtex  
Multilinear Maps from Obfuscation. Albrecht, M. R.; Farshim, P.; Hofheinz, D.; Larraia, E.; and Paterson, K. G. IACR Cryptol. ePrint Arch., 2015: 780. 2015.
Multilinear Maps from Obfuscation [link]Paper   bibtex  
Lucky Microseconds: A Timing Attack on Amazon's s2n Implementation of TLS. Albrecht, M. R.; and Paterson, K. G. IACR Cryptol. ePrint Arch., 2015: 1129. 2015.
Lucky Microseconds: A Timing Attack on Amazon's s2n Implementation of TLS [link]Paper   bibtex  
  2014 (7)
Block Ciphers - Focus on the Linear Layer (feat. PRIDE). Albrecht, M. R.; Driessen, B.; Kavun, E. B.; Leander, G.; Paar, C.; and Yalçin, T. In Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I, pages 57–76, 2014.
Block Ciphers - Focus on the Linear Layer (feat. PRIDE) [link]Paper   doi   bibtex  
Lazy Modulus Switching for the BKW Algorithm on LWE. Albrecht, M. R.; Faugère, J.; Fitzpatrick, R.; and Perret, L. In Public-Key Cryptography - PKC 2014 - 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26-28, 2014. Proceedings, pages 429–445, 2014.
Lazy Modulus Switching for the BKW Algorithm on LWE [link]Paper   doi   bibtex  
Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions. Albrecht, M. R.; Faugère, J.; Fitzpatrick, R.; Perret, L.; Todo, Y.; and Xagawa, K. In Public-Key Cryptography - PKC 2014 - 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26-28, 2014. Proceedings, pages 446–464, 2014.
Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions [link]Paper   doi   bibtex  
Lazy Modulus Switching for the BKW Algorithm on LWE. Albrecht, M. R.; Faugère, J.; Fitzpatrick, R.; and Perret, L. IACR Cryptol. ePrint Arch., 2014: 19. 2014.
Lazy Modulus Switching for the BKW Algorithm on LWE [link]Paper   bibtex  
Block Ciphers - Focus On The Linear Layer (feat. PRIDE): Full Version. Albrecht, M. R.; Driessen, B.; Kavun, E. B.; Leander, G.; Paar, C.; and Yalçin, T. IACR Cryptol. ePrint Arch., 2014: 453. 2014.
Block Ciphers - Focus On The Linear Layer (feat. PRIDE): Full Version [link]Paper   bibtex  
Improved Parameters and an Implementation of Graded Encoding Schemes from Ideal Lattices. Albrecht, M. R.; Cocis, C.; Laguillaumie, F.; and Langlois, A. IACR Cryptol. ePrint Arch., 2014: 928. 2014.
Improved Parameters and an Implementation of Graded Encoding Schemes from Ideal Lattices [link]Paper   bibtex  
Algebraic Algorithms for LWE Problems. Albrecht, M. R.; Cid, C.; Faugère, J.; Fitzpatrick, R.; and Perret, L. IACR Cryptol. ePrint Arch., 2014: 1018. 2014.
Algebraic Algorithms for LWE Problems [link]Paper   bibtex  
  2013 (3)
On the Efficacy of Solving LWE by Reduction to Unique-SVP. Albrecht, M. R.; Fitzpatrick, R.; and Göpfert, F. In Information Security and Cryptology - ICISC 2013 - 16th International Conference, Seoul, Korea, November 27-29, 2013, Revised Selected Papers, pages 293–310, 2013.
On the Efficacy of Solving LWE by Reduction to Unique-SVP [link]Paper   doi   bibtex  
Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions. Albrecht, M. R.; Faugère, J.; Fitzpatrick, R.; and Perret, L. IACR Cryptol. ePrint Arch., 2013: 470. 2013.
Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions [link]Paper   bibtex  
On the Efficacy of Solving LWE by Reduction to Unique-SVP. Albrecht, M. R.; Fitzpatrick, R.; and Göpfert, F. IACR Cryptol. ePrint Arch., 2013: 602. 2013.
On the Efficacy of Solving LWE by Reduction to Unique-SVP [link]Paper   bibtex  
  2012 (6)
On the relation between the MXL family of algorithms and Gröbner basis algorithms. Albrecht, M. R.; Cid, C.; Faugère, J.; and Perret, L. J. Symb. Comput., 47(8): 926–941. 2012.
On the relation between the MXL family of algorithms and Gröbner basis algorithms [link]Paper   doi   bibtex  
The M4RIE library for dense linear algebra over small fields with even characteristic. Albrecht, M. R. In International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012, pages 28–34, 2012.
The M4RIE library for dense linear algebra over small fields with even characteristic [link]Paper   doi   bibtex  
An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers. Albrecht, M. R.; and Leander, G. In Selected Areas in Cryptography, 19th International Conference, SAC 2012, Windsor, ON, Canada, August 15-16, 2012, Revised Selected Papers, pages 1–15, 2012.
An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers [link]Paper   doi   bibtex  
Polly Cracker, Revisited. Albrecht, M. R.; Farshim, P.; Faugère, J.; Herold, G.; and Perret, L. Electron. Colloquium Comput. Complex., 19: 165. 2012.
Polly Cracker, Revisited [link]Paper   bibtex  
An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers. Albrecht, M. R.; and Leander, G. IACR Cryptol. ePrint Arch., 2012: 401. 2012.
An All-In-One Approach to Differential Cryptanalysis for Small Block Ciphers [link]Paper   bibtex  
On the Complexity of the BKW Algorithm on LWE. Albrecht, M. R.; Cid, C.; Faugère, J.; Fitzpatrick, R.; and Perret, L. IACR Cryptol. ePrint Arch., 2012: 636. 2012.
On the Complexity of the BKW Algorithm on LWE [link]Paper   bibtex  
  2011 (10)
Cold Boot Key Recovery by Solving Polynomial Systems with Noise. Albrecht, M. R.; and Cid, C. In Applied Cryptography and Network Security - 9th International Conference, ACNS 2011, Nerja, Spain, June 7-10, 2011. Proceedings, pages 57–72, 2011.
Cold Boot Key Recovery by Solving Polynomial Systems with Noise [link]Paper   doi   bibtex  
Polly Cracker, Revisited. Albrecht, M. R.; Farshim, P.; Faugère, J.; and Perret, L. In 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, pages 179–196, 2011.
Polly Cracker, Revisited [link]Paper   doi   bibtex  
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model. Albrecht, M. R.; Farshim, P.; Paterson, K. G.; and Watson, G. J. In Fast Software Encryption - 18th International Workshop, FSE 2011, Lyngby, Denmark, February 13-16, 2011, Revised Selected Papers, pages 128–145, 2011.
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model [link]Paper   doi   bibtex  
Breaking an Identity-Based Encryption Scheme Based on DHIES. Albrecht, M. R.; and Paterson, K. G. In Cryptography and Coding - 13th IMA International Conference, IMACC 2011, Oxford, UK, December 12-15, 2011. Proceedings, pages 344–355, 2011.
Breaking an Identity-Based Encryption Scheme Based on DHIES [link]Paper   doi   bibtex  
Efficient Dense Gaussian Elimination over the Finite Field with Two Elements. Albrecht, M. R.; Bard, G. V.; and Pernet, C. CoRR, abs/1111.6549. 2011.
Efficient Dense Gaussian Elimination over the Finite Field with Two Elements [link]Paper   bibtex  
The M4RIE library for dense linear algebra over small fields with even characteristic. Albrecht, M. R. CoRR, abs/1111.6900. 2011.
The M4RIE library for dense linear algebra over small fields with even characteristic [link]Paper   bibtex  
Cold Boot Key Recovery by Solving Polynomial Systems with Noise. Albrecht, M. R.; and Cid, C. IACR Cryptol. ePrint Arch., 2011: 38. 2011.
Cold Boot Key Recovery by Solving Polynomial Systems with Noise [link]Paper   bibtex  
On the Relation Between the Mutant Strategy and the Normal Selection Strategy in Gröbner Basis Algorithms. Albrecht, M. R.; Cid, C.; Faugère, J.; and Perret, L. IACR Cryptol. ePrint Arch., 2011: 164. 2011.
On the Relation Between the Mutant Strategy and the Normal Selection Strategy in Gröbner Basis Algorithms [link]Paper   bibtex  
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model. Albrecht, M. R.; Farshim, P.; Paterson, K. G.; and Watson, G. J. IACR Cryptol. ePrint Arch., 2011: 213. 2011.
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model [link]Paper   bibtex  
Polly Cracker, Revisited. Albrecht, M. R.; Farshim, P.; Faugère, J.; and Perret, L. IACR Cryptol. ePrint Arch., 2011: 289. 2011.
Polly Cracker, Revisited [link]Paper   bibtex  
  2010 (5)
Algorithmic algebraic techniques and their application to block cipher cryptanalysis. Albrecht, M. R. Ph.D. Thesis, Royal Holloway, University of London, Egham, UK, 2010.
Algorithmic algebraic techniques and their application to block cipher cryptanalysis [link]Paper   bibtex  
Algorithm 898: Efficient multiplication of dense matrices over GF(2). Albrecht, M. R.; Bard, G. V.; and Hart, W. ACM Trans. Math. Softw., 37(1): 9:1–9:14. 2010.
Algorithm 898: Efficient multiplication of dense matrices over GF(2) [link]Paper   doi   bibtex  
Algebraic Precomputations in Differential and Integral Cryptanalysis. Albrecht, M. R.; Cid, C.; Dullien, T.; Faugère, J.; and Perret, L. In Information Security and Cryptology - 6th International Conference, Inscrypt 2010, Shanghai, China, October 20-24, 2010, Revised Selected Papers, pages 387–403, 2010.
Algebraic Precomputations in Differential and Integral Cryptanalysis [link]Paper   doi   bibtex  
Efficient Decomposition of Dense Matrices over GF(2). Albrecht, M. R.; and Pernet, C. CoRR, abs/1006.1744. 2010.
Efficient Decomposition of Dense Matrices over GF(2) [link]Paper   bibtex  
Breaking An Identity-Based Encryption Scheme based on DHIES. Albrecht, M. R.; and Paterson, K. G. IACR Cryptol. ePrint Arch., 2010: 637. 2010.
Breaking An Identity-Based Encryption Scheme based on DHIES [link]Paper   bibtex  
  2009 (4)
Attacking cryptographic schemes based on "perturbation polynomials". Albrecht, M. R.; Gentry, C.; Halevi, S.; and Katz, J. In Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009, Chicago, Illinois, USA, November 9-13, 2009, pages 1–10, 2009.
Attacking cryptographic schemes based on "perturbation polynomials" [link]Paper   doi   bibtex  
Algebraic Techniques in Differential Cryptanalysis. Albrecht, M. R.; and Cid, C. In Fast Software Encryption, 16th International Workshop, FSE 2009, Leuven, Belgium, February 22-25, 2009, Revised Selected Papers, pages 193–208, 2009.
Algebraic Techniques in Differential Cryptanalysis [link]Paper   doi   bibtex  
Plaintext Recovery Attacks against SSH. Albrecht, M. R.; Paterson, K. G.; and Watson, G. J. In 30th IEEE Symposium on Security and Privacy (S&P 2009), 17-20 May 2009, Oakland, California, USA, pages 16–26, 2009.
Plaintext Recovery Attacks against SSH [link]Paper   doi   bibtex  
Attacking Cryptographic Schemes Based on "Perturbation Polynomials". Albrecht, M. R.; Gentry, C.; Halevi, S.; and Katz, J. IACR Cryptol. ePrint Arch., 2009: 98. 2009.
Attacking Cryptographic Schemes Based on "Perturbation Polynomials" [link]Paper   bibtex  
  2008 (3)
Algebraic Attacks on the Courtois Toy Cipher. Albrecht, M. R. Cryptologia, 32(3): 220–276. 2008.
Algebraic Attacks on the Courtois Toy Cipher [link]Paper   doi   bibtex  
Efficient Multiplication of Dense Matrices over GF(2). Albrecht, M. R.; Bard, G. V.; and Hart, W. CoRR, abs/0811.1714. 2008.
Efficient Multiplication of Dense Matrices over GF(2) [link]Paper   bibtex  
Algebraic Techniques in Differential Cryptanalysis. Albrecht, M. R.; and Cid, C. IACR Cryptol. ePrint Arch., 2008: 177. 2008.
Algebraic Techniques in Differential Cryptanalysis [link]Paper   bibtex  
  2005 (1)
AIMEE: A Four-Legged Robot for RoboCup Rescue. Albrecht, M. R.; Backhaus, T.; Planthaber, S.; Stöpler, H.; Spenneberg, D.; and Kirchner, F. In Climbing and Walking Robots - Proceedings of the 8th International Conference on Climbing and Walking Robots and the Support Technologies for Mobile Machines, CLAWAR 2005, London, UK, September 13-15, 2005, pages 1003–1010, 2005.
AIMEE: A Four-Legged Robot for RoboCup Rescue [link]Paper   doi   bibtex