# THE FACTORING DEAD: PREPARING FOR THE CRYPTOPOCALYPSE

@inproceedings{Samuel2014THEFD, title={THE FACTORING DEAD: PREPARING FOR THE CRYPTOPOCALYPSE}, author={Javed K. K Samuel}, year={2014} }

This paper will explain the latest breakthroughs in the academic cryptography community and look ahead at what practical issues could arise for popular cryptosystems. Specifically, we will focus on the recent major developments in discrete mathematics and their potential ability to undermine our trust in the most basic asymmetric primitives, including RSA. We will explain the basic theories behind RSA and the state-of-the-art in large numbering factoring, and how several recent papers may point…

## 7 Citations

### Authentication Security through Diversity and Redundancy for Cloud Computing

- Computer Science
- 2014

This work proposes the use of redundancy and diversity to make cloud authentication mechanisms resistant to unknown, zero-day, vulnerabilities and shows its effectiveness with a cloud authentication mechanism recently found vulnerable and with a simpler message authentication use case.

### Cloud Computing Authentication Security with Diversity and Redundancy

- Computer Science
- 2014

This work proposes the use of redundancy and diversity to make cloud authentication mechanisms resistant to unknown, zero-day, vulnerabilities and shows its effectiveness with a cloud authentication mechanism recently found vulnerable and with a simpler message authentication use case.

### Use of the Walnut Digital Signature Algorithm with CBOR Object Signing and Encryption (COSE)

- Computer ScienceRFC
- 2021

This document specifies the conventions for using the Walnut Digital
Signature Algorithm (WalnutDSA) for digital signatures with the CBOR
Object Signing and Encryption (COSE) syntax. WalnutDSA is a…

### Use of the HSS/LMS Hash-Based Signature Algorithm in the Cryptographic Message Syntax (CMS)

- Computer Science, MathematicsRFC
- 2020

This document specifies the conventions for using the Hierarchical
Signature System (HSS) / Leighton-Micali Signature (LMS) hash-based
signature algorithm with the Cryptographic Message Syntax (CMS).…

### Use of the HSS/LMS Hash-Based Signature Algorithm with CBOR Object Signing and Encryption (COSE)

- Computer ScienceRFC
- 2020

This document specifies the conventions for using the Hierarchical
Signature System (HSS) / Leighton-Micali Signature (LMS) hash-based
signature algorithm with the CBOR Object Signing and Encryption…

### Use of the Hash-based Signature Algorithm with CBOR Object Signing and Encryption (COSE)

- Computer Science
- 2018

This document specifies the conventions for using the HSS/LMS hash-
based signature algorithm with the CBOR Object Signing and Encryption
(COSE) syntax. The HSS/LMS algorithm is one form of…

### Use of the Hash-based Merkle Tree Signature (MTS) Algorithm in the Cryptographic Message Syntax (CMS)

- Computer Science, Mathematics
- 2018

This document specifies the conventions for using the Merkle Tree
Signatures (MTS) digital signature algorithm with the Cryptographic
Message Syntax (CMS). The MTS algorithm is one form of hash-based…

## References

SHOWING 1-10 OF 91 REFERENCES

### Discovery and Exploitation of New Biases in RC4

- Computer Science, MathematicsSelected Areas in Cryptography
- 2010

A technique to automatically reveal linear correlations in the PRGA of RC4 is presented and 9 new exploitable correlations have been revealed, which lead to a key recovery attack on WEP with only 9800 encrypted packets (less than 20 seconds), instead of 24200 for the best previous attack.

### Lattice-Based Cryptography

- Computer Science, MathematicsEncyclopedia of Cryptography and Security
- 2011

This chapter describes some of the recent progress in lattice-based cryptography, which holds a great promise for post-quantum cryptography, as they enjoy very strong security proofs based on worst-case hardness, relatively efficient implementations, as well as great simplicity.

### The Function Field Sieve in the Medium Prime Case

- Computer Science, MathematicsEUROCRYPT
- 2006

This approach is an alternative to a recent paper of Granger and Vercauteren for computing discrete logarithms in tori, using efficient torus representations, and shows that when q is not too large, a very efficient L(1/3) variation of the function field sieve can be used.

### Traps to the BGJT-Algorithm for Discrete Logarithms

- Computer ScienceIACR Cryptol. ePrint Arch.
- 2013

This work shows that some of the heuristics of the QPA algorithm are problematic in their original forms, in particular, when the field is not a Kummer extension, and proposes a fix to the algorithm in non-Kummer cases, without altering the quasi-polynomial time complexity.

### Lucky Thirteen: Breaking the TLS and DTLS Record Protocols

- Computer Science, Mathematics2013 IEEE Symposium on Security and Privacy
- 2013

This paper presents distinguishing and plaintext recovery attacks against TLS and DTLS, based on a delicate timing analysis of decryption processing in the two protocols.

### On the Security of RC4 in TLS and WPA

- Computer Science, Mathematics
- 2013

These attacks build on recent advances in the statistical analysis of RC4, and on new ndings announced in this paper, and are supported by an experimental evaluation of the feasibility of the attacks.

### The filtering step of discrete logarithm and integer factorization algorithms

- Computer Science, Mathematics
- 2013

In this paper, several weight functions are studied in order to determine which one is more suited in the context of discrete logarithm and factorization algorithms.

### Discrete Logarithm in GF(2809) with FFS

- Mathematics, Computer SciencePublic Key Cryptography
- 2014

The state of the art with regard to the FFS algorithm is presented, and data from a record-sized discrete logarithm computation in a prime-degree extension field is reported.

### On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in F21971

- Mathematics, Computer ScienceIACR Cryptol. ePrint Arch.
- 2013

A binary field variant of the Joux-Lercier medium-sized Function Field Sieve is proposed, which results not only in complexities as low as \(L_{q^n}(1/3,(4/9)^{1/ 3})\) for computing arbitrary logarithms, but also in an heuristic polynomial time algorithm for finding the discrete logariths when the field has a subfield of an appropriate size.

### Elliptic Curve Cryptography (ECC) Cipher Suites for Transport Layer Security (TLS)

- Computer Science, MathematicsRFC
- 2006

This document describes new key exchange algorithms based on Elliptic
Curve Cryptography (ECC) for the Transport Layer Security (TLS)
protocol. In particular, it specifies the use of Elliptic Curve…