On the public citation graph
Discrete logarithms inGF(p)
0 signed · 246 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/3-540-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
inferredcites →https://doi.org/10.1007/978-1-4684-4730-9_22openalex-snapshot
A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2)
inferredcites →https://doi.org/10.1007/bf01933667openalex-snapshot
A monte carlo method for factorization
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0022-314x(83)90002-1openalex-snapshot
On a problem of Oppenheim concerning “factorisatio numerorum”
inferredcites →https://doi.org/10.1109/sfcs.1979.2openalex-snapshot
A subexponential algorithm for the discrete logarithm problem with applications to cryptography
inferredcites →https://doi.org/10.1109/tit.1984.1056941openalex-snapshot
Fast evaluation of logarithms in fields of characteristic two
inferredcites →https://doi.org/10.1109/tit.1985.1057075openalex-snapshot
A subexponential-time algorithm for computing discrete logarithms overGF(p^2)
inferredcites →https://doi.org/10.1109/tit.1986.1057137openalex-snapshot
Solving sparse linear equations over finite fields
inferredcites →https://doi.org/10.1137/0211038openalex-snapshot
On the Asymptotic Complexity of Matrix Multiplication
inferredcites →https://doi.org/10.6028/jres.045.026openalex-snapshot
An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
inferredcites →https://doi.org/10.6028/jres.049.044openalex-snapshot
Methods of conjugate gradients for solving linear systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/scj.4690200909openalex-snapshot
A Cryptographic Key Distribution Mechanism Using Double Encryption for Secret Communications
inferred← citeshttps://doi.org/10.1002/scj.4690210106openalex-snapshot
Identity‐based conference key distribution systems
inferred← citeshttps://doi.org/10.1006/inco.1998.2761openalex-snapshot
Function Field Sieve Method for Discrete Logarithms over Finite Fields
inferred← citeshttps://doi.org/10.1006/jsco.2002.0533openalex-snapshot
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
inferred← citeshttps://doi.org/10.1007/0-387-34799-2_7openalex-snapshot
Intractable Problems in Number Theory
inferred← citeshttps://doi.org/10.1007/0-387-34805-0_22openalex-snapshot
Efficient Identification and Signatures for Smart Cards
inferred← citeshttps://doi.org/10.1007/11681878_28openalex-snapshot
Threshold and Proactive Pseudo-Random Permutations
inferred← citeshttps://doi.org/10.1007/11745853_12openalex-snapshot
An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve
inferred← citeshttps://doi.org/10.1007/11780656_22openalex-snapshot
Efficient Primitives from Exponentiation in ℤ p
inferred← citeshttps://doi.org/10.1007/11792086_31openalex-snapshot
Hidden Pairings and Trapdoor DDH Groups
inferred← citeshttps://doi.org/10.1007/11894063_11openalex-snapshot
Implementing Cryptographic Pairings on Smartcards
inferred← citeshttps://doi.org/10.1007/11941378_17openalex-snapshot
Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_40openalex-snapshot
A Comparison of Practical Public-Key Cryptosystems based on Integer Factorization and Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_43openalex-snapshot
Computation of Discrete Logarithms in Prime Fields
inferred← citeshttps://doi.org/10.1007/3-540-38424-3_8openalex-snapshot
Solving Large Sparse Linear Systems Over Finite Fields
inferred← citeshttps://doi.org/10.1007/3-540-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-39799-x_40openalex-snapshot
A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes
inferred← citeshttps://doi.org/10.1007/3-540-39805-8_4openalex-snapshot
A Public-Key Cryptosystem Based on Shift Register Sequences
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_28openalex-snapshot
New Public Key Cryptosystem Using Finite Non Abelian Groups
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-44968-x_2openalex-snapshot
Recent Progress and Prospects for Integer Factorisation Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45311-3_19openalex-snapshot
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_34openalex-snapshot
The Function Field Sieve Is Quite Special
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_7openalex-snapshot
Computation of Discrete Logarithms in $$ \mathbb{F}_{2^{607} } $$
inferred← citeshttps://doi.org/10.1007/3-540-45961-8_2openalex-snapshot
Security of Improved Identity-based Conference Key Distribution Systems
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_28openalex-snapshot
Building Cyclic Elliptic Curves Modulo Large Primes
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_43openalex-snapshot
Non-interactive Public-Key Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_30openalex-snapshot
Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields
inferred← citeshttps://doi.org/10.1007/3-540-46766-1_21openalex-snapshot
Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-47719-5_9openalex-snapshot
First Implementation of Cryptographic Protocols Based on Algebraic Number Fields
inferred← citeshttps://doi.org/10.1007/3-540-47721-7_19openalex-snapshot
Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-48071-4_5openalex-snapshot
Designing and Detecting Trapdoors for Discrete Log Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-48184-2_13openalex-snapshot
Identity-based conference key distribution systems
inferred← citeshttps://doi.org/10.1007/3-540-48329-2_13openalex-snapshot
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_28openalex-snapshot
Relationships among the Computational Powers of Breaking Discrete Log Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_8openalex-snapshot
An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_9openalex-snapshot
A Block Lanczos Algorithm for Finding Dependencies over GF(2)
inferred← citeshttps://doi.org/10.1007/3-540-49649-1_1openalex-snapshot
Generating RSA Moduli with a Predetermined Portion
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_71openalex-snapshot
Modified Maurer-Yacobi's scheme and its applications
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_31openalex-snapshot
An efficient zero-knowledge scheme for the discrete logarithm based on smooth numbers
inferred← citeshttps://doi.org/10.1007/3-540-57341-0_56openalex-snapshot
Secret-key exchange with authentication
inferred← citeshttps://doi.org/10.1007/3-540-58691-1_70openalex-snapshot
Open problems in number theoretic complexity, II
inferred← citeshttps://doi.org/10.1007/3-540-61581-4_66openalex-snapshot
Discrete logarithms: The effectiveness of the index calculus method
inferred← citeshttps://doi.org/10.1007/3-540-61581-4_70openalex-snapshot
Computing discrete logarithms with the general number field sieve
inferred← citeshttps://doi.org/10.1007/978-0-387-34873-5_14openalex-snapshot
A Practical Conference Key Distribution System
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_834openalex-snapshot
Number Field Sieve for the DLP
inferred← citeshttps://doi.org/10.1007/978-1-4612-4808-8_29openalex-snapshot
The Complexity of Computing Discrete Logarithms and Factoring Integers
inferred← citeshttps://doi.org/10.1007/978-1-4612-4808-8_30openalex-snapshot
Knapsack Used in Factoring
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_28openalex-snapshot
Perfect Zero-Knowledge Sharing Schemes over any Finite Abelian Group
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_6openalex-snapshot
The Discrete Logarithm Problem
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_3openalex-snapshot
Discrete Logarithms: The Past and the Future
inferred← citeshttps://doi.org/10.1007/978-3-030-73492-3_13openalex-snapshot
Cycles, Randomness, Discrete Logarithms, and Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-030-73492-3_9openalex-snapshot
Modern Symmetric Ciphers—DES and AES
inferred← citeshttps://doi.org/10.1007/978-3-030-77870-5_1openalex-snapshot
Non-interactive Zero Knowledge from Sub-exponential DDH
inferred← citeshttps://doi.org/10.1007/978-3-030-78120-0_10openalex-snapshot
Lattice-Based Weak Curve Fault Attack on ECDSA
inferred← citeshttps://doi.org/10.1007/978-3-030-99792-2_45openalex-snapshot
A New Public Key Encryption Using Dickson Polynomials Over Finite Field with $$2^{m}$$
inferred← citeshttps://doi.org/10.1007/978-3-031-50432-7_13openalex-snapshot
Zyklen, Zufälligkeit, diskrete Logarithmen und Schlüsselaustausch
inferred← citeshttps://doi.org/10.1007/978-3-031-50432-7_9openalex-snapshot
Moderne symmetrische Chiffren – DES und AES
inferred← citeshttps://doi.org/10.1007/978-3-031-94448-2_14openalex-snapshot
Dynamically Expanding Factor Base of Index Calculus Algorithm to Solve Massive Discrete Logarithm Problems Faster
inferred← citeshttps://doi.org/10.1007/978-3-032-25330-9_4openalex-snapshot
The Structured Generic-Group Model
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-04873-4_6openalex-snapshot
Constructing Symmetric Pairings over Supersingular Elliptic Curves with Embedding Degree Three
inferred← citeshttps://doi.org/10.1007/978-3-319-10683-0_2openalex-snapshot
The Past, Evolving Present, and Future of the Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/978-3-319-55227-9_1openalex-snapshot
A Brief History of Pairings
inferred← citeshttps://doi.org/10.1007/978-3-319-57048-8_2openalex-snapshot
The Complexity of Public-Key Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_4openalex-snapshot
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_30openalex-snapshot
A Survey of Cryptosystems Based on Imaginary Quadratic Orders
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_9openalex-snapshot
Wie sicher ist die Public-Key-Kryptographie?
inferred← citeshttps://doi.org/10.1007/978-3-322-89817-3_18openalex-snapshot
Identitätbasierte Kryptosysteme als Alternative zu Public-Key-Infrastrukturen
inferred← citeshttps://doi.org/10.1007/978-3-540-40974-8_17openalex-snapshot
Resolving Large Prime(s) Variants for Discrete Logarithm Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_18openalex-snapshot
Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-02181-7_13openalex-snapshot
A Non-abelian Group Based on Block Upper Triangular Matrices with Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_25openalex-snapshot
Parallelization of the Lanczos Algorithm on Multi-core Platforms
inferred← citeshttps://doi.org/10.1007/978-3-642-20901-7_11openalex-snapshot
An Experiment of Number Field Sieve over GF(p) of Low Hamming Weight Characteristic
inferred← citeshttps://doi.org/10.1007/978-3-642-28931-6_10openalex-snapshot
Cryptographic Applications of 3x3 Block Upper Triangular Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-34961-4_5openalex-snapshot
Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_11openalex-snapshot
Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-40084-1_7openalex-snapshot
On the Function Field Sieve and the Impact of Higher Splitting Probabilities
inferred← citeshttps://doi.org/10.1007/978-3-642-41224-0_4openalex-snapshot
SIMD-Based Implementations of Sieving in Integer-Factoring Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-42001-6_8openalex-snapshot
An Experiment of Number Field Sieve for Discrete Logarithm Problem over GF(p 12)
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_13openalex-snapshot
Discrete Logarithm in GF(2809) with FFS
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_4openalex-snapshot
Discrete Logarithms: Recent Progress
inferred← citeshttps://doi.org/10.1007/978-3-642-78502-3_27openalex-snapshot
Number Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-662-43414-7_7openalex-snapshot
Solving a $$6120$$ -bit DLP on a Desktop Computer
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_6openalex-snapshot
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-662-48797-6_7openalex-snapshot
Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-662-54365-8_16openalex-snapshot
Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
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-15-8221-9_267openalex-snapshot
An Advanced Signature Scheme Based on Non-abelian Group Over Algebraic Technique
inferred← citeshttps://doi.org/10.1007/978-981-97-0892-5_17openalex-snapshot
Primitive Roots and Euler Totient Function-Based Progressive Visual Cryptography
inferred← citeshttps://doi.org/10.1007/bf00123958openalex-snapshot
Computation of discrete logarithms in prime fields
inferred← citeshttps://doi.org/10.1007/bf00129771openalex-snapshot
A Non-interactive Public-Key Distribution System
inferred← citeshttps://doi.org/10.1007/bf00154339openalex-snapshot
Parallel implementation of the quadratic sieve
inferred← citeshttps://doi.org/10.1007/bf00196725openalex-snapshot
Efficient signature generation by smart cards
inferred← citeshttps://doi.org/10.1007/bf00196728openalex-snapshot
Elliptic curve implementation of zero-knowledge blobs
inferred← citeshttps://doi.org/10.1007/bf00196911openalex-snapshot
One-way permutations on elliptic curves
inferred← citeshttps://doi.org/10.1007/bf00202269openalex-snapshot
Fast generation of prime numbers and secure public-key cryptographic parameters
inferred← citeshttps://doi.org/10.1007/bf00203817openalex-snapshot
Elliptic curve cryptosystems and their implementation
inferred← citeshttps://doi.org/10.1007/bf01096271openalex-snapshot
Mathematical problems in cryptology
inferred← citeshttps://doi.org/10.1007/bf01189025openalex-snapshot
A note on cyclic groups, finite fields, and the discrete logarithm problem
inferred← citeshttps://doi.org/10.1007/bf01810569openalex-snapshot
Computational problems in the theory of finite fields
inferred← citeshttps://doi.org/10.1007/bf01810847openalex-snapshot
A short proof for explicit formulas for discrete logarithms in finite fields
inferred← citeshttps://doi.org/10.1007/bf02351718openalex-snapshot
A key distribution system equivalent to factoring
inferred← citeshttps://doi.org/10.1007/bfb0030368openalex-snapshot
Demonstrating possession without revealing factors and its application
inferred← citeshttps://doi.org/10.1007/bfb0053443openalex-snapshot
A secure and efficient conference key distribution system
inferred← citeshttps://doi.org/10.1007/bfb0053717openalex-snapshot
The security of public key cryptosystems based on integer factorization
inferred← citeshttps://doi.org/10.1007/bfb0054125openalex-snapshot
Computing discrete logarithms with quadratic number rings
inferred← citeshttps://doi.org/10.1007/bfb0054857openalex-snapshot
Factorization of the numbers of the form m 3 + c 2 m 2 + c 1 m + c 0
inferred← citeshttps://doi.org/10.1007/s00200-006-0017-6openalex-snapshot
A comparison of MNT curves and supersingular curves
inferred← citeshttps://doi.org/10.1007/s10440-006-9045-2openalex-snapshot
A Review on the Isomorphism Classes of Hyperelliptic Curves of Genus 2 over Finite Fields Admitting a Weierstrass Point
inferred← citeshttps://doi.org/10.1007/s10623-012-9743-xopenalex-snapshot
Towards factoring in $${SL(2,\,\mathbb{F}_{2^n})}$$
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90235-gopenalex-snapshot
Solving linear equations over GF(2): block Lanczos algorithm
inferred← citeshttps://doi.org/10.1016/0167-4048(90)90088-bopenalex-snapshot
Secure network bootstrapping: An algorithm for authentic key exchange and digital signitures
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90157-wopenalex-snapshot
On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields
inferred← citeshttps://doi.org/10.1016/0898-1221(90)90041-hopenalex-snapshot
Some uses of microcomputers in number theory research
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50014-9openalex-snapshot
Fast, Rigorous Factorization and Discrete Logarithm Algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50017-5openalex-snapshot
Algorithms in Number Theory
inferred← citeshttps://doi.org/10.1016/j.amc.2006.05.078openalex-snapshot
Applying quick exponentiation for block upper triangular matrices
inferred← citeshttps://doi.org/10.1016/j.amc.2016.08.019openalex-snapshot
Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
inferred← citeshttps://doi.org/10.1016/j.chb.2012.08.007openalex-snapshot
Personality traits and knowledge sharing in online communities
inferred← citeshttps://doi.org/10.1016/j.ins.2009.02.008openalex-snapshot
Analysis and design of a secure key exchange scheme
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.09.001openalex-snapshot
On the security of cryptosystem using automorphism groups
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.11.011openalex-snapshot
Bottleneck flows in unit capacity networks
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.11.001openalex-snapshot
Lower bounds for decision problems in imaginary, norm-Euclidean quadratic integer rings
inferred← citeshttps://doi.org/10.1016/j.jsc.2013.12.004openalex-snapshot
Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102367openalex-snapshot
Bivariate polynomial reduction and elimination ideal over finite fields
inferred← citeshttps://doi.org/10.1016/j.laa.2013.05.016openalex-snapshot
Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
inferred← citeshttps://doi.org/10.1016/j.mcm.2011.02.022openalex-snapshot
Discrete logarithm problem using index calculus method
inferred← citeshttps://doi.org/10.1016/s0747-7171(85)80018-3openalex-snapshot
An application of factoring
inferred← citeshttps://doi.org/10.1016/s1385-7258(88)80022-2openalex-snapshot
Fast and rigorous factorization under the generalized Riemann hypothesis
inferred← citeshttps://doi.org/10.1016/s1570-7954(96)80013-1openalex-snapshot
Finite Fields and Their Applications
inferred← citeshttps://doi.org/10.1017/cbo9781139013673openalex-snapshot
Cryptography and Secure Communication
inferred← citeshttps://doi.org/10.1023/a:1008350005447openalex-snapshot
Discrete Logarithms: The Past and the Future
inferred← citeshttps://doi.org/10.1023/b:matn.0000036760.37456.f9openalex-snapshot
New Series of Rational Approximations and Some of Their Applications
inferred← citeshttps://doi.org/10.1049/iet-ifs.2017.0075openalex-snapshot
Degenerate curve attacks: extending invalid curve attacks to Edwards curves and other models
inferred← citeshttps://doi.org/10.1070/rm1991v046n01abeh002725openalex-snapshot
On some problems in the theory of finite fields
inferred← citeshttps://doi.org/10.1080/09720529.2009.10698242openalex-snapshot
Performance analysis of index calculus method
inferred← citeshttps://doi.org/10.1080/09720529.2010.10698275openalex-snapshot
Ephemeral key recovery using index calculus method
inferred← citeshttps://doi.org/10.1080/120716031000120827openalex-snapshot
On the cubic sieve method for computing discrete logarithms over prime fields
inferred← citeshttps://doi.org/10.1088/1742-6596/1453/1/012036openalex-snapshot
The Lattice Sieve Field Selection of Cado-NFS
inferred← citeshttps://doi.org/10.1090/mcom/3376openalex-snapshot
Faster individual discrete logarithms in finite fields of composite extension degree
inferred← citeshttps://doi.org/10.1090/mcom/3669openalex-snapshot
Computation of a 30750-bit binary field discrete logarithm
inferred← citeshttps://doi.org/10.1090/s0025-5718-00-01308-9openalex-snapshot
Special prime numbers and discrete logs in finite prime fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-02-01482-5openalex-snapshot
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
inferred← citeshttps://doi.org/10.1090/s0025-5718-1993-1225541-3openalex-snapshot
A subexponential algorithm for discrete logarithms over all finite fields
inferred← citeshttps://doi.org/10.1090/tran/7027openalex-snapshot
On the discrete logarithm problem in finite fields of fixed characteristic
inferred← citeshttps://doi.org/10.1093/comjnl/35.1.21openalex-snapshot
Efficient Zero-Knowledge Identification Schemes for Smart Cards
inferred← citeshttps://doi.org/10.1098/rsta.1993.0139openalex-snapshot
Discrete logarithms and local units
inferred← citeshttps://doi.org/10.1109/18.259647openalex-snapshot
Reducing elliptic curve logarithms to logarithms in a finite field
inferred← citeshttps://doi.org/10.1109/32.42740openalex-snapshot
Cautious transaction schedulers for database concurrency control
inferred← citeshttps://doi.org/10.1109/32.48938openalex-snapshot
Multiversion cautious schedulers for database concurrency control
inferred← citeshttps://doi.org/10.1109/5.4442openalex-snapshot
The first ten years of public-key cryptography
inferred← citeshttps://doi.org/10.1109/5.4443openalex-snapshot
Cryptanalysis: a survey of recent results
inferred← citeshttps://doi.org/10.1109/artcom.2009.62openalex-snapshot
Methods to Solve Discrete Logarithm Problem for Ephemeral Keys
inferred← citeshttps://doi.org/10.1109/comst.2023.3309051openalex-snapshot
Quantum Cryptography in 5G Networks: A Comprehensive Overview
inferred← citeshttps://doi.org/10.1109/edm61683.2024.10615048openalex-snapshot
Delving into Potential Asymmetric Cryptographic Algorithms for the Post-Quantum Era
inferred← citeshttps://doi.org/10.1109/fdtc.2015.17openalex-snapshot
Singular Curve Point Decompression Attack
inferred← citeshttps://doi.org/10.1109/hicss.2016.530openalex-snapshot
Idea Generation by Employees and External Participants in Innovation Competitions
inferred← citeshttps://doi.org/10.1109/icccas55266.2022.9824139openalex-snapshot
Arithmetic Field Circuit Complexity Bounds for Erasure Encoders
inferred← citeshttps://doi.org/10.1109/icppw.2001.951908openalex-snapshot
The parallel improved Lanczos method for integer factorization over finite fields for public key cryptosystems
inferred← citeshttps://doi.org/10.1109/inftech.2008.4621640openalex-snapshot
The discrete logarithm problem in cyclic subgroups of not necessary cyclic groups
inferred← citeshttps://doi.org/10.1109/itw.2011.6089585openalex-snapshot
Extended bit-flipping algorithm for solving sparse linear systems of equations modulo p
inferred← citeshttps://doi.org/10.1109/mcom.1987.1093650openalex-snapshot
A computer dial access system based on public-key techniques
inferred← citeshttps://doi.org/10.1109/nca.2007.48openalex-snapshot
TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes
inferred← citeshttps://doi.org/10.1109/secpri.1999.766909openalex-snapshot
A data mining framework for building intrusion detection models
inferred← citeshttps://doi.org/10.1109/sfcs.1985.2openalex-snapshot
A robust and verifiable cryptographically secure election scheme
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365702openalex-snapshot
Algorithmic number theory-the complexity contribution
inferred← citeshttps://doi.org/10.1109/telfor52709.2021.9653313openalex-snapshot
Performance Analysis of Post-Quantum Algorithms
inferred← citeshttps://doi.org/10.1109/tit.2004.836694openalex-snapshot
An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel
inferred← citeshttps://doi.org/10.1112/s1461157000000723openalex-snapshot
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
inferred← citeshttps://doi.org/10.1137/0217023openalex-snapshot
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
inferred← citeshttps://doi.org/10.1137/0406010openalex-snapshot
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
inferred← citeshttps://doi.org/10.1137/s0895480192224713openalex-snapshot
Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
inferred← citeshttps://doi.org/10.1142/9789812388841_0005openalex-snapshot
COMPUTATIONAL METHODS IN PUBLIC KEY CRYPTOLOGY
inferred← citeshttps://doi.org/10.1142/9789814719261_0008openalex-snapshot
Nearly sparse linear algebra and application to discrete logarithms computations
inferred← citeshttps://doi.org/10.1142/s1793557122500176openalex-snapshot
Number of rational points of elliptic curves
inferred← citeshttps://doi.org/10.1145/103418.103432openalex-snapshot
Factoring numbers using singular integers
inferred← citeshttps://doi.org/10.1145/103418.103434openalex-snapshot
Reducing elliptic curve logarithms to logarithms in a finite field
inferred← citeshttps://doi.org/10.1145/1576702.1576723openalex-snapshot
On finding multiplicities of characteristic polynomial factors of black-box matrices
inferred← citeshttps://doi.org/10.1145/191839.191886openalex-snapshot
Quickly generating billion-record synthetic databases
inferred← citeshttps://doi.org/10.1145/191843.191886openalex-snapshot
Quickly generating billion-record synthetic databases
inferred← citeshttps://doi.org/10.1145/3236024.3275535openalex-snapshot
Efficient static checking of library updates
inferred← citeshttps://doi.org/10.1145/3238147.3238219openalex-snapshot
ClDiff: generating concise linked code differences
inferred← citeshttps://doi.org/10.1145/32439.32465openalex-snapshot
New results for random determination of equivalence of expressions
showing the first 200 of 234 · page through all 234
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.