Skip to Main Content Area
CPS-VO
Contact Support
Browse
Calendar
Announcements
Repositories
Groups
Search
Search for Content
Search for a Group
Search for People
Search for a Project
Tagcloud
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
Montgomery ladder
biblio
A comparison of Differential Addition and Doubling in Binary Edwards Curves for Elliptic Curve Cryptography
Submitted by grigby1 on Thu, 05/05/2022 - 1:18pm
Market research
Software
security
Scalability
SageMath
Resiliency
resilience
pubcrawl
Protocols
Montgomery ladder
Metrics
benchmark
Indexes
Index Terms
Elliptic curves
Elliptic curve cryptography
elliptic curve
Differential Addition and Doubling
Cryptography
composability
Binary Edwards Curves
biblio
A Hole in the Ladder : Interleaved Variables in Iterative Conditional Branching
Submitted by aekwall on Mon, 03/22/2021 - 12:14pm
exponentiation
semiinterleaved ladders
RSA cryptographic protocol
iterative conditional branching
interleaved variables
fully-interleaved ladders
fully-interleaved ladder properties
fully-interleaved cases
Countermeasures (computer)
Iterative algorithms
Montgomery ladder
interleaved codes
fault detection
Scalability
public-key cryptography
modular exponentiation
side-channel attacks
Registers
Space exploration
public key cryptography
Mathematical model
pubcrawl
Resiliency
Cryptographic Protocols
security
Cryptography
biblio
Breaking a fully Balanced ASIC Coprocessor Implementing Complete Addition Formulas on Weierstrass Elliptic Curves
Submitted by aekwall on Mon, 02/15/2021 - 3:56pm
Elliptic curve cryptography (ECC)
Weierstrass elliptic curves
side channel analysis (SCA) attacks
random order execution
point doubling operations
point addition
open-source designs
Montgomery ladder
horizontal SCA attacks
horizontal DPA attacks
hardware accelerators
fully balanced ASIC coprocessor
complete addition formulas
Scalability
application specific integrated circuits
coprocessors
Clocks
logic design
Registers
Elliptic curves
Elliptic curve cryptography
public key cryptography
Metrics
pubcrawl
Resiliency
biblio
An Efficient Fault Detection Method for Elliptic Curve Scalar Multiplication Montgomery Algorithm
Submitted by grigby1 on Fri, 06/26/2020 - 11:54am
Fault detection method
smaller keys
Scalability
Resiliency
resilience
public key cryptosystems
public key cryptography
pubcrawl
power consumption
Montgomery Scalar Multiplication algorithm
Montgomery ladder
Metrics
key sizes
Hardware
fault injection attack
fault diagnosis
Circuit faults
fault detection
Fault Attacks
embedded devices
Elliptical Curve Cryptography
Elliptic curves
elliptic curve Scalar Multiplication Montgomery algorithm
Elliptic curve cryptography (ECC)
Elliptic curve cryptography
efficient fault detection method
efficient countermeasure
ECC
cryptographic computation
Conferences
classical asymmetric cryptosystems
