Jump to content
View in the app

A better way to browse. Learn more.

Tuts 4 You

A full-screen app on your home screen with push notifications, badges and more.

To install this app on iOS and iPadOS
  1. Tap the Share icon in Safari
  2. Scroll the menu and tap Add to Home Screen.
  3. Tap Add in the top-right corner.
To install this app on Android
  1. Tap the 3-dot menu (⋮) in the top-right corner of the browser.
  2. Tap Add to Home screen or Install app.
  3. Confirm by tapping Install.

Featured Replies

Posted

NTRUEncrypt Public Key Cryptosystem

NTRU is a public key cryptosystem that is considered unbreakable even with quantum computers. Commonly used cryptosystems like RSA or ECC, on the other hand, will be broken if and when quantum computers become available.

In addition, NTRU is significantly faster than other public-key cryptosystems.

NTRU consists of two algorithms: NTRUEncrypt for public-key encryption and NTRUSign for digital signatures. Both algorithms are implemented in Java.


/>http://en.wikipedia.org/wiki/NTRUEncrypt
/>http://sourceforge.net/projects/ntru/files/

Ted.

hmm, i think that mentioning quantum is just good marketing trick, as the word itself is really nice :). Today's 'quantum computer' developed by IBM can only multiply 5x3=15 (lol), but on atom level.

If one take in account billions and billions of atoms with which computer could calculate, i don't think any crypto will be safe, except quantum one (where observer disrupts function - dead cat experiment).

hmm, i think that mentioning quantum is just good marketing trick, as the word itself is really nice smile.gif. Today's 'quantum computer' developed by IBM can only multiply 5x3=15 (lol), but on atom level.

If one take in account billions and billions of atoms with which computer could calculate, i don't think any crypto will be safe, except quantum one (where observer disrupts function - dead cat experiment).

Actually it isn't known where the complexity class for a quantum computer is. It is believe to be a superset of P (Polynomial), which means it wouldn't be any better at NP problems. So a cryptography based on NP problems would be safe from quantum computers, if it is a strictly superset of P.

That is unless P = NP, which also isn't known.

Edited by patrcik

Create an account or sign in to comment

Configure browser push notifications

Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.