On the public citation graph
An improved algorithm for arithmetic on a family of elliptic curves
0 signed · 148 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.1997.0913openalex-snapshot
A Survey of Fast Exponentiation Methods
inferredcites →https://doi.org/10.1007/3-540-44750-4_4openalex-snapshot
Fast Key Exchange with Elliptic Curve Systems
inferredcites →https://doi.org/10.1007/3-540-46766-1_22openalex-snapshot
CM-Curves with Good Cryptographic Properties
inferredcites →https://doi.org/10.1007/3-540-48071-4_24openalex-snapshot
Efficient Multiplication on Certain Nonsupersingular Elliptic Curves
inferredcites →https://doi.org/10.1007/3-540-48071-4_25openalex-snapshot
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
inferredcites →https://doi.org/10.1016/0166-218x(89)90001-2openalex-snapshot
Low complexity normal bases
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1051/ita/1990240605311openalex-snapshot
Speeding up the computations on an elliptic curve using addition-subtraction chains
inferredcites →https://doi.org/10.1145/103418.103434openalex-snapshot
Reducing elliptic curve logarithms to logarithms in a finite field
inferredcites →https://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.1047openalex-snapshot
Elliptic‐curve scalar multiplication algorithm using ZOT structure
inferred← citeshttps://doi.org/10.1007/10718964_6openalex-snapshot
Efficient Scalar Multiplications on Elliptic Curves without Repeated Doublings and Their Practical Performance
inferred← citeshttps://doi.org/10.1007/10719994_8openalex-snapshot
Over F p vs. over F $_{2^{n}}$ and on Pentium vs. on Alpha in Software Implementation of Hyperelliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/10719994_9openalex-snapshot
Speeding Up Elliptic Scalar Multiplication with Precomputation
inferred← citeshttps://doi.org/10.1007/11496618_11openalex-snapshot
Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
inferred← citeshttps://doi.org/10.1007/11545262_7openalex-snapshot
Short Memory Scalar Multiplication on Koblitz Curves
inferred← citeshttps://doi.org/10.1007/11554868_12openalex-snapshot
An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm
inferred← citeshttps://doi.org/10.1007/11586821_17openalex-snapshot
Efficient Countermeasures for Thwarting the SCA Attacks on the Frobenius Based Methods
inferred← citeshttps://doi.org/10.1007/11599371_19openalex-snapshot
A Note on Signed Binary Window Algorithm for Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/11604938_21openalex-snapshot
A DPA Countermeasure by Randomized Frobenius Decomposition
inferred← citeshttps://doi.org/10.1007/11693383_23openalex-snapshot
Minimality of the Hamming Weight of the τ-NAF for Koblitz Curves and Improved Combination with Point Halving
inferred← citeshttps://doi.org/10.1007/11693383_24openalex-snapshot
SPA Resistant Left-to-Right Integer Recodings
inferred← citeshttps://doi.org/10.1007/11767480_28openalex-snapshot
A General Methodology for Pipelining the Point Multiplication Operation in Curve Based Cryptography
inferred← citeshttps://doi.org/10.1007/11935230_9openalex-snapshot
Extending Scalar Multiplication Using Double Bases
inferred← citeshttps://doi.org/10.1007/11958239_9openalex-snapshot
Scalar Multiplication on Koblitz Curves Using Double Bases
inferred← citeshttps://doi.org/10.1007/3-540-36400-5_39openalex-snapshot
Preventing Differential Analysis in GLV Elliptic Curve Scalar Multiplication
inferred← citeshttps://doi.org/10.1007/3-540-36492-7_2openalex-snapshot
Integer Decomposition for Fast Scalar Multiplication on Elliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-36492-7_3openalex-snapshot
Analysis of the Gallant-Lambert-Vanstone Method Based on Efficient Endomorphisms: Elliptic and Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-36552-4_19openalex-snapshot
New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms
inferred← citeshttps://doi.org/10.1007/3-540-36552-4_21openalex-snapshot
Improved Techniques for Fast Exponentiation
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_24openalex-snapshot
Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms
inferred← citeshttps://doi.org/10.1007/3-540-44499-8_7openalex-snapshot
Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_26openalex-snapshot
Compact Encoding of Non-adjacent Forms with Applications to Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_11openalex-snapshot
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
inferred← citeshttps://doi.org/10.1007/3-540-44709-1_31openalex-snapshot
Protections against Differential Analysis for Elliptic Curve Cryptography — An Algebraic Approach —
inferred← citeshttps://doi.org/10.1007/3-540-44983-3_8openalex-snapshot
Speeding up the Arithmetic on Koblitz Curves of Genus Two
inferred← citeshttps://doi.org/10.1007/3-540-45311-3_11openalex-snapshot
A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_11openalex-snapshot
An Improved Implementation of Elliptic Curves over GF(2 n) when Using Projective Point Arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_12openalex-snapshot
Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_13openalex-snapshot
Algorithms for Multi-exponentiation
inferred← citeshttps://doi.org/10.1007/3-540-45600-7_8openalex-snapshot
A Cyclic Window Algorithm for ECC Defined over Extension Fields
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_23openalex-snapshot
An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_13openalex-snapshot
Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms
inferred← citeshttps://doi.org/10.1007/3-540-48059-5_22openalex-snapshot
Elliptic Curve Scalar Multiplier Design Using FPGAs
inferred← citeshttps://doi.org/10.1007/3-540-48059-5_27openalex-snapshot
Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation
inferred← citeshttps://doi.org/10.1007/3-540-48892-8_15openalex-snapshot
Faster Attacks on Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-48892-8_16openalex-snapshot
Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_12openalex-snapshot
On the Performance of Hyperelliptic Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_13openalex-snapshot
Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_26openalex-snapshot
An Analysis of Exponentiation Based on Formal Languages
inferred← citeshttps://doi.org/10.1007/3-540-49649-1_10openalex-snapshot
Elliptic Curve Discrete Logarithms and the Index Calculus
inferred← citeshttps://doi.org/10.1007/3-540-49649-1_6openalex-snapshot
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
inferred← citeshttps://doi.org/10.1007/978-0-387-33112-6_1openalex-snapshot
High Performance Elliptic Curve Cryptographic Co-processor
inferred← citeshttps://doi.org/10.1007/978-3-319-12060-7_16openalex-snapshot
Randomized Batch Verification of Standard ECDSA Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-31515-7_4openalex-snapshot
Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-24632-9_3openalex-snapshot
Faster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius Endomorphism
inferred← citeshttps://doi.org/10.1007/978-3-540-24654-1_22openalex-snapshot
Alternative Digit Sets for Nonadjacent Representations
inferred← citeshttps://doi.org/10.1007/978-3-540-24654-1_23openalex-snapshot
Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_10openalex-snapshot
A General Expansion Method Using Efficient Endomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_13openalex-snapshot
Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion
inferred← citeshttps://doi.org/10.1007/978-3-540-24852-1_34openalex-snapshot
An Improved Algorithm for uP+vQ Using JSF $_{3}^{1}$
inferred← citeshttps://doi.org/10.1007/978-3-540-24852-1_35openalex-snapshot
New Table Look-Up Methods for Faster Frobenius Map Based Scalar Multiplication Over GF(p n )
inferred← citeshttps://doi.org/10.1007/978-3-540-28632-5_11openalex-snapshot
Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations
inferred← citeshttps://doi.org/10.1007/978-3-540-30556-9_21openalex-snapshot
Advances in Alternative Non-adjacent Form Representations
inferred← citeshttps://doi.org/10.1007/978-3-540-30564-4_9openalex-snapshot
A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue
inferred← citeshttps://doi.org/10.1007/978-3-540-39927-8_32openalex-snapshot
(Virtually) Free Randomization Techniques for Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_27openalex-snapshot
Fast Implementation of Elliptic Curve Arithmetic in GF(p n )
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_29openalex-snapshot
Fast Batch Verification of Multiple Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_17openalex-snapshot
New Left-to-Right Radix-r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-74462-7_15openalex-snapshot
Delaying and Merging Operations in Scalar Multiplication: Applications to Curve-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-74462-7_20openalex-snapshot
On Redundant τ-Adic Expansions and Non-adjacent Digit Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-77360-3_9openalex-snapshot
Koblitz Curves and Integer Equivalents of Frobenius Expansions
inferred← citeshttps://doi.org/10.1007/978-3-540-88353-1_2openalex-snapshot
The GPS Identification Scheme Using Frobenius Expansions
inferred← citeshttps://doi.org/10.1007/978-3-642-55220-5_11openalex-snapshot
Faster Compact Diffie–Hellman: Endomorphisms on the x-line
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_6openalex-snapshot
Efficient Algorithms for the Jacobian Variety of Hyperelliptic Curves y2=xp-x+1 Over a Finite Field of Odd Characteristic p
inferred← citeshttps://doi.org/10.1007/978-3-662-53140-2_13openalex-snapshot
Software Implementation of Koblitz Curves over Quadratic Fields
inferred← citeshttps://doi.org/10.1007/bf02687937openalex-snapshot
Two fast algorithms for computing point scalar multiplications on elliptic curves
inferred← citeshttps://doi.org/10.1007/bfb0054025openalex-snapshot
Two efficient algorithms for arithmetic of elliptic curves using Frobenius map
inferred← citeshttps://doi.org/10.1007/bfb0054867openalex-snapshot
On the performance of signature schemes based on elliptic curves
inferred← citeshttps://doi.org/10.1007/bfb0055739openalex-snapshot
An elliptic curve implementation of the finite field digital signature algorithm
inferred← citeshttps://doi.org/10.1007/pl00003820openalex-snapshot
Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic
inferred← citeshttps://doi.org/10.1007/s00145-004-0229-5openalex-snapshot
The Complexity of Certain Multi-Exponentiation Techniques in Cryptography
inferred← citeshttps://doi.org/10.1007/s00145-018-9294-zopenalex-snapshot
Koblitz Curves over Quadratic Fields
inferred← citeshttps://doi.org/10.1007/s10470-015-0599-7openalex-snapshot
High-performance elliptic curve cryptoprocessors over $$\varvec{GF(2^{m})}$$ G F ( 2 m ) on Koblitz curves
inferred← citeshttps://doi.org/10.1007/s10474-013-0303-2openalex-snapshot
Existence and optimality of w-non-adjacent forms with an algebraic integer base
inferred← citeshttps://doi.org/10.1007/s10474-016-0596-zopenalex-snapshot
Non-commutative digit expansions for arithmetic on supersingular elliptic curves
inferred← citeshttps://doi.org/10.1007/s11128-014-0851-6openalex-snapshot
Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
inferred← citeshttps://doi.org/10.1007/s11786-009-0014-9openalex-snapshot
Redundant τ-Adic Expansions II: Non-Optimality and Chaotic Behaviour
inferred← citeshttps://doi.org/10.1016/j.ffa.2004.07.001openalex-snapshot
Koblitz curve cryptosystems
inferred← citeshttps://doi.org/10.1016/j.jnt.2012.08.029openalex-snapshot
Analysis of width- w non-adjacent forms to imaginary quadratic bases
inferred← citeshttps://doi.org/10.1023/a:1008354106356openalex-snapshot
The State of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1023/a:1011212615791openalex-snapshot
On String Replacement Exponentiation
inferred← citeshttps://doi.org/10.1023/b:wire.0000047066.74117.86openalex-snapshot
Efficient Implementation of Elliptic Curve Cryptography (ECC) for Personal Digital Assistants (PDAs)
inferred← citeshttps://doi.org/10.1049/iet-ifs:20060033openalex-snapshot
Improved base- ɸ expansion method for Koblitz curves over optimal extension fields
inferred← citeshttps://doi.org/10.1063/1.4972146openalex-snapshot
A total norm of τ-adic non-adjacent form occurring among all element of ℤ(τ): An alternative formula
inferred← citeshttps://doi.org/10.1063/1.5041533openalex-snapshot
Alternative formula of Tm in scalar multiplication on Koblitz curve
inferred← citeshttps://doi.org/10.1063/1.5121054openalex-snapshot
On some specific patterns of τ-adic non-adjacent form expansion over ring Z(τ): An alternative formula
inferred← citeshttps://doi.org/10.1080/01611194.2025.2449711openalex-snapshot
On computing the double point multiplication in elliptic curve cryptography
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-01119-9openalex-snapshot
Improving the parallelized Pollard lambda search on anomalous binary curves
inferred← citeshttps://doi.org/10.1109/12.956092openalex-snapshot
Power analysis attacks and algorithmic approaches to their countermeasures for Koblitz curve cryptosystems
inferred← citeshttps://doi.org/10.1109/access.2018.2878777openalex-snapshot
Highly Efficient Implementation of NIST-Compliant Koblitz Curve for 8-bit AVR-Based Sensor Nodes
inferred← citeshttps://doi.org/10.1109/cmce.2010.5609834openalex-snapshot
An efficient elliptic curve scalar multiplication algorithm against side channel attacks
inferred← citeshttps://doi.org/10.1109/fpga.1999.803707openalex-snapshot
A compact fast variable key size elliptic curve cryptosystem coprocessor
inferred← citeshttps://doi.org/10.1109/fpga.2000.903394openalex-snapshot
FPGA implementation of a microcoded elliptic curve cryptographic processor
inferred← citeshttps://doi.org/10.1109/glocom.2006.286openalex-snapshot
NIS05-2: An Efficient Proactive Share Refreshing Scheme for Secret Sharing in Distributed Systems
inferred← citeshttps://doi.org/10.1109/iccias.2006.295268openalex-snapshot
New Countermeasures against Power Analysis Attacks for Koblitz Curve Crystosystems
inferred← citeshttps://doi.org/10.1109/icecs.2013.6815481openalex-snapshot
Low area ECC implementation on FPGA
inferred← citeshttps://doi.org/10.1109/ichit.2006.253503openalex-snapshot
Left-to-right Generalized Non-adjacent Form Recoding for Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1109/icsps.2010.5555269openalex-snapshot
Two efficient algorithms against power attacks for elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/ipdps.2005.104openalex-snapshot
An Improved Algorithm for uP + vQ on a Family of Elliptic Curves
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161204openalex-snapshot
A MicroBlaze specific co-processor for real-time hyperelliptic curve cryptography on Xilinx FPGAs
inferred← citeshttps://doi.org/10.1109/issoc.2010.5625557openalex-snapshot
A flexible integrated cryptoprocessor for authentication protocols based on hyperelliptic curve cryptography
inferred← citeshttps://doi.org/10.1109/itcc.2004.1286701openalex-snapshot
High performance FPGA based elliptic curve cryptographic co-processor
inferred← citeshttps://doi.org/10.1109/jproc.2005.862438openalex-snapshot
Elliptic Curve Cryptography Engineering
inferred← citeshttps://doi.org/10.1109/pacrim.2011.6032864openalex-snapshot
A flexible architecture for the multiplier in hybrid cryptosystems
inferred← citeshttps://doi.org/10.1109/sahcn.2004.1381904openalex-snapshot
A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography
inferred← citeshttps://doi.org/10.1109/saint.2010.112openalex-snapshot
Efficient Scalar Multiplication Algorithms Secure against Power Analysis Attacks for Koblitz Curve Cryptosystems
inferred← citeshttps://doi.org/10.1109/securecomm.2005.52openalex-snapshot
Soft-Timeout Distributed Key Generation for Digital Signature based on Elliptic Curve D-log for Low-Power Devices
inferred← citeshttps://doi.org/10.1109/smartiot52359.2021.00043openalex-snapshot
Exploiting Silicon Fingerprint for Device Authentication Using CMOS-PUF and ECC
inferred← citeshttps://doi.org/10.1109/soli.2013.6611377openalex-snapshot
Optimal implementation of elliptic curve cryptography
inferred← citeshttps://doi.org/10.1109/tc.2004.14openalex-snapshot
Minimal weight digit set conversions
inferred← citeshttps://doi.org/10.1109/tc.2006.207openalex-snapshot
Use of Sparse and/or Complex Exponents in Batch Verification of Exponentiations
inferred← citeshttps://doi.org/10.1109/tc.2007.70824openalex-snapshot
Short-Memory Scalar Multiplication for Koblitz Curves
inferred← citeshttps://doi.org/10.1109/tc.2009.132openalex-snapshot
Conversion Algorithms and Implementations for Koblitz Curve Cryptography
inferred← citeshttps://doi.org/10.1109/tdsc.2024.3387568openalex-snapshot
PUF-Based Authentication-Oriented Architecture for Identification Tags
inferred← citeshttps://doi.org/10.1109/tvlsi.2002.801608openalex-snapshot
A microcoded elliptic curve processor using FPGA technology
inferred← citeshttps://doi.org/10.1137/s0895480103437651openalex-snapshot
Alternative Digit Sets for Nonadjacent Representations
inferred← citeshttps://doi.org/10.11606/d.3.2019.tde-15042019-141848openalex-snapshot
z-NAF e clipping: two improvements for post-quantum hash-based digital signatures.
inferred← citeshttps://doi.org/10.1587/transfun.e98.a.863openalex-snapshot
A High Performance FPGA Implementation of 256-bit Elliptic Curve Cryptography Processor Over GF(p)
inferred← citeshttps://doi.org/10.17485/ijst/2016/v9i28/97358openalex-snapshot
Maximum and Minimum Norms for τ-NAF Expansion on Koblitz Curve
inferred← citeshttps://doi.org/10.2172/918256openalex-snapshot
Algorithms for improved performance in cryptographic protocols.
inferred← citeshttps://doi.org/10.22452/mjs.sp2022no1.2openalex-snapshot
ON SOME PATTERNS OF TNAF FOR SCALAR MULTIPLICATION OVER KOBLITZ CURVE
inferred← citeshttps://doi.org/10.22452/mjs.vol37no2.2openalex-snapshot
Even And Odd Nature For Pseudo Τ-Adic Non-Adjacent Form
inferred← citeshttps://doi.org/10.26421/qic13.7-8-5openalex-snapshot
Efficient quantum circuits for binary elliptic curve arithmetic: reducing $T$-gate complexity
inferred← citeshttps://doi.org/10.26421/qic14.9-10-11openalex-snapshot
A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2n)
inferred← citeshttps://doi.org/10.3217/8yzsz-1x027openalex-snapshot
Analysis of digital expansions to imaginary quadratic bases
inferred← citeshttps://doi.org/10.32657/10356/2445openalex-snapshot
Secure key establishment for low power devices using ECC
inferred← citeshttps://doi.org/10.36227/techrxiv.24168654openalex-snapshot
Error Detection Schemes for τ NAF Conversion within Koblitz Curves Benchmarked on Various ARM Processors
inferred← citeshttps://doi.org/10.36227/techrxiv.24168654.v1openalex-snapshot
Error Detection Schemes for τ NAF Conversion within Koblitz Curves Benchmarked on Various ARM Processors
inferred← citeshttps://doi.org/10.3934/amc.2010.4.261openalex-snapshot
Efficient reduction of large divisors on hyperelliptic curves
inferred← citeshttps://doi.org/10.5120/1845-2346openalex-snapshot
Comparative Study of Arithmetic and Huffman Data Compression Techniques for Koblitz Curve Cryptography
inferred← citeshttps://doi.org/10.5539/jmr.v4n6p34openalex-snapshot
New Model of Binary Elliptic Curve
inferred← citeshttps://doi.org/10.5802/jtnb.840openalex-snapshot
Optimality of the Width- w Non-adjacent Form: General Characterisation and the Case of Imaginary Quadratic Bases
inferred← citeshttps://doi.org/10.70675/86212ed3z3b5bz489bz8cb3z87ef3f85dd6bopenalex-snapshot
Elliptic curve cryptography algorithms resistant against power analysis attacks on resource constrained devices
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.