Lacombe, Frédéric (2001). Finite-size effects in low-density parity-check codes applied to cryptography. Masters thesis, Aston University.
Abstract
Low density parity check error-correcting codes can be applied as an efficient public key cryptosystem. The scheme, based on the computational difficulty in factorising dense matrices, has been studied so far in the limit of infinite system size. In this work we study numerically the finite-size effects in such a system, such that may have a significant impact on the reliability of the cryptosystem, and we derive the corresponding practical limitations in using these algorithms. We also describe the difficulties we encountered in using a similar approach to devise an electronic signature cryptosystem.
| Publication DOI: | https://doi.org/10.48780/publications.aston.ac.uk.00021477 |
|---|---|
| Divisions: | College of Engineering & Physical Sciences |
| Additional Information: | Copyright © Frédéric Lacombe, 2001. Frédéric Lacombe asserts their moral right to be identified as the author of this thesis. This copy of the thesis has been supplied on condition that anyone who consults it is understood to recognise that its copyright rests with its author and that no quotation from the thesis and no information derived from it may be published without appropriate permission or acknowledgement. If you have discovered material in Aston Publications Explorer which is unlawful e.g. breaches copyright, (either yours or that of a third party) or any other law, including but not limited to those relating to patent, trademark, confidentiality, data protection, obscenity, defamation, libel, then please read our Takedown Policy and contact the service immediately. |
| Institution: | Aston University |
| Last Modified: | 03 Feb 2025 10:50 |
| Date Deposited: | 19 Mar 2014 11:50 |
| Completed Date: | 2001-09 |
| Authors: |
Lacombe, Frédéric
|
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)