• “The time needed to factor an RSA integer is the same order as the time needed to use that same integer as modulus for a single RSA encryption.   In other words, it takes no more time to break RSA on a quantum computer (up to a multiplicative constant) than to use it legitimately on a classical computer.”

    Professor Gilles Brassard,  "Quantum Information Processing: The Good, the Bad and the Ugly", 1997

    Read more...
  • “Consider the use of smart cards ... for especially critical functions.  Although more costly than software, when properly implemented the assurance gain is great.  The form-factor is not as important as the existence of an isolated processor and address space for assured operations – an ‘Island of Security,’ if you will.  Such devices can communicate with each other through secure protocols and provide a web of security connecting secure nodes located across a sea of insecurity in the global net.”

    Brian Snow, Former Technical Director of the US National Security Agency (NSA), "We need assurance!", 1999-2008

    Read more...
  • "But conventional security is not enough. The complexity of today's operational environment means organisations must embrace a level of business resilience that is normally associated with the protection of critical national infrastructure."

    Detica, a BAE Systems Company

    Read more...
Home Resources Security bibliography Symmetric key exchange protocols bibliography: Cryptographic coding for data bank privacy
bibliography: Cryptographic coding for data bank privacy
Authors: Horst Feistel
Organisation:
Date: 1970
Keywords: symmetric key exchange
Electronic Publication:
Citation: Horst Feistel, “Cryptographic coding for data bank privacy”. Res. Rep. RC2827, IBM T.J. Watson Res. Ctr., Yorktown Heights, N.Y., March 1970.
Notes: "If a conventional algorithm is used then each principal has a secret key that is known only to itself and to its authentication server, the contents of which are accordingly secret. The essential step in setting up secure communication between A and B is for the initiator, say A, to generate a message with two properties: (a) It must be comprehensible only to B, i.e. allow only B to use its contents to identify himself to A. (b) It must be evident to B that it originated with A. The use of encryption to achieve these properties was first described by Feistel [this paper] and applied to a network context by Branstad." - published in: Using encryption for authentication in large networks of computers
Related work:

Last Updated on Sunday, 04 January 2009 11:05