2008
DOI: 10.1007/978-3-540-88873-4_15
|View full text |Cite
|
Sign up to set email alerts
|

Generating a Large Prime Factor of p 4±p 2 + 1 in Polynomial Time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…The third approach for generating required primes was introduced by the author in [13][14][15][16][17]. For n = 5, the algorithm works as follows [17].…”
Section: A Formulation Of the Problem And Historical Commentsmentioning
confidence: 99%
“…The third approach for generating required primes was introduced by the author in [13][14][15][16][17]. For n = 5, the algorithm works as follows [17].…”
Section: A Formulation Of the Problem And Historical Commentsmentioning
confidence: 99%