Analysis and Optimization of the TWINKLE Factoring Device

No abstract is available for this paper.

• Publication year

  2000

• Venue

  International Conference on the Theory and Application of Cryptographic Techniques

• Publication date

  2000-05-14

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-45539-6_3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The number field sieve

  2008cited by this paper
• Factorization of a 512-Bit RSA Modulus

  2000influential reference
• Factoring Large Numbers with the Twinkle Device (Extended Abstract)

  1999cited by this paper
• Lattice sieving and trial division

  1994influential reference
• The Development of the Number Field Sieve

  1994cited by this paper
• The Quadratic Sieve Factoring Algorithm

  1985cited by this paper

• Alternative Paradigms of Computation

  2021cites this paper
• History of Cryptographic Key Sizes

  2021cites this paper
• Getting Rid of Linear Algebra in Number Theory Problems

  2020cites this paper
• Factoring Integers With a Brain-Inspired Computer

  2018cites this paper
• Mechanical Computation : The Computational Complexity of Physical Computing Devices Chapter , Encyclopedia of Complexity and Systems Science

  2017cites this paper
• Magnifying computing gaps: Establishing encrypted communication over unidirectional channels

  2016cites this paper
• On the formal foundations of PUFs and related primitives

  2016cites this paper
• Practical Cryptanalysis of Real-World Systems

  2013cites this paper
• A taxonomy and survey of attacks on digital signatures

  2013cites this paper
• Mechanical Computation : The Computational Complexity of Physical Computing Devices Chapter , Encyclopedia of Complexity and Systems Science

  2013cites this paper
• Hardness Results for Mechanical Devices with a Constant Number of Degrees of Freedom

  2013cites this paper
• A Tutorial on High Performance Computing Applied to Cryptanalysis - (Invited Talk Abstract)

  2012cites this paper
• Solving Binary Linear Equation Systems over the Rationals and Binaries

  2012cites this paper
• Enhancing the reliability of digital signatures as non-repudiation evidence under a holistic threat model

  2011cites this paper
• Physical Turing Machines and the Formalization of Physical Cryptography

  2011cites this paper
• Integer Factorization of Semi-Primes Based on Analysis of a Sequence of Modular Elliptic Equations

  2011cites this paper
• PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware

  2010cites this paper
• Key Lengths Contribution to The Handbook of Information Security

  2010cites this paper
• An Algebraic Attack on Block Ciphers

  2010cites this paper
• An Optical Solution for the SAT Problem

  2010cites this paper
• Mechanical Computing: The Computational Complexity of Physical Devices

  2009cites this paper
• Mechanical Computation : its Computational Complexity and Technologies Chapter , Encyclopedia of Complexity and Systems Science

  2008cites this paper
• Recent Topics on Integer Factorization

  2008cites this paper
• RSA-salausalgoritmi ja alkuluvut

  2008cites this paper
• Special-Purpose in Cryptanalysis

  2007cites this paper
• Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit

  2007cites this paper
• Mechanical Computation: its Computational Complexity and Technologies Chapter, Encyclopedia of Complexity and Systems Science

  2007cites this paper
• CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method

  2007cites this paper
• Special-Purpose Hardware in Cryptanalysis: The Case of 1, 024-Bit RSA

  2007cites this paper
• Magnifying Computing GapsEstablishing Encrypted Communication over Unidirectional Channels (Extended Abstract)

  2007cites this paper
• CAIRN3: An FPGA Implementation of the Sieving Step with the Lattice Sieving

  2007cites this paper
• Special-Purpose Hardware in Cryptanalysis: The Case of 1,024-Bit RSA

  2007cites this paper
• Magnifying computing gaps: establishing encrypted communication over unidirectional channels

  2007cites this paper
• Implementing Secure RSA Cryptosystems Using Your Own Cryptographic JCE Provider

  2006cites this paper
• Practical aspects of curve based cryptography and cryptanalysis

  2006cites this paper
• Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization

  2005cites this paper
• Improved routing-based linear algebra for the number field sieve

  2005cites this paper
• Special-Purpose Hardware for Factoring: the NFS Sieving Step

  2005influential citation
• Guide to Elliptic Curve Cryptography

  2004influential citation
• Implementation of Sieving Step of NFS On Reconfigurable Platform

  2004cites this paper
• A Survey of Public-Key Cryptosystems

  2004cites this paper
• Yet Another Sieving Device

  2004influential citation
• On the Cost of Factoring RSA-1024

  2003influential citation
• Factoring Large Number with the TWIRL Device

  2003influential citation
• A Dedicated Sieving Hardware

  2003influential citation
• Factoring large numbers with the TWIRL device

  2003influential citation
• Factoring Estimates for a 1024-Bit RSA Modulus

  2003cites this paper
• A Survey of Two Signature Aggregation Techniques

  2003influential citation
• Extended Abstract

  2003cites this paper
• Foundations of quantum theory and quantum information applications

  2002cites this paper
• Circuits for Integer Factorization: A Proposal

  2001cites this paper
• Quantum Computing: The Final Frontier?

  2000cites this paper
• Selecting Cryptographic Key Sizes

  2000cites this paper
• Quadratic orders for {NESSIE} - Overview and parameter sizes of three public key families

  2000cites this paper
• Mechanical Computing : The Computational Complexity of Physical Devices

  year unknowncites this paper
• Ieee Transactions on Information Forensics and Security 1 Fighting Mallory the Insider: Strong Write Once Read Many Storage Assurances

  year unknowncites this paper