1. Is squaring equivalent to shifting in the normal basis representation of an extension field over the prime field?

  2. How can we add real values using GF field?
  3. How to break a columnar transposition cipher?
  4. Attacking a cipher, not knowing what the plaintext should look like – how do you know you’ve successfully decrypted the ciphertext?

  5. What are the Evaluation Meassures of Public key cryptography algorithm
  6. Is it possible to attack an SHA-256 hash seeded with PHP’s mt_rand function?

  7. How to decode a caesar that goes to transposed plaintext?
  8. Proof that this is not a secure pseudorandom function?
  9. How can I calculate non-linearity of an s-box element wise?

  10. Is it right that the Bomba can halt, but give you a different settings other than the one Germans really used for encryption using an Enigma?

  11. Is it possible to assume that the adversary is not allowed to make an all zero plaintext query in IND-CPA?

  12. Is there a quick way to know the length of a message hashed using SHA3?
  13. Recommendations for a book explaining most of the modern algorithms?
  14. Is it possible to actually verify a “sponge function” security claim?

  15. Analysis of Repeatedly Enciphered Plaintext using Same Algorithm / Key?

  16. Risks of full length KCV (components and full keys)?

  17. how to calculate the non linearity of each element of s box?
  18. What if we increase the key length of DES and use ECB Mode, then will we get the different output as ECB mode encrypt with the same key?

  19. Cryptanalysis on block cipher (What is exactly a zero correlation attack?)
  20. how to implement non linearity criterea on s box to find non linearity of tha s plz explain .p

  21. Should the identity of a sender be verified using additional means, or does a MAC suffice?

  22. Why can an arbitrary compression function mapping $\{0,1\}^{m+2^m} \rightarrow \{0,1\}^m$ not seriously be considered collision resistant?

  23. Jumblar: Using map locations as passwords
  24. Stuck on an affine cipher exercise
  25. Security of additive symmetric homomorphic encryption scheme with linear operations?

  26. Semantic security IND-CPA of Affine Hill Cipher

  27. Known Plaintext Attack A5/2
  28. Why should the factors $p,q$ of $n$ be half the bit length of $n$ in RSA?
  29. How is a "SHA256 reduced by X of Y rounds" built?

  30. Can you help me understand Pollard's rho example?
  31. What rule(s) for a good S-box is this one violating and how does it relate to non-linearity etc.?

  32. RSA Calculating the size of the plaintext given two primes p and q

  33. Quantative criteria to measure confusion and diffusion property of encryption algorithm
  34. How can I identify the linear equations for a block cipher with 4 different s-boxes?

  35. What are the relations between cryptanalysis of block ciphers such as AES and Kendall's tau coefficient?

  36. Why the permutation of the right hand rotor given in Rejewski's paper is $PNP^{-1}$?
  37. Break simplified DES
  38. XORing to detect decrypted value?
  39. Can/Which encryption algorithms be daisy chained to create a cryptographic computational puzzle?
  40. Why was the Navajo code not broken by the Japanese in WWII?
  41. Homogenous vs heterogeneous unbalanced Feistel networks?
  42. Applicability of IBM's projected 50-qubit quantum computer Q to cryptanalysis?

  43. AES: a question about dual ciphers and security

  44. Kerckhoffs’ principles – Why should I make my cipher public?
  45. List of security protocols that have been proved to have bugs using formal methods

  46. how long does the cycle length have to be in stream ciphers?
  47. Why do elliptic curves require fewer bits for the same security level?

  48. Finding Small Roots of Multivariate Polynomial Modulo an Integer in Sage (Coppersmith's Attack on RSA)

  49. Deciphering the RSA encrypted message from three different public keys

  50. Known plaintext attack against Feistel ciphers
  51. Parallel Pollard's Rho: Number of distinguished points
  52. Increasing rounds in DES, increases or decreases the security?

  53. Are there any long term RC4 bias based exploits?

  54. How to encrypt data and know it will be secure for at least a few decades?

  55. Including the next random One Time Pad as part of the encoded message?

  56. While encrypting what can happen between words

  57. What are the implications of a non “constant time” implementations on trusted systems in a non-network scenario?
  58. Cracking a key using a combination of partial keys

  59. Why in the Rao-Nam private key version of McEliece scheme, P matrix is multiplied after adding error vector?

  60. What does the "Type 1 query" model on Miles, Sahai, and Zhandry's paper?

  61. How can we prove that the scrambled G matrix in McEliece cryptosystem preserves the minimum distance properties of G matrix?

  62. Will properties of original G matrix be satisfied in the scrambled G (SGP) matrix in McEliece cryptosystem?

  63. Exercise: recognizing Hawaiian plaintext
  64. What are recommended, general strategies to start block-cipher design and/or analysis?
  65. Pseudorandom vs quasi-random
  66. Difference between the ACM cipher and Vigenere Cipher
  67. How to determine the next number from java's Random method

  68. How is it possible for someone to "Protect against Future Unknown Attacks"

  69. Decrypting AES with known properties of plaintext

  70. Determining a cryptographic algorithm by description

  71. Components of Cryptanalysis

  72. Classify a (block) cipher

  73. If a cipher is not in ECB mode, how is it possible to apply differential cryptanalysis?

  74. Attack on Cipher with Highly Related RoundKeys
  75. Does a practical collision attack on a cryptographic hash function also mean it fails “indistinguishable from random data”?

  76. Affine Cipher Cryptanalysis

  77. what is scyther code for this protocol?

  78. How Far Ahead of Academia Are Government Agencies?

  79. Incremental RC4 algorithm?

  80. Where is HChaCha20 formally defined?

  81. Which precautions to protect against side-channel attacks on ARX ciphers?

  82. Why can't I reverse a hash to a possible input?
  83. truncated linear congruential generator
  84. Space complexity of quantum collision search?

  85. Is 80 bits of key size considered safe against brute force attacks?

  86. Shake 128/256 Output Length Restrictions
  87. Knowing interval of discrete log for elliptic curve
  88. Is $a b + e \mod P$ hard to invert?

  89. Affine cipher : Why it is required to have GCD(a, m) equals to 1
  90. Does adding more characters to the Enigma rotors improve crypto strength?

  91. Fuzzy Extractor constructor for sequence reconciliation

  92. What are the exceptions to Kerckhoffs's principle?
  93. Correlation between prop ratio and numbers of pairs needed
  94. Can a MITM attack be applied to this construction?
  95. How to make Difference Distribution Table
  96. Cracking affine cipher with plaintext

  97. Is python a secure programming language for cryptography?

  98. A good introduction to Cryptography

  99. Reversing this Rotation + Xor Decryption
  100. Is quantum cryptography unbreakable?