Become a fan of Slashdot on Facebook


Forgot your password?
Check out the new SourceForge HTML5 internet speed test! No Flash necessary and runs on all devices. ×

Comment Re:We need a web of trust (Score 1) 88

There's one way to emulate that in the current model:

  • Register domain.
  • Generate keypair on your server. The CSR, derived from the public key, acts as a fingerprint.
  • Upload CSR to CA owned by registrar.
  • Registrar-CA issues certificate.
  • Use HTTP Public Key Pinning to ensure only your registrar can issue certificates.

In theory, there's another way:

  • Register domain.
  • Generate keypair on your server.
  • Add a self-signed certificate to your domain using a DANE TLSA record.
  • Sign your domain with DNSSEC.

But as I understand it, the big problem with DNSSEC right now is that the root zone is signed with only a 1024-bit key, and for this reason, browser makers are dragging their feet on recognizing DANE.

Comment Re:The real solution is simple. (Score 1) 88

The model you propose is called trust on first use (TOFU). TOFU is vulnerable to a man in the middle (MITM) on the first connection, but this can be worked around with the Perspectives add-on, which checks the server through multiple routes through the Internet to see if the certificate matches.

Comment Re:Ah yes... (Score 1) 104

I'm sure there's a third "security best practice" that's not being followed.

I bet one of the accounts on there is a test account for the developer to test with in production, and the username/password is the same as the password to the FTP server or to the DNS registry or some other important service.

Comment big.LITTLE, superscalar, or SMT? (Score 1) 53

Desktop (and to a lesser extent) laptop processors use multiple pipelines to improve performance and limit stalls

ARM chips have multiple cores, each with its own pipeline. In fact, ARM processors using a "big.LITTLE" microarchitecture have sets of performance-optimized and power-optimized cores for use during different power management states. Are you referring to "superscalar", in which the instruction decoder reorders multiple instructions from one thread to run them in one cycle? Or are you referring to simultaneous multithreading (SMT), where two instruction decoders, one on each thread, feed into a single set of execute units? Intel Atom uses SMT to hide stalls, as do recent AMD microarchitectures where the two cores in a "module" have their own integer execute units but share FPU and other resources.

Comment Re:This again? (Score 2) 356

> Assembly language usually normally contains conveniences ...

Minor quibble. FTFY.

On the Apple 2 computers you can use the mini-assembler built into ROM -- which IS the raw assembly it generates.

300: LDA $C000
  BPL $300
  STA $C010

The OP is ignorant of what assembly language even is.

Comment Re:This again? (Score 1) 356

Mod parent -1 incorrect.

> "Assembly" is not a programming language.

You keep using this phrase "not a programming language." It doesn't mean what you think it means. Methinks you need to review what a programming language IS because your definition is incomplete.

Your mistake is assuming "assembly language" refers to one canonical language. The truth is Assembly language refers to a family of languages.

As someone who still programs in 6502 assembly language (I work on an emulator in my spare time) then tell me my WHY does my Apple //e have a mini-assembler built into ROM if assembly is not a programming language??? The 6502 mnemonics are stored, compressed, in the ROM of ALL Apple 2 computers, along with a dis-assembler.

I could program in machine code (either decimal or hexadecimal):

300:AD 00 C0 10 FB 8D 10 C0 60

I could use the mini-assembler:

300: LDA $C000
  BPL $300
  STA $C010

Or I could use full canonical assembly

; Stupid /. unindents first line
  ORG $300

So yes, "Assembly" is a programming language. It comes in many flavors. There are even two flavors on x86: GCC assembly and Intel assembly.

Apostle Paul the Perverter, 1 Corinthians 11:14

Comment Re:Not sure you have a lot of options? (Score 1) 213

If you do a fresh install of Windows 7 these days? The update process is PAINFUL! You'll literally need to leave the PC downloading updates for a good 8-10 hours or more before it finally starts doing anything obvious.

That's why you slipstream updates into your installation image. Slipstreaming the various post-SP1 patch rollups as they're released will slash your installation time significantly, and there are only a relative handful of them at this point.

The only thing slipstreaming doesn't cover is updates to the .NET Framework. For whatever reason, they're not provided in a compatible format, but only as installer .exes. RT Seven Lite, however, will create an image that will run these installers (or others) in a post-Win7-installation step. It also facilitates slipstreaming the other updates, so it's useful to have on hand.

Comment Re:"Shitposting" is fraud, not speech (Score 1) 633

Just like people have the free speech rights to use racial epithets, but are expected to politely refrain from doing so. Yes. There are a lot of things like that, where people can choose to do evil. When they aren't evil people, we expect them not to do that.

Do you want to live in a society where everyone goes ahead and does every evil thing they think they can get away with? Because I'd rather live in a society where we try to be good to each other instead.

Submission + - New formula massively reduces prime number memory requirements.

grcumb writes: Peruvian mathematician Harald Helfgott made his mark on the history of mathematics by solving Goldbach's Weak Conjecture, which every odd number greater than 5 can be expressed as the sum of three prime numbers. Now, according to Scientific American, he's found a better solution to the Sieve of Erasthones:

In order to determine with this sieve all primes between 1 and 100, for example, one has to write down the list of numbers in numerical order and start crossing them out in a certain order: first, the multiples of 2 (except the 2); then, the multiples of 3, except the 3; and so on, starting by the next number that had not been crossed out. The numbers that survive this procedure will be the primes. The method can be formulated as an algorithm.

But now, Helfgott has found a method to drastically reduce the amount of RAM required to run the algorithm:

Helfgott was able to modify the sieve of Eratosthenes to work with less physical memory space. In mathematical terms: instead of needing a space N, now it is enough to have the cube root of N.

So what will be the impact of this? Will we see cheaper, lower-power encryption devices? Or maybe quicker cracking times in brute force attacks?

Slashdot Top Deals

Whenever people agree with me, I always think I must be wrong. - Oscar Wilde