Fundamentos de criptografía
Las cartas secretas de María Estuardo, reina de Escocia
Introducción a la Criptografía
Encripción y Estrategias de Ofuscación
Criptografía Clásica
Conceptos Criptográficos
Aleatoriedad
Manejo de Aleatoriedad en JavaScript
Cryptoanálisis y Seguridad de Cifrado
Seguridad Criptográfica
Criptografía Simétrica
Ciphers
Advanced Encryption Standard
Cifrar y descrifrar archivos con JavaScript
Seguridad a través de Hashes
Funciones de hash comunes
Criptografía Asimétrica
Aritmética modular en Criptotografía Asimétrica
Intercambio de llaves y el problema del logaritmo discreto
Algoritmo de Diffie-Hellman
Cifrar mensajes con el algoritmo de Deffie-Hellman.
RSA y firma digital
Implementar Algoritmo de RSA y firma digital
Criptografía de Curvas Elípticas
ECDSA y tipos de curvas
Criptografía Moderna
Infraestructura de llave pública (PKI)
Sistemas de pruebas interactivos
Computación Cuántica
Investigación en Criptografía
You don't have access to this class
Keep learning! Join and start boosting your career
Cryptographic security is that holy grail sought by cryptosystem designers: the promise that a system is unbreakable or that its protection cannot be breached. This concept focuses on problems so complex that they are theoretically unsolvable or provably impossible to solve. However, achieving this level of security in practice is a Herculean task. While you might recall the "one-time pad" cipher that guarantees perfect encryption by having a key longer than the plaintext, it is impractical due to the extreme length of the keys required.
This is where computational security comes into play, which does not claim to be infallible, but is incredibly difficult to break. It consists of the ability of a cryptosystem to be effectively secure under practical conditions. These systems depend on problems that, although they may have theoretical solutions, are computationally infeasible to solve. Through the use of robust algorithms and keys, we seek to make the systems durable and robust in the face of future advances in computation.
Determining the degree of computational security of a system is complicated and depends on constantly changing environmental factors, such as the development of new algorithms or advances in processing technology. Despite this, it is possible to assign a level of security in terms of bits. For example, a modified version of the One Time Pad with a 128-bit key provides a large enough space to make it extraordinarily difficult to find the correct key. Imagine, it could take billions of years to break, even if hundreds of thousands of attempts per second were tried.
The use of significantly large keys is crucial to increase the resilience of cryptosystems. With each increase in key size, we not only better protect data, but also stay ahead of potential technological advances. It is impressive to note that breaking a system with a sufficiently robust key can be a more difficult feat than counting atoms in the universe. This is what makes maintaining the security of our cryptosystems a constant concern.
If you have examples or thoughts on the difference between cryptographic and computer security, I invite you to leave them in the comments! This will not only enrich your understanding, but also foster a valuable exchange with others interested in the subject. Keep exploring and learning in this fascinating world of cryptography.
Contributions 10
Questions 0
Para mi la diferencia es la limitación del recurso/insumo/herramienta utilizado para romper la seguridad, si necesitamos un recurso ilimitado contamos con seguridad informática, pero si nuestro recurso es limitado y especificamente de un recurso computacional nos encontramos en la seguridad computacional.
Por ejemplo la llegada de la computación cuántica podría ser un nuevo recurso computacional que se cuantifica por quantums.
gracias
Want to see more contributions, questions and answers from the community?