Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm
Mathematics of Computation
Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design
Cracking DES: Secrets of Encryption Research, Wiretap Politics and Chip Design
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Recent Progress and Prospects for Integer Factorisation Algorithms
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Improved Generic Algorithms for 3-Collisions
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Analysis and optimization of the TWINKLE factoring device
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A kilobit special number field sieve factorization
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Parallel Gaussian elimination for Gröbner bases computations in finite fields
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Factorization of a 768-bit RSA modulus
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Parallel Lattice Basis Reduction - The Road to Many-Core
HPCC '11 Proceedings of the 2011 IEEE International Conference on High Performance Computing and Communications
Collisions of SHA-0 and reduced SHA-1
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
SHARK: a realizable special hardware sieving device for factoring 1024-bit integers
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Solving a 676-bit discrete logarithm problem in GF(36n)
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
The number field sieve in the medium prime case
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
The function field sieve in the medium prime case
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
Cryptology and computers have a long common history; in fact, some of the early computers were created as cryptanalytic tools. The development of faster and widely deployed computers also had a great impact on cryptology, allowing modern cryptography to become a practical tool. Today, both computers and cryptology are not only practical, but they have became ubiquitous tools. In truth, computing devices incorporating cryptography features range from very small low-end devices to supercomputer, going through all possible intermediate sizes; these devices include both general purpose computing devices and specific, often embedded, processors which enable computing and security features in hundreds of technological objects. In this invited talk, we mostly consider the cryptanalytic side of things, where it is fair to use very large amounts of computing power to break cryptographic primitives or protocols. As a consequence, demonstrating the feasibility of new cryptanalytic methods often requires large scale computations. Most articles describing such cryptanalyses usually focus on the mathematical or algorithmic advances and gloss over the implementation details, giving only sufficient data to show that the computations are feasible. The goal of the present abstract is to give an idea of the difficulty facing implementers of large scale cryptanalytic attacks.