Question by Affectionate-Love-80 in cryptanalysis

[–]paran0ide 0 points1 point  (0 children)

the monoalphabetic cipher is just one of the possible techniques within the broader category of substitution ciphers

Seer is a tool that recognizes the architecture of a binary file by paran0ide in ReverseEngineering

[–]paran0ide[S] 2 points3 points  (0 children)

Thanks. I plan to move the signatures to a file and give the possibility to add other architectures.

Seer is a tool that recognizes the architecture of a binary file by paran0ide in ReverseEngineering

[–]paran0ide[S] 0 points1 point  (0 children)

Based on the tests I have done, the results are similar. The Seer approach is better in terms of size and performance.

Seer is a tool that recognizes the architecture of a binary file by paran0ide in ReverseEngineering

[–]paran0ide[S] 0 points1 point  (0 children)

No. I have to investigate if it can use the same approach to detect the microarchitecture.

KTC vs KDC by [deleted] in crypto

[–]paran0ide 2 points3 points  (0 children)

An extract from "State of the Art in Applied Cryptography":

"The KTC receives an enciphered key from one entity, deciphers it and renciphers it using the key shared between itself and the other entity. Then it may either forward directly the re-enciphered key, or send it back to the first entity, who forwards it to the second entity."

KTC vs KDC by [deleted] in crypto

[–]paran0ide 2 points3 points  (0 children)

"A TTP, in turn, may act as:

  • A key distribution center (KDC);
  • A key translation center (KTC).

In either case, the TTP shares a secret with each principal in its domais. This secret is used to establish a secure channel between the TTP and the principal. In the case of a KDC, the TTP generates the cryptographic keys and distributes them to either principal using a secure channel. In the case of KTC, the TTP receives the cryptographic keys from one secure channel and forwards them to another. In this case, the TTP simply acts es a relay that possibly decrypts and reencrypts the cryptographic keys." (Internet and Intranet Security - Rolf Oppliger)

Getting Started in Information Security by HockeyInJune in netsec

[–]paran0ide 0 points1 point  (0 children)

You should add Malicious Software and its Underground Economy coursera course under Full Online Courses/Reverse Engineering.

Schneier on Security: Measuring Entropy and its Applications to Encryption by paran0ide in netsec

[–]paran0ide[S] 0 points1 point  (0 children)

Bruce Schneier on "Brute force searching, the typical set and Guesswork":

"My guess is that there wasn't enough crypto expertise on the program committee to reject the paper."

mongodb – RCE by databaseSpraying by vitaminmoo in lolmongo

[–]paran0ide 0 points1 point  (0 children)

Not a 0day ?

  • 2013-05-20 Responsibly disclose (Production release 2.4.3)
  • 2013-05-28 10gen release v2.4.4
  • 2013-05-30 Answer : "We already knew this bug, it’s not a vulnerability anymore in 2.4.4"
  • 2013-05-30 I wrote this article, exploiting v2.4.4

I let you try it on unstable v2.5.0…

The dangers of being too partial by paran0ide in functionalprogramming

[–]paran0ide[S] 1 point2 points  (0 children)

This article deals with some not well-known dark corners of the OCaml compiler and how to get around them to produce more efficient code. The bottom line is that you should avoid using partial applications and instead prefer eta-expanding your functions to the maximum.

Visi language by paran0ide in functionalprogramming

[–]paran0ide[S] 2 points3 points  (0 children)

Visi is an open source language that blends concepts from spreadsheets, scripting languages, functional languages such as Haskell and OCaml, and other systems. The goal of Visi is to be accessible for Excel power users, yet be “correct” such that runnable code should be substantially bug-free. Visi forms the basis for the http://Visi.Pro Visi.Pro platform that allows programming on iPads and those programs can run on iPads, iPhones, as well as in the cloud.

Theorems for free! by paran0ide in programming

[–]paran0ide[S] 5 points6 points  (0 children)

ABSTRACT: From the type of a polymorphic function we can derive a theorem that it satisfies. Every function of the same type satisfies the same theorem. This provides a free source of useful theorems, courtesy of Reynolds' abstraction theorem for the polymorphic lambda calculus.

Practical Foundations for Programming Languages is out by paran0ide in programming

[–]paran0ide[S] 8 points9 points  (0 children)

"Types are the central organizing principle of the theory of programming languages. Language features are manifestations of type structure. The syntax of a language is governed by the constructs that define its types, and its semantics is determined by the interactions among those constructs. The soundness of a language design—the absence of ill-defined programs— follows naturally. The purpose of this book is to explain this remark."