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 …

Fortified-chain: a blockchain-based framework for security and privacy-assured internet of medical things with effective access control

BS Egala, AK Pradhan, V Badarla… - IEEE Internet of Things …, 2021 - ieeexplore.ieee.org
The rapid developments in the Internet of Medical Things (IoMT) help the smart healthcare
systems to deliver more sophisticated real-time services. At the same time, IoMT also raises …

SNARKs for C: Verifying program executions succinctly and in zero knowledge

E Ben-Sasson, A Chiesa, D Genkin, E Tromer… - Annual cryptology …, 2013 - Springer
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 …

High-speed high-security signatures

DJ Bernstein, N Duif, T Lange, P Schwabe… - Journal of cryptographic …, 2012 - Springer
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 …

[SÁCH][B] The arithmetic of elliptic curves

JH Silverman - 2009 - Springer
The theory of elliptic curves is distinguished by its long history and by the diversity of the
methods that have been used in its study. This book treats the arithmetic theory of elliptic …

[SÁCH][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 …

[SÁCH][B] Elliptic curves: number theory and cryptography

LC Washington - 2008 - taylorfrancis.com
Like its bestselling predecessor, Elliptic Curves: Number Theory and Cryptography, Second
Edition develops the theory of elliptic curves to provide a basis for both number theoretic and …

[SÁCH][B] Introduction to cryptography

H Delfs, H Knebl, H Knebl - 2002 - Springer
VI Preface methods from information theory. Unconditionally secure schemes are now
addressed in an extra chapter, Chapter 10.• Unconditional security is not achievable without …

Twisted edwards curves

DJ Bernstein, P Birkner, M Joye, T Lange… - Progress in Cryptology …, 2008 - Springer
This paper introduces “twisted Edwards curves,” a generalization of the recently introduced
Edwards curves; shows that twisted Edwards curves include more curves over finite fields …

Montgomery curves and the Montgomery ladder

DJ Bernstein, T Lange - 2017 - research.tue.nl
The Montgomery ladder is a remarkably simple method of computing scalar multiples of
points on a broad class of elliptic curves. This article surveys a wide range of topics related …