[HTML][HTML] A review of security concerns in Internet of Things

E Leloglu - Journal of Computer and Communications, 2017 - scirp.org
The Internet of Things (IoT) represents a technologically optimistic future where objects will
be connected to the internet and make intelligent collaborations with other objects …

CSIDH: an efficient post-quantum commutative group action

W Castryck, T Lange, C Martindale, L Panny… - Advances in Cryptology …, 2018 - Springer
We propose an efficient commutative group action suitable for non-interactive key exchange
in a post-quantum setting. Our construction follows the layout of the Couveignes–Rostovtsev …

Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

D Jao, L De Feo - … : 4th International Workshop, PQCrypto 2011, Taipei …, 2011 - Springer
We present new candidates for quantum-resistant public-key cryptosystems based on the
conjectured difficulty of finding isogenies between supersingular elliptic curves. The main …

Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

L De Feo, D Jao, J Plût - Journal of Mathematical Cryptology, 2014 - degruyter.com
We present new candidates for quantum-resistant public-key cryptosystems based on the
conjectured difficulty of finding isogenies between supersingular elliptic curves. The main …

Constructing elliptic curve isogenies in quantum subexponential time

A Childs, D Jao, V Soukharev - Journal of Mathematical Cryptology, 2014 - degruyter.com
Given two ordinary elliptic curves over a finite field having the same cardinality and
endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but …

Short Stickelberger class relations and application to Ideal-SVP

R Cramer, L Ducas, B Wesolowski - … on the Theory and Applications of …, 2017 - Springer
The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-
SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of …

Mathematics of isogeny based cryptography

L De Feo - arxiv preprint arxiv:1711.04062, 2017 - arxiv.org
These lectures notes were written for a summer school on Mathematics for post-quantum
cryptography in Thi\es, Senegal. They try to provide a guide for Masters' students to get …

Computing isogenies between supersingular elliptic curves over

C Delfs, SD Galbraith - Designs, Codes and Cryptography, 2016 - Springer
Abstract Let p> 3 p> 3 be a prime and let EE, E'E′ be supersingular elliptic curves over F _p
F p. We want to construct an isogeny ϕ: E → E'ϕ: E→ E′. The currently fastest algorithm for …

Towards practical key exchange from ordinary isogeny graphs

L De Feo, J Kieffer, B Smith - … 2018: 24th International Conference on the …, 2018 - Springer
We revisit the ordinary isogeny-graph based cryptosystems of Couveignes and Rostovtsev–
Stolbunov, long dismissed as impractical. We give algorithmic improvements that accelerate …

Security, cybercrime and digital forensics for IoT

HF Atlam, A Alenezi, MO Alassafi, AA Alshdadi… - Principles of internet of …, 2020 - Springer
Abstract The Internet of Things (IoT) connects almost all the environment objects whether
physical or virtual over the Internet to produce new digitized services that improve people's …