We present a new signature scheme which is existentially unforgeable under chosen message attacks, assuming some variant of the RSA conjecture. This scheme is not based on "signature trees", and instead it uses the so called "hash-and-sign" paradigm. It is unique in that the assumptions made on the cryptographic hash function in use are well defined and reasonable (although non-standard). In particular, we do not model this function as a random oracle.

We construct our proof of security in steps. First we describe and prove a construction which operates in the random oracle model. Then we show that the random oracle in this construction can be replaced by a hash function which satisfies some strong (but well defined!) computational assumptions. Finally, we demonstrate that these assumptions are reasonable, by proving that a function satisfying them exists under standard intractability assumptions.

Secure Hash-and-Sign Signatures without the Random Oracle.

The paper presents a new statistical bias in the distribution of the first two output bytes of the RC4 keystream generator The number of outputs required to reliably distinguish RC4 outputs from random strings using this bias is only 2 25 bytes Most importantly, the bias does not disappear even if the initial 256 bytes are dropped This paper also proposes a new pseudorandom bit generator, named RC4A, which is based on RC4's exchange shuffle model It is shown that the new cipher offers increased resistance against most attacks that apply to RC4 RC4A uses fewer operations per output byte and offers the prospect of implementations that can exploit its inherent parallelism to improve its performance further

https://lirias.kuleuven.be/bitstream/123456789/70915/1/article-40.pdf

A new weakness in the RC4 keystream generator and an approach to improve the security of the Cipher

The standard technique to attack triple encryption is the meet-in-the-middle attack which requires 2 112 encryption steps. In this paper, more efficient attacks are presented. One of our attacks reduces the overall number of steps to roughly 2 108 . Other attacks optimize the number of encryptions at the cost of increasing the number of other operations. It is possible to break triple DES doing 2 90 single encryptions and no more than 2 113 faster operations.

Attacking triple encryption

In February 2000 the NESSIE project has launched an open call for the next generation of cryptographic algorithms. These algorithms should offer a higher security and/or confidence level than existing ones, and should be better suited for the constraints of future hardware and software environments. The NESSIE project has received 39 algorithms, many of these from major players. In October 2001, the project completed the first phase of the evaluation and has selected 24 algorithms for the second phase. The goal is to recommend a complete portfolio of algorithms by the end of 2002. This article presents the status of the NESSIE project after two years.

/pdf/new-european-schemes-for-signature-integrity-and-encryption-45lxbg5zn4.pdf

New European Schemes for Signature, Integrity and Encryption (NESSIE): A Status Report

Two ways of mounting distinguishing attacks on two similar stream ciphers, SOBER-t16 and SOBER-t32, are proposed It results in distinguishing attacks faster than exhaustive key search on full SOBER-t16 and on SOBER-t32 without stuttering

Distinguishing attacks on SOBER-t16 and t32

NESSIE security report y

NESSIE Phase I: Selection of Primitives †

Security Evaluation of NESSIE First Phase y

Popular Tasks used by Researchers

How can I help with your research?

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

We encountered an error while loading the panel. Please try refreshing the page.

Something went wrong

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

Anyone with the link can view this chat. You can switch it back to private anytime.

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

S. Murphy

Author Tools

Chat about Author

Papers

NESSIE security report y

NESSIE Phase I: Selection of Primitives †

Security Evaluation of NESSIE First Phase y