Montgomery curves and their arithmetic: The case of large characteristic fields
C Costello, B Smith - Journal of Cryptographic Engineering, 2018 - Springer
Three decades ago, Montgomery introduced a new elliptic curve model for use in Lenstra's
ECM factorization algorithm. Since then, his curves and the algorithms associated with them …
ECM factorization algorithm. Since then, his curves and the algorithms associated with them …
Security and privacy for the industrial internet of things: An overview of approaches to safeguarding endpoints
Endpoint devices form a core part of the architecture of the Industrial Internet of Things (IIoT).
Aspects of endpoint device security also extend to related technology paradigms, such as …
Aspects of endpoint device security also extend to related technology paradigms, such as …
Lightweight cryptography: a solution to secure IoT
Abstract In Internet of Things (IoT), the massive connectivity of devices and enormous data
on the air have made information susceptible to different type of attacks. Cryptographic …
on the air have made information susceptible to different type of attacks. Cryptographic …
[PDF][PDF] Zcash protocol specification
D Hopwood, S Bowe, T Hornby, N Wilcox - GitHub: San Francisco, CA …, 2016 - zeccoin.net
Zcash is an implementation of the Decentralized Anonymous Payment scheme Zerocash,
with security fixes and improvements to performance and functionality. It bridges the existing …
with security fixes and improvements to performance and functionality. It bridges the existing …
SNARKs for C: Verifying program executions succinctly and in zero knowledge
An argument system for NP is a proof system that allows efficient verification of NP
statements, given proofs produced by an untrusted yet computationally-bounded prover …
statements, given proofs produced by an untrusted yet computationally-bounded prover …
High-speed high-security signatures
This paper shows that a $390 mass-market quad-core 2.4 GHz Intel Westmere (Xeon
E5620) CPU can create 109000 signatures per second and verify 71000 signatures per …
E5620) CPU can create 109000 signatures per second and verify 71000 signatures per …
Quantum resource estimates for computing elliptic curve discrete logarithms
We give precise quantum resource estimates for Shor's algorithm to compute discrete
logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of …
logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of …
[图书][B] Handbook of finite fields
GL Mullen, D Panario - 2013 - api.taylorfrancis.com
The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …
book for the theory and applications of finite fields. It is not intended to be an introductory …
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the
conjectured difficulty of finding isogenies between supersingular elliptic curves. The main …
conjectured difficulty of finding isogenies between supersingular elliptic curves. The main …
The simplest protocol for oblivious transfer
Oblivious Transfer (OT) is the fundamental building block of cryptographic protocols. In this
paper we describe the simplest and most efficient protocol for 1-out-of-n OT to date, which is …
paper we describe the simplest and most efficient protocol for 1-out-of-n OT to date, which is …