university website Publications by Year
  • sign in
  • Cryptology /
  • Algorithmic validation of widely used cryptosystems /
  • Lecture Notes in Computer Science /
  • In Proceedings
  • Search

W.H. Ekkelkamp (Willemien)

2008-05-01

Predicting the Sieving Effort for the Number Field Sieve

Publication

Publication

Presented at the Algorithmic Number Theory Symposium, Banff, Canada

Additional Metadata
THEME Software (theme 1)
Publisher Springer
Editor A. Stein (Andreas)
Series Lecture Notes in Computer Science
Project Algorithmic validation of widely used cryptosystems
Conference Algorithmic Number Theory Symposium
Organisation Cryptology
Citation
APA
  • APA Style
  • APA-ALL Style
  • AAA Style
  • Cell Style
  • Chicago Style
  • Harvard Style
  • IEEE Style
  • MLA Style
  • Nature Style
  • Vancouver Style
  • American-Institute-of-Physics Style
  • Council-of-Science-Editors Style
  • BibTex Format
  • Endnote Format
  • RIS Format
  • CSL Format
  • DOIs only Format
Ekkelkamp, W. (2008). Predicting the Sieving Effort for the Number Field Sieve. In A. Stein (Ed.), Algorithmic Number Theory (pp. 167–179). Springer.
Free Full Text ( Author Manuscript , 436kb ) cover

university website
  • Address

    • Centrum Wiskunde & Informatica
    • Science Park 123 | 1098 XG Amsterdam | the Netherlands
  • CWI researchers

    • Register Your Work
  • Questions or comments?

    • repository@cwi.nl
artudis website

Workflow

Workflow

Add Content


User Publication Person Organisation Collection
Close