On the public citation graph

One-way permutations on elliptic curves

https://doi.org/10.1007/bf00196911

0 signed · 74 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-39799-x_31openalex-snapshot

Use of Elliptic Curves in Cryptography

inferredcites →https://doi.org/10.1007/3-540-47721-7_7openalex-snapshot

A Pseudo-Random Bit Generator Based on Elliptic Logarithms

inferredcites →https://doi.org/10.1007/978-1-4757-1920-8openalex-snapshot

The Arithmetic of Elliptic Curves

inferredcites →https://doi.org/10.1007/bf01840433openalex-snapshot

Discrete logarithms inGF(p)

inferredcites →https://doi.org/10.1007/bf02579323openalex-snapshot

One way functions and pseudorandom generators

inferredcites →https://doi.org/10.1016/0196-8858(86)90023-0openalex-snapshot

Sequences of numbers generated by addition in formal groups and new primality and factorization tests

inferredcites →https://doi.org/10.1016/b978-0-12-386870-1.50014-9openalex-snapshot

Fast, Rigorous Factorization and Discrete Logarithm Algorithms

inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50017-5openalex-snapshot

Algorithms in Number Theory

inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777280-6openalex-snapshot

Elliptic curves over finite fields and the computation of square roots mod 𝑝

inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot

Elliptic Curve Cryptosystems

inferredcites →https://doi.org/10.1090/s0025-5718-60-99239-5openalex-snapshot

Mathematics of Computation

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/sfcs.1982.95openalex-snapshot

Theory and application of trapdoor functions

inferredcites →https://doi.org/10.1109/sfcs.1988openalex-snapshot

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science

inferredcites →https://doi.org/10.1109/sfcs.1988.21917openalex-snapshot

On the existence of pseudorandom generators

inferredcites →https://doi.org/10.1109/sfcs.1992openalex-snapshot

Proceedings., 33rd Annual Symposium on Foundations of Computer Science

inferredcites →https://doi.org/10.1109/sfcs.1994openalex-snapshot

Proceedings 35th Annual Symposium on Foundations of Computer Science

inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot

New directions in cryptography

inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot

An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)

inferredcites →https://doi.org/10.1137/0213053openalex-snapshot

How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

inferredcites →https://doi.org/10.1137/0217012openalex-snapshot

How to Generate Factored Random Numbers

inferredcites →https://doi.org/10.1145/103418.103434openalex-snapshot

Reducing elliptic curve logarithms to logarithms in a finite field

inferredcites →https://doi.org/10.1145/12130.12162openalex-snapshot

Almost all primes can be quickly certified

inferredcites →https://doi.org/10.1145/28395.28445openalex-snapshot

Recognizing primes in random polynomial time

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

inferredcites →https://doi.org/10.1145/3618260openalex-snapshot

Proceedings of the 56th Annual ACM Symposium on Theory of Computing

inferredcites →https://doi.org/10.1145/73007.73009openalex-snapshot

Pseudo-random generation from one-way functions

inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot

A hard-core predicate for all one-way functions

inferredcites →https://doi.org/10.1145/73007.73012openalex-snapshot

Limits on the provable consequences of one-way permutations

inferredcites →https://doi.org/10.2190/ynv2-qrb2-hucn-dgjkopenalex-snapshot

Verbal Interaction and Problem-Solving within Computer-Assisted Cooperative Learning Groups

inferredcites →https://doi.org/10.2307/1971363openalex-snapshot

Factoring Integers with Elliptic Curves

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11693383_9openalex-snapshot

A Space Efficient Backdoor in RSA and Its Applications

inferred← citeshttps://doi.org/10.1007/11745853_27openalex-snapshot

The Twist-AUgmented Technique for Key Exchange

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-48071-4_24openalex-snapshot

Efficient Multiplication on Certain Nonsupersingular Elliptic Curves

inferred← citeshttps://doi.org/10.1007/3-540-49264-x_7openalex-snapshot

Counting the number of points on elliptic curves over finite fields: strategies and performances

inferred← citeshttps://doi.org/10.1007/3-540-58108-1_10openalex-snapshot

Design principles for dedicated hash functions

inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_7openalex-snapshot

Elliptic Curves over Finite Fields

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-3-030-92078-4_10openalex-snapshot

Batching Base Oblivious Transfers

inferred← citeshttps://doi.org/10.1007/978-3-031-97260-7_18openalex-snapshot

Simultaneously Simple Universal and Indifferentiable Hashing to Elliptic Curves

inferred← citeshttps://doi.org/10.1007/978-3-319-26404-2_3openalex-snapshot

Image Encryption Using Koblitz’s Encoding and New Mapping Method Based on Elliptic Curve Random Number Generator

inferred← citeshttps://doi.org/10.1007/978-3-319-76578-5_12openalex-snapshot

Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups

inferred← citeshttps://doi.org/10.1007/978-3-540-30108-0_21openalex-snapshot

A Public-Key Encryption Scheme with Pseudo-random Ciphertexts

inferred← citeshttps://doi.org/10.1007/978-3-540-74124-4_24openalex-snapshot

An Elliptic Curve Backdoor Algorithm for RSASSA

inferred← citeshttps://doi.org/10.1007/978-3-540-77370-2_8openalex-snapshot

Space-Efficient Kleptography Without Random Oracles

inferred← citeshttps://doi.org/10.1007/978-3-540-79499-8_33openalex-snapshot

A Timing-Resistant Elliptic Curve Backdoor in RSA

inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_19openalex-snapshot

Batch Binary Edwards

inferred← citeshttps://doi.org/10.1007/978-3-642-15317-4_18openalex-snapshot

Kleptography from Standard Assumptions and Applications

inferred← citeshttps://doi.org/10.1007/978-3-642-40576-1_9openalex-snapshot

On Pseudo-random Number Generation Using Elliptic Curve Cryptography

inferred← citeshttps://doi.org/10.1007/978-3-662-44893-9_4openalex-snapshot

Statistical Analysis of the Chaos-Driven Elliptic Curve Pseudo-random Number Generators

inferred← citeshttps://doi.org/10.1007/b97644openalex-snapshot

Guide to Elliptic Curve Cryptography

inferred← citeshttps://doi.org/10.1007/s00145-015-9210-8openalex-snapshot

The $$\mathbb {Q}$$ Q -curve Construction for Endomorphism-Accelerated Elliptic Curves

inferred← citeshttps://doi.org/10.1007/s10559-013-9531-2openalex-snapshot

Isomorphic transformations of an elliptic curve over a finite field

inferred← citeshttps://doi.org/10.1016/j.ffa.2019.02.005openalex-snapshot

On the cyclicity of the rational points group of abelian varieties over finite fields

inferred← citeshttps://doi.org/10.1023/a:1008354106356openalex-snapshot

The State of Elliptic Curve Cryptography

inferred← citeshttps://doi.org/10.1080/02522667.1995.10699232openalex-snapshot

Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher

inferred← citeshttps://doi.org/10.1109/aect47998.2020.9194180openalex-snapshot

Random Bit Generator Mechanism Based on Elliptic Curves and Secure Hash Function

inferred← citeshttps://doi.org/10.1109/fdtc.2008.15openalex-snapshot

Fault Attack on Elliptic Curve Montgomery Ladder Implementation

inferred← citeshttps://doi.org/10.1109/focs.2018.00023openalex-snapshot

PPP-Completeness with Connections to Cryptography

inferred← citeshttps://doi.org/10.1109/issa.2015.7335078openalex-snapshot

AFA-RFID: Physical layer authentication for passive RFID tags

inferred← citeshttps://doi.org/10.1109/tit.2011.2170054openalex-snapshot

Pseudorandom Bits From Points on Elliptic Curves

inferred← citeshttps://doi.org/10.1142/9789811226168_0006openalex-snapshot

Elliptic Curve Cryptosystems

inferred← citeshttps://doi.org/10.1142/9789812703309_0006openalex-snapshot

Elliptic Curve Cryptosystems

inferred← citeshttps://doi.org/10.12785/amis/010105openalex-snapshot

On Pseudo-Random Number Generators Using Elliptic Curves and Chaotic Systems

inferred← citeshttps://doi.org/10.15439/2016f94openalex-snapshot

Pseudo-random Sequence Generation from Elliptic Curves over a Finite Field of Characteristic 2

inferred← citeshttps://doi.org/10.1587/transfun.e94.a.392openalex-snapshot

Sequential Bitwise Sanitizable Signature Schemes

inferred← citeshttps://doi.org/10.18576/amis/100407openalex-snapshot

Image Encryption using Chaos-Driven Elliptic Curve Pseudo-Random Number Generators

inferred← citeshttps://doi.org/10.3233/jifs-201146openalex-snapshot

Hash-enhanced elliptic curve bit-string generator for medical image encryption

inferred← citeshttps://doi.org/10.37701/ts.03.2024.15openalex-snapshot

FOR PSEUDORANDOM SEQUENCES BASED ON ELLIPTIC CURVE ISOGENIES GENERATING METHOD

inferred← citeshttps://doi.org/10.48550/arxiv.1409.4526openalex-snapshot

The Q-curve construction for endomorphism-accelerated elliptic curves

inferred← citeshttps://doi.org/10.48550/arxiv.1506.07269openalex-snapshot

Distribution of elliptic twins over fixed finite fields: Numerical results

inferred← citeshttps://doi.org/10.70675/0266754ezb59fz40daz8b2dz73702b4b989bopenalex-snapshot

Cyclic abelian varieties over finite fields

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.