نتایج جستجو برای: cryptology

تعداد نتایج: 644  

2016
François-Xavier Standaert

. In Moni Naor, editor, Theory of Cryptography, First Theory of Cryp-tography Conference, TCC 2004, Cambridge, MA, USA, February 19-21, 2004,Proceedings, volume 2951 of Lecture Notes in Computer Science, pages 278–296.Springer, 2004.55. Andrew Moss, Elisabeth Oswald, Dan Page, and Michael Tunstall. Compiler assisted masking. In Prouff and Schaumont [66], pages 58–75.56. Moni...

2010
Yana Kortsarts Yulia Kempner

We present our experience integrating MerkleHellman knapsack cryptosystem into undergraduate computer science curriculum. The paper focuses on the additive knapsack and ways to integrate it into the following undergraduate computer science courses: introduction to computer science, cryptology, and analysis of algorithms. Ideas for undergraduate student projects are presented and discussed.

2004
BETTINA EICK

We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.

Journal: :Des. Codes Cryptography 2012
Arrigo Bonisoli James W. P. Hirschfeld Spyros S. Magliveras

This issue of the journal is devoted to the themes of Geometry, Combinatorial Designs and Cryptology. The guest editors selected sixteen contributions covering various areas within these themes, ranging from public-key cryptography to matters related to key distribution and authentication, from problems in graph theory to resolvability issues in designs, from finite projective planes to higher-...

2000
Ross Anderson

In 1996, Adam Back floated the idea of a public key cryptosystem with a series of public keys pi and secret keys si that stand in the usual relationship with each other but for which there are updating functions fi and gi such that pi+1 = fi(pi) and si+1 = gi(si) [2]. In this way a single root public key p0 could be certified, and thereafter the key owner could regularly calculate si+1 and dest...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2010
Yehuda Lindell

In this note, we show the existence of constant-round computational zero-knowledge proofs of knowledge for all NP. The existence of constant-round zero-knowledge proofs was proven by Goldreich and Kahan (Journal of Cryptology, 1996), and the existence of constant-round zeroknowledge arguments of knowledge was proven by Feige and Shamir (CRYPTO 1989). Although it is widely believed that there ex...

Journal: :Fundam. Inform. 2010
Mona Khare Surabhi Tiwari

The present paper is devoted to the study of grill determinedL-approach merotopological spaces. The category having such spaces as objects is shown to be a topological construct (its initial and final structures are provided explicitly). The lattice structure of the family of all these spaces is also discussed. In the classical theory, this category (that is, when L = {0, 1}) is a supercategory...

2008
David Wilson Stanley Ng

"Home Plate", a combination bar, grill, and recreation center, is an 8000 ft2 single-story slab-ongrade building with a partial basement. Radon testing of each ground-contact room found elevated radon levels in seven of eight rooms (5.6 pCi/L to 13.4 pCi/L). Mitigation diagnostics determined that the installation of three active soil depressurization (ASD) systems would reduce the levels to <4 ...

2012
Douglas P. Wiens Pengfei Li

We give a description of the steps leading to a robustification of a dose–response study. The original experiment was designed and described by Rosenberger and Grill (1997) and has since been discussed by several other groups of researchers. Our robustification consists of redesigning the experiment so as to build in flexibility over a range of possible link functions, including the logistic li...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید