Fetching the paper…
Reading the bibliography…
Currently deployed public-key cryptosystems will be vulnerable to attacks by full-scale quantum computers.
Goncharov, S. V. (2019) · 1901
Earlier work this paper cites.
Analysing mathematical reasoning abilities of neural models
Saxton, D., Grefenstette, E., Hill, F., and Kohli, P. (2019) · 1904
Earlier work this paper cites.
Deep learning for symbolic mathematics
Lample, G. and Charton, F. (2019) · 1912
Earlier work this paper cites.
New directions in cryptography
Diffie, W. and Hellman, M. (1976) · 1976
Earlier work this paper cites.
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., and Adleman, L. (1978) · 1978
Earlier work this paper cites.
Factoring polynomials with rational coefficients
Lenstra, H. j., Lenstra, A., and Lovász, L. (1982) · 1982
Earlier work this paper cites.
Use of elliptic curves in cryptography
Miller, V. S. (1985) · 1985
Earlier work this paper cites.
Minkowski’s convex body theorem and integer programming
Kannan, R. (1987) · 1987
Earlier work this paper cites.
Cryptography and machine learning
Rivest, R. L. (1991) · 1991
Earlier work this paper cites.
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (1994) · 1994
Earlier work this paper cites.
Generating hard instances of lattice problems
Ajtai, M. (1996) · 1996
Earlier work this paper cites.
Long short-term memory
Hochreiter, S. and Schmidhuber, J. (1997) · 1997
Earlier work this paper cites.
Pharaoh: a beam search decoder for phrase-based statistical machine translation models
Koehn, P. (2004) · 2004
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · 2005
Earlier work this paper cites.
Learning advanced mathematical computations from examples
Charton, F., Hayat, A., and Lample, G. (2020) · 2006
Earlier work this paper cites.
Deep encoder, shallow decoder: Reevaluating the speed-quality tradeoff in machine translation
Kasai, J., Pappas, N., Peng, H., Cross, J., and Smith, N. A. (2020) · 2006
Earlier work this paper cites.
On bounded distance decoding, unique shortest vectors, and the minimum distance problem
Lyubashevsky, V. and Micciancio, D. (2009) · 2009
Earlier work this paper cites.
Lattice-based cryptography
Micciancio, D. and Regev, O. (2009) · 2009
Earlier work this paper cites.
Public-key cryptosystems from the worst-case shortest vector problem: Extended abstract
Peikert, C. (2009) · 2009
Earlier work this paper cites.
Generative language modeling for automated theorem proving
Polu, S. and Sutskever, I. (2020) · 2009
Earlier work this paper cites.
Faster exponential time algorithms for the shortest vector problem
Micciancio, D. and Voulgaris, P. (2010) · 2010
Earlier work this paper cites.
Bkz 2.0: Better lattice security estimates
Chen, Y. and Nguyen, P. Q. (2011) · 2011
Earlier work this paper cites.
Better key sizes (and attacks) for lwe-based encryption
Lindner, R. and Peikert, C. (2011) · 2011
Earlier work this paper cites.
Neuro-cryptanalysis of des and triple-des
Alani, M. M. (2012) · 2012
Cited alongside, same era.
Can sequence-to-sequence models crack substitution ciphers?
Aldarrab, N. and May, J. (2020) · 2012
Cited alongside, same era.
Classical hardness of learning with errors
Brakerski, Z., Langlois, A., Peikert, C., Regev, O., and Stehlé, D. (2013) · 2013
Cited alongside, same era.
Solving bdd by enumeration: An update
Liu, M. and Nguyen, P. Q. (2013) · 2013
Cited alongside, same era.
Lazy modulus switching for the bkw algorithm on lwe
Albrecht, M. R., Faugère, J.-C., Fitzpatrick, R., and Perret, L. (2014) · 2014
Cited alongside, same era.
Lattice decoding attacks on binary lwe
Bai, S. and Galbraith, S. D. (2014) · 2014
Cited alongside, same era.
On the feasibility and impact of standardising sparse-secret LWE parameter sets for homomorphic encryption
Curtis, B. R. and Player, R. (2019) · 2019
Later among the works it cites.
Improving attacks on round-reduced speck32/64 using deep learning
Gohr, A. (2019) · 2019
Later among the works it cites.
Recent advances of neural attacks against block ciphers
Baek, S. and Kim, K. (2020) · 2020
Later among the works it cites.
On the concrete security of lwe with small secret
Chen, H., Chua, L., Lauter, K., and Song, Y. (2020) · 2020
Later among the works it cites.
Deep learning-based cryptanalysis of lightweight block ciphers
So, J. (2020) · 2020
Later among the works it cites.
A novel dynamic attack on classical ciphers using an attention-based lstm encoder-decoder model
Ahmadzadeh, E., Kim, H., Jeong, O., and Moon, I. (2021) · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Weak instances of plwe
Eisenträger, K., Hallgren, S., and Lauter, K. (2014) · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Kingma, D. P. and Ba, J. (2014) · 2014
Cited alongside, same era.
Sequence to sequence learning with neural networks
Sutskever, I., Vinyals, O., and Le, Q. V. (2014) · 2014
Cited alongside, same era.
On the complexity of the bkw algorithm on lwe
Albrecht, M., Cid, C., Faugère, J.-C., Fitzpatrick, R., and Perret, L. (2015) · 2015
Cited alongside, same era.
Provably weak instances of ring-lwe
Elias, Y., Lauter, K. E., Ozman, E., and Stange, K. E. (2015) · 2015
Cited alongside, same era.
Kaiser, Ł. and Sutskever, I. (2015) · 2015
Cited alongside, same era.
Later among the works it cites.
Homomorphic encryption standard
Albrecht, M., Chase, M., Chen, H., Ding, J., Goldwasser, S., Gorbunov, S., Halevi, S., Hoffstein, J., Laine, K., Lauter, K., Lokam, S., Micciancio, D., Moody, D., Morrison, T., Sahai, A., and Vaikuntanathan, V. (2021) · 2021
Later among the works it cites.
Crystals-kyber (version 3.02) – submission to round 3 of the nist post-quantum project
Avanzi, R., Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., and Stehlé, D. . (2021) · 2021
Later among the works it cites.
A deeper look at machine learning-based cryptanalysis
Benamira, A., Gerault, D., Peyrin, T., and Tan, Q. Q. (2021) · 2021
Later among the works it cites.
Neural symbolic regression that scales
Biggio, L., Bendinelli, T., Neitz, A., Lucchi, A., and Parascandolo, G. (2021) · 2021
Later among the works it cites.
Linear algebra with transformers
Charton, F. (2021) · 2021
Later among the works it cites.
A deep language model to predict metabolic network equilibria
Charton, F., Hayat, A., McQuade, S. T., Merrill, N. J., and Piccoli, B. (2021) · 2021
Later among the works it cites.
Bridging machine learning and cryptanalysis via edlct
Chen, Y. and Yu, H. (2021) · 2021
Later among the works it cites.
The neural data router: Adaptive control flow in transformers improves systematic generalization
Csordás, R., Irie, K., and Schmidhuber, J. (2021) · 2021
Later among the works it cites.
Crystals-dilithium – algorithm specifications and supporting documentation (version 3.1)
Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., and Stehlé, D. (2021) · 2021
Later among the works it cites.
Solving arithmetic word problems with transformers and preprocessing of problem text
Griffith, K. and Kalita, J. (2021) · 2021
Later among the works it cites.
Output prediction attacks on spn block ciphers using deep learning
Kimura, H., Emura, K., Isobe, T., Ito, R., Ogawa, K., and Ohigashi, T. (2021) · 2021
Later among the works it cites.
Investigating the limitations of transformers with simple arithmetic tasks
Nogueira, R., Jiang, Z., and Lin, J. (2021) · 2021
Later among the works it cites.
Transformer-based machine learning for fast sat solvers and logic synthesis
Shi, F., Lee, C., Bashar, M. K., Shukla, N., Zhu, S.-C., and Narayanan, V. (2021) · 2021
Later among the works it cites.
Symbolic brittleness in sequence models: on systematic generalization in symbolic mathematics
Welleck, S., West, P., Cao, J., and Choi, Y. (2021) · 2021
Later among the works it cites.
Deep symbolic regression for recurrent sequences
d’Ascoli, S., Kamienny, P.-A., Lample, G., and Charton, F. (2022) · 2022
Closest in time.
Grokking: Generalization beyond overfitting on small algorithmic datasets
Power, A., Burda, Y., Edwards, H., Babuschkin, I., and Misra, V. (2022) · 2022
Closest in time.