Quantum-assisted QD-CFS signatures
Authors:
- Rafael Trapani PossignoloRPRafael Trapani Possignolo
- Cintia Borges MargiCMCintia Borges Margi
- Paulo S.L.M. BarretoPBPaulo S.L.M. Barreto
- 1 March 2015
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 81 (2) , 458-467
Abstract
No abstract availableFunding Information
- CNPq (482342/2011-0)
- Cisco Research (2011-050)
- CNPq (306935/2012-0)
This publication has 6 references indexed in Scilit:
- The non-gap sequence of a subcode of a generalized Reed–Solomon codeDesigns, Codes and Cryptography, 2012
- Quantum computersNature, 2010
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- A fast algorithm for computing multiplicative inverses in GF(2m) using normal basesInformation and Computation, 1988
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- The algebraic decoding of Goppa codesIEEE Transactions on Information Theory, 1975