On the public citation graph
An implementation for a fast public-key cryptosystem
0 signed · 190 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.1007/0-387-34805-0_34openalex-snapshot
A Survey of Hardware Implementations of RSA
inferredcites →https://doi.org/10.1007/3-540-39799-x_20openalex-snapshot
Correlation Immunity and the Summation Generator
inferredcites →https://doi.org/10.1007/3-540-39799-x_29openalex-snapshot
N Using RSA with Low Exponent in a Public Key Network
inferredcites →https://doi.org/10.1007/3-540-45961-8_13openalex-snapshot
An Interactive Data Exchange Protocol Based on Discrete Exponentiation
inferredcites →https://doi.org/10.1007/978-94-009-2794-0_5openalex-snapshot
Complexity Issues for Public Key Cryptography
inferredcites →https://doi.org/10.1016/0166-218x(88)90090-xopenalex-snapshot
Optimal normal bases in GF(pn)
inferredcites →https://doi.org/10.1016/0166-218x(89)90001-2openalex-snapshot
Low complexity normal bases
inferredcites →https://doi.org/10.1090/s0002-9947-1933-1501703-0openalex-snapshot
On a Special Class of Polynomials
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866111-3openalex-snapshot
Primitive Normal Bases for Finite Fields
inferredcites →https://doi.org/10.1109/49.17708openalex-snapshot
Algorithm engineering for public key algorithms
inferredcites →https://doi.org/10.1109/5.4442openalex-snapshot
The first ten years of public-key cryptography
inferredcites →https://doi.org/10.1109/cicc.1989.56740openalex-snapshot
A high speed data encryption processor for public key cryptography
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spy2.70openalex-snapshot
Secure delegation of group exponentiations: Efficient and fully verifiable schemes with two servers†
inferred← citeshttps://doi.org/10.1006/ffta.2000.0304openalex-snapshot
Abelian Groups, Gauss Periods, and Normal Bases
inferred← citeshttps://doi.org/10.1006/jsco.1999.0309openalex-snapshot
Algorithms for Exponentiation in Finite Fields
inferred← citeshttps://doi.org/10.1007/11424826_68openalex-snapshot
Modified Sequential Normal Basis Multipliers for Type II Optimal Normal Bases
inferred← citeshttps://doi.org/10.1007/11596219_30openalex-snapshot
Modified Serial Multipliers for Type-IV Gaussian Normal Bases
inferred← citeshttps://doi.org/10.1007/11676935_53openalex-snapshot
Efficient Linear Array for Multiplication over NIST Recommended Binary Fields
inferred← citeshttps://doi.org/10.1007/11734727_27openalex-snapshot
New Architecture for Multiplication in GF(2 m ) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-44499-8_2openalex-snapshot
Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_25openalex-snapshot
Redundant Representation of Finite Fields
inferred← citeshttps://doi.org/10.1007/3-540-44750-4_4openalex-snapshot
Fast Key Exchange with Elliptic Curve Systems
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_18openalex-snapshot
Fast Normal Basis Multiplication Using General Purpose Processors
inferred← citeshttps://doi.org/10.1007/3-540-47555-9_38openalex-snapshot
A Note on Discrete Logarithms with Special Structure
inferred← citeshttps://doi.org/10.1007/3-540-47555-9_44openalex-snapshot
On the Development of a Fast Elliptic Curve Cryptosystem
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_23openalex-snapshot
Highly Regular Architectures for Finite Field Computation Using Redundant Basis
inferred← citeshttps://doi.org/10.1007/3-540-56686-4_38openalex-snapshot
Fixed-parameter complexity and cryptography
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_59openalex-snapshot
On orders of optimal normal basis generators
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_98openalex-snapshot
Gauss periods and fast exponentiation in finite fields
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_25openalex-snapshot
Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_7openalex-snapshot
Parameterized Computational Feasibility
inferred← citeshttps://doi.org/10.1007/978-1-4615-2694-0_1openalex-snapshot
Development of Fast Multiplier Structures with Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_8openalex-snapshot
Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-1-4757-6856-5_5openalex-snapshot
The State of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4899-1298-5_11openalex-snapshot
Security Management — An Overview to Reliable Authentication Procedures for Automatic Debiting Systems in RTI/IVHS Environments
inferred← citeshttps://doi.org/10.1007/978-3-030-03712-3_7openalex-snapshot
A More Efficient Secure Fully Verifiable Delegation Scheme for Simultaneous Group Exponentiations
inferred← citeshttps://doi.org/10.1007/978-3-0348-7023-8_13openalex-snapshot
A Survey of Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-01796-9_40openalex-snapshot
Pipeline Design of Bit-Parallel Gaussian Normal Basis Multiplier over GF(2m)
inferred← citeshttps://doi.org/10.1007/978-3-319-16277-5_4openalex-snapshot
Reducing the Complexity of Normal Basis Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-319-23207-2_20openalex-snapshot
Problems on Gaussian Normal Basis Multiplication for Elliptic Curve Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_54openalex-snapshot
Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-66402-6_14openalex-snapshot
Reusing Nonces in Schnorr Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-72565-9_6openalex-snapshot
Computing Low-Weight Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_12openalex-snapshot
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-28632-5_6openalex-snapshot
Efficient Linear Array for Multiplication in GF(2 m ) Using a Normal Basis for Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-45238-6_19openalex-snapshot
Efficient Exponentiation for a Class of Finite Fields GF(2 n ) Determined by Gauss Periods
inferred← citeshttps://doi.org/10.1007/978-3-540-85053-3_19openalex-snapshot
A New Bit-Serial Architecture for Field Multiplication Using Polynomial Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-12827-1_8openalex-snapshot
Concurrent Error Detection Architectures for Field Multiplication Using Gaussian Normal Basis
inferred← citeshttps://doi.org/10.1007/978-3-642-13708-2_21openalex-snapshot
A New Human Identification Protocol and Coppersmith’s Baby-Step Giant-Step Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-13797-6_3openalex-snapshot
A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier
inferred← citeshttps://doi.org/10.1007/978-3-642-78502-3_27openalex-snapshot
Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/978-93-86279-02-6_13openalex-snapshot
A Survey of Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/978-981-13-3329-3_28openalex-snapshot
Study of Symmetric-Key Cryptosystems and Implementing a Secure Cryptosystem with DES
inferred← citeshttps://doi.org/10.1007/bf00203817openalex-snapshot
Elliptic curve cryptosystems and their implementation
inferred← citeshttps://doi.org/10.1007/bfb0027920openalex-snapshot
Using cyclotomic polynomials to construct efficient discrete logarithm cryptosystems over finite fields
inferred← citeshttps://doi.org/10.1007/bfb0030345openalex-snapshot
The implementation of elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1007/s10114-005-0613-6openalex-snapshot
Normal Bases and Their Dual–Bases over Finite Fields
inferred← citeshttps://doi.org/10.1007/s10623-015-0106-2openalex-snapshot
Guest Editorial: Special Issue in Honor of Scott A. Vanstone
inferred← citeshttps://doi.org/10.1007/s10623-021-00956-7openalex-snapshot
Existence of primitive normal pairs with one prescribed trace over finite fields
inferred← citeshttps://doi.org/10.1007/s10958-013-1350-5openalex-snapshot
Complexity of computation in finite fields
inferred← citeshttps://doi.org/10.1007/s11424-009-9172-8openalex-snapshot
On the complexity of the normal bases via prime Gauss period over finite fields
inferred← citeshttps://doi.org/10.1007/s13366-015-0266-2openalex-snapshot
A note on the distribution of self-dual normal bases generators of finite fields under trace map
inferred← citeshttps://doi.org/10.1007/s40863-021-00224-5openalex-snapshot
On the existence of pairs of primitive normal elements over finite fields
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90129-copenalex-snapshot
Trace-orthogonal normal bases
inferred← citeshttps://doi.org/10.1016/j.ffa.2006.09.008openalex-snapshot
Finite field arithmetic using quasi-normal bases
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.04.004openalex-snapshot
Existence of some special primitive normal elements over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102716openalex-snapshot
A characterization and an explicit description of all primitive polynomials of degree two
inferred← citeshttps://doi.org/10.1016/j.ins.2007.12.002openalex-snapshot
WG: A family of stream ciphers with designed randomness properties
inferred← citeshttps://doi.org/10.1016/j.laa.2014.05.025openalex-snapshot
On the self-dual normal bases and their distribution
inferred← citeshttps://doi.org/10.1016/j.vlsi.2016.05.006openalex-snapshot
An efficient and high-speed VLSI implementation of optimal normal basis multiplication over GF(2 )
inferred← citeshttps://doi.org/10.1016/s0167-9260(02)00053-6openalex-snapshot
Hardware architectures for public key cryptography
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)33730-8openalex-snapshot
Scalable Multiplication and Inversion Unit for ECDSA
inferred← citeshttps://doi.org/10.1023/a:1008208521515openalex-snapshot
Montgomery Multiplication in GF(2k)
inferred← citeshttps://doi.org/10.1023/a:1008354106356openalex-snapshot
The State of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1049/iet-cds.2008.0331openalex-snapshot
High-speed hardware implementation of a serial-in parallel-out finite field multiplier using reordered normal basis
inferred← citeshttps://doi.org/10.1049/iet-cds.2017.0015openalex-snapshot
Gaussian normal basis multiplier over GF(2 m ) using hybrid subquadratic‐and‐quadratic TMVP approach for elliptic curve cryptography
inferred← citeshttps://doi.org/10.1049/iet-cdt.2017.0209openalex-snapshot
High‐throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems
inferred← citeshttps://doi.org/10.1049/iet-ifs.2010.0254openalex-snapshot
Self-checking alternating logic bit-parallel Gaussian normal basis multiplier with type- t
inferred← citeshttps://doi.org/10.1049/iet-ifs.2011.0190openalex-snapshot
Fault-tolerant Gaussian normal basis multiplier over GF(2 m )
inferred← citeshttps://doi.org/10.1049/iet-ifs.2012.0110openalex-snapshot
Low-complexity Gaussian normal basis multiplier over GF(2 m )
inferred← citeshttps://doi.org/10.1049/iet-ifs.2012.0200openalex-snapshot
Palindromic-like representation for Gaussian normal basis multiplier over GF(2 m ) with odd type t
inferred← citeshttps://doi.org/10.1049/iet-ifs.2012.0227openalex-snapshot
Low space‐complexity digit‐serial dual basis systolic multiplier over Galois field GF(2 m ) using Hankel matrix and Karatsuba algorithm
inferred← citeshttps://doi.org/10.1049/iet-ifs.2015.0336openalex-snapshot
Low‐latency digit‐serial dual basis multiplier for lightweight cryptosystems
inferred← citeshttps://doi.org/10.1080/00927872.2025.2561951openalex-snapshot
Arithmetic progressions of some special elements in finite fields
inferred← citeshttps://doi.org/10.1080/02533839.2014.955977openalex-snapshot
Low-complexity digit-serial systolic Gaussian normal basis multiplier for curve-based cryptosystems
inferred← citeshttps://doi.org/10.1090/s0025-5718-1995-1297469-6openalex-snapshot
On orders of optimal normal basis generators
inferred← citeshttps://doi.org/10.1090/s0025-5718-98-00935-1openalex-snapshot
Gauss periods: orders and cryptographical applications
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.236openalex-snapshot
New Hardware Architecture for Multiplication over GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1109/12.238496openalex-snapshot
On computing multiplicative inverses in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/12.565591openalex-snapshot
Efficient exponentiation of a primitive root in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/12.729800openalex-snapshot
Systolic array implementation of Euclid's algorithm for inversion and division in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/12.805153openalex-snapshot
Fast arithmetic for public-key algorithms in Galois fields with composite exponents
inferred← citeshttps://doi.org/10.1109/30.964166openalex-snapshot
Fast VLSI arithmetic algorithms for high-security elliptic curve cryptographic applications
inferred← citeshttps://doi.org/10.1109/49.223883openalex-snapshot
An implementation of elliptic curve cryptosystems over F/sub 2/155
inferred← citeshttps://doi.org/10.1109/apccas.1998.743903openalex-snapshot
Design and implementation of arithmetic processor F/sub 2//sup 155/ for elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/apccas.2006.342168openalex-snapshot
Another Look at the Sequential Multiplier over Normal Bases
inferred← citeshttps://doi.org/10.1109/arith.2003.1207678openalex-snapshot
Low complexity sequential normal basis multipliers over GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/arith.2003.1207679openalex-snapshot
A low complexity and a low latency bit parallel systolic multiplier over GF(2/sup m/) using an optimal normal basis of type II
inferred← citeshttps://doi.org/10.1109/asap.2005.46openalex-snapshot
Multiply-Accumulate Architecture for a Special Class of Optimal Extension Fields
inferred← citeshttps://doi.org/10.1109/asic.2000.880683openalex-snapshot
Improved VLSI designs for multiplication and inversion in GF(2/sup M/) over normal bases
inferred← citeshttps://doi.org/10.1109/bwcca.2011.51openalex-snapshot
Finite Field Multiplication Using Reordered Normal Basis Multiplier
inferred← citeshttps://doi.org/10.1109/cason.2010.33openalex-snapshot
Fast Optimal Normal Basis Multiplier with Type-2kw Over GF (2m)
inferred← citeshttps://doi.org/10.1109/ddecs.2006.1649596openalex-snapshot
Normal Basis Multipliers of General Digit Width Applicable in ECC
inferred← citeshttps://doi.org/10.1109/devic63749.2025.11012382openalex-snapshot
Transmission Gate based Reordered Normal Basis Multiplier
inferred← citeshttps://doi.org/10.1109/dsd.2006.91openalex-snapshot
Two Architectures of a General Digit-Serial Normal Basis Multiplier
inferred← citeshttps://doi.org/10.1109/dsd.2007.4341455openalex-snapshot
General Digit-Serial Normal Basis Multiplier with Distributed Overlap
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/fpl.2006.311333openalex-snapshot
General Digit Width Normal Basis Multipliers with Circular and Linear Structure
inferred← citeshttps://doi.org/10.1109/iccas.2013.6703904openalex-snapshot
Loop-based RSA key generation algorithm using string identity
inferred← citeshttps://doi.org/10.1109/icecs.2003.1301981openalex-snapshot
Normal basis multiplication and inversion unit for elliptic curve cryptography
inferred← citeshttps://doi.org/10.1109/icecs.2008.4674785openalex-snapshot
A modified architecture for Optimal Normal Basis multiplication based on pre-computation
inferred← citeshttps://doi.org/10.1109/icgec.2011.63openalex-snapshot
Novel Mastrovito Multiplier over GF(2m) Using Trinomial
inferred← citeshttps://doi.org/10.1109/icgec.2012.129openalex-snapshot
Self-Checking Gaussian Normal Basis Multiplier over GF(2m) Using Multiplexer Approach
inferred← citeshttps://doi.org/10.1109/icvd.1997.568178openalex-snapshot
Architectures for arithmetic over GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.1996.541751openalex-snapshot
Systolic array implementation of Euclid's algorithm for inversion and division in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.2000.857084openalex-snapshot
An architecture of F(2/sup 2N/) multiplier for elliptic curves cryptosystem
inferred← citeshttps://doi.org/10.1109/iscas.2002.1010820openalex-snapshot
Efficient digit-serial normal basis multipliers over GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.2006.1692881openalex-snapshot
New viewpoint of bit-serial/parallel normal basis multipliers using irreducible all-one polynomial
inferred← citeshttps://doi.org/10.1109/ismvl68998.2026.00015openalex-snapshot
A Formal Verification of Sequential GF(2 m ) Arithmetic Datapaths using Temporal-logic-based Formalization
inferred← citeshttps://doi.org/10.1109/isvlsi.2015.32openalex-snapshot
Small FPGA Based Multiplication-Inversion Unit for Normal Basis Representation in GF(2m)
inferred← citeshttps://doi.org/10.1109/medcom67532.2025.11405040openalex-snapshot
Heterogeneous Deep Ensemble Classifier for Enhanced Arrhythmia Detection and Classification in ECG Signals
inferred← citeshttps://doi.org/10.1109/mpcon66082.2025.11256728openalex-snapshot
Real-Time Pneumonia Diagnosis Using Feature Extraction and Edge Computing with MAX78000
inferred← citeshttps://doi.org/10.1109/mue.2011.47openalex-snapshot
Modified Sequential Multipliers for Type-k Gaussian Normal Bases
inferred← citeshttps://doi.org/10.1109/ncis.2011.82openalex-snapshot
Study on Several Fast Algorithm of Modular Exponentiation in RSA
inferred← citeshttps://doi.org/10.1109/rcsm67767.2025.11506653openalex-snapshot
Investigating ECG Signal Denoising and Classification Using EMD-FWBSO and Advanced Hybrid Classifiers
inferred← citeshttps://doi.org/10.1109/tc.2002.1047755openalex-snapshot
Finite field multiplier using redundant representation
inferred← citeshttps://doi.org/10.1109/tc.2003.1190584openalex-snapshot
Efficient multiplication beyond optimal normal bases
inferred← citeshttps://doi.org/10.1109/tc.2003.1244936openalex-snapshot
Fast normal basis multiplication using general purpose processors
inferred← citeshttps://doi.org/10.1109/tc.2005.29openalex-snapshot
Low complexity word-level sequential normal basis multipliers
inferred← citeshttps://doi.org/10.1109/tc.2006.10openalex-snapshot
Efficient algorithms and architectures for field multiplication using Gaussian normal bases
inferred← citeshttps://doi.org/10.1109/tc.2007.70834openalex-snapshot
A New Finite-Field Multiplier Using Redundant Representation
inferred← citeshttps://doi.org/10.1109/tc.2008.226openalex-snapshot
Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m)
inferred← citeshttps://doi.org/10.1109/tc.2010.218openalex-snapshot
High-Speed Architectures for Multiplication Using Reordered Normal Basis
inferred← citeshttps://doi.org/10.1109/tc.2010.235openalex-snapshot
A Word-Level Finite Field Multiplier Using Normal Basis
inferred← citeshttps://doi.org/10.1109/tc.2010.272openalex-snapshot
Efficient Montgomery-Based Semi-Systolic Multiplier for Even-Type GNB of GF(2^m)
inferred← citeshttps://doi.org/10.1109/tc.2012.22openalex-snapshot
Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases
inferred← citeshttps://doi.org/10.1109/tc.2012.265openalex-snapshot
Fast Inversion in ${\schmi{GF(2^m)}}$ with Normal Basis Using Hybrid-Double Multipliers
inferred← citeshttps://doi.org/10.1109/tc.2015.2481408openalex-snapshot
New Architectures for Digit-Level Single, Hybrid-Double, Hybrid-Triple Field Multiplications and Exponentiation Using Gaussian Normal Bases
inferred← citeshttps://doi.org/10.1109/tc.2020.3023131openalex-snapshot
Novel GF($2_m$) Digit-Serial PISO Multipliers for the Self-Dual Gaussian Normal Bases
inferred← citeshttps://doi.org/10.1109/tc.2022.3215638openalex-snapshot
Tensor Based Multivariate Polynomial Modulo Multiplier for Cryptographic Applications
inferred← citeshttps://doi.org/10.1109/tcad.2018.2818726openalex-snapshot
Boolean Gröbner Basis Reductions on Finite Field Datapath Circuits Using the Unate Cube Set Algebra
inferred← citeshttps://doi.org/10.1109/tce.2004.1277865openalex-snapshot
Design and implementation of a private and public key crypto processor and its application to a security system
inferred← citeshttps://doi.org/10.1109/tcsi.2016.2626375openalex-snapshot
Half-Matrix Normal Basis Multiplier Over GF( $p^{m}$ )
inferred← citeshttps://doi.org/10.1109/tcsii.2014.2387612openalex-snapshot
Fast and Generic Inversion Architectures Over $\mbox{GF}(2^m)$ Using Modified Itoh–Tsujii Algorithms
inferred← citeshttps://doi.org/10.1109/tit.2010.2044071openalex-snapshot
Parameterized Splitting Systems for the Discrete Logarithm
inferred← citeshttps://doi.org/10.1109/tvlsi.2002.801608openalex-snapshot
A microcoded elliptic curve processor using FPGA technology
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2003005openalex-snapshot
A High-Speed Word Level Finite Field Multiplier in ${\BBF}_{2^m}$ Using Redundant Representation
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2358196openalex-snapshot
Systolic Array Architectures for Sunar–Koç Optimal Normal Basis Type II Multiplier
inferred← citeshttps://doi.org/10.1109/tvlsi.2017.2720190openalex-snapshot
Low-Complexity Digit-Level Systolic Gaussian Normal Basis Multiplier
inferred← citeshttps://doi.org/10.1109/tvlsi.2018.2851958openalex-snapshot
Efficient VLSI Implementation of a Sequential Finite Field Multiplier Using Reordered Normal Basis in Domino Logic
inferred← citeshttps://doi.org/10.1109/wispnet.2017.8300158openalex-snapshot
Hardware implementation and performance comparison of normal basis multiplication methods over GF (2m)
inferred← citeshttps://doi.org/10.1137/s0097539704446037openalex-snapshot
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields
inferred← citeshttps://doi.org/10.1142/s0218196722500187openalex-snapshot
On the existence of primitive normal elements of rational form over finite fields of even characteristic
inferred← citeshttps://doi.org/10.1142/s0219498823501529openalex-snapshot
Primitive normal values of rational functions over finite fields
inferred← citeshttps://doi.org/10.1142/s1793557118500316openalex-snapshot
On primitive normal elements over finite fields
inferred← citeshttps://doi.org/10.1145/1015047.1015053openalex-snapshot
Efficient digit-serial normal basis multipliers over binary extension fields
inferred← citeshttps://doi.org/10.1145/126569.127016openalex-snapshot
DES watch: an examination of the sufficiency of the data encryption standard for financial institution information security in the 1990s
inferred← citeshttps://doi.org/10.1155/2014/258187openalex-snapshot
Self-Dual Normal Basis of a Galois Ring
inferred← citeshttps://doi.org/10.1201/9780849387692.ch4openalex-snapshot
Hardware Design Issues in Elliptic Curve Cryptography for Wireless Systems
inferred← citeshttps://doi.org/10.14311/688openalex-snapshot
Scalable Normal Basis Arithmetic Unit for Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.14419/ijet.v7i2.12.11356openalex-snapshot
Implementation of reconfigurable galois field multipliers over2m using primitive polynomials
inferred← citeshttps://doi.org/10.1515/forum-2024-0026openalex-snapshot
Arithmetic progression in a finite field with prescribed norms
inferred← citeshttps://doi.org/10.1631/jzus.a0820398openalex-snapshot
Low-complexity multiplexer-based normal basis multiplier over GF(2 m )
inferred← citeshttps://doi.org/10.17485/ijst/2015/v8i34/86663openalex-snapshot
Design of Fast Finite Field Multiplier based on Noramal Basis
inferred← citeshttps://doi.org/10.2307/2153492openalex-snapshot
On Orders of Optimal Normal Basis Generators
inferred← citeshttps://doi.org/10.24275/uami.0k225b156openalex-snapshot
Criptografía y curvas elípticas
inferred← citeshttps://doi.org/10.2478/v10127-010-0028-3openalex-snapshot
On a family of preimage-resistant functions
inferred← citeshttps://doi.org/10.25949/19441748openalex-snapshot
Design and analysis of human identification protocols
inferred← citeshttps://doi.org/10.26053/0h-8eyy-yag0openalex-snapshot
Word-level abstractions for sequential design verification using algebraic geometry
inferred← citeshttps://doi.org/10.3923/jas.2005.604.633openalex-snapshot
Theory and Implementation of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.3929/ethz-a-004704198openalex-snapshot
Application exploration regarding a DPC like architecture
inferred← citeshttps://doi.org/10.3934/amc.2013.7.187openalex-snapshot
Discrete logarithm like problems and linear recurring sequences
inferred← citeshttps://doi.org/10.48550/arxiv.math/0311120openalex-snapshot
On the Bounded Sum-of-digits Discrete Logarithm Problem in Kummer and Artin-Schreier Extensions
inferred← citeshttps://doi.org/10.5120/4863-7204openalex-snapshot
An Arithmetic over GF (2^5) Tt Implement in ECC
inferred← citeshttps://doi.org/10.5555/2755753.2757189openalex-snapshot
Formal verification of sequential Galois field arithmetic circuits using algebraic geometry
inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
inferred← citeshttps://doi.org/10.70675/16812547z40d8z411cz8e13z65480ff1cf00openalex-snapshot
Try again. Fail again. Fail better : new notions of security, broken assumptions, and increased efficiency in cryptography
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
inferred← citeshttps://doi.org/10.70675/d79e8374z27e1z4823z9204z2c614d5eb724openalex-snapshot
Application of cryptographic and verification techniques to the security and privacy of information systems
inferred← citeshttps://doi.org/10.7146/dpb.v24i499.7027openalex-snapshot
Exponentiation, Modular Multiplication and VLSI Implementation of High-Speed RSA Cryptography
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.