Elliptic curve and Lattice cryptosystem
| Title | Elliptic curve and Lattice cryptosystem |
| Publication Type | Conference Paper |
| Year of Publication | 2019 |
| Authors | Elhassani, M., Chillali, A., Mouhib, A. |
| Conference Name | 2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS) |
| Date Published | Dec. 2019 |
| Publisher | IEEE |
| ISBN Number | 978-1-7281-4813-7 |
| Keywords | closest vector problem, conjugate problem, cryptography method, Diffie-Hellman, digital signatures, discrete logarithm, elliptic curve, Elliptic curve cryptography, Elliptic curve over a ring, Elliptic curves, Encryption, finite local ring, homomorphic encryption, lattice, lattice cryptosystem, lattice-based cryptography, Lattices, matrix algebra, Metrics, pubcrawl, public key cryptography, resilience, Resiliency, Scalability, square matrices, Vectors |
| Abstract | In this work, we will present a new hybrid cryptography method based on two hard problems: 1- The problem of the discrete logarithm on an elliptic curve defined on a finite local ring. 2- The closest vector problem in lattice and the conjugate problem on square matrices. At first, we will make the exchange of keys to the Diffie-Hellman. The encryption of a message is done with a bad basis of a lattice. |
| URL | https://ieeexplore.ieee.org/document/9068885 |
| DOI | 10.1109/ISACS48493.2019.9068885 |
| Citation Key | elhassani_elliptic_2019 |
- lattice
- Vectors
- square matrices
- Scalability
- Resiliency
- resilience
- public key cryptography
- pubcrawl
- Metrics
- matrix algebra
- Lattices
- lattice-based cryptography
- lattice cryptosystem
- closest vector problem
- Homomorphic encryption
- finite local ring
- encryption
- Elliptic curves
- Elliptic curve over a ring
- Elliptic curve cryptography
- elliptic curve
- discrete logarithm
- digital signatures
- Diffie-Hellman
- cryptography method
- conjugate problem