Filters








1,172 Hits in 0.6 sec

Crypto Topics and Applications I [chapter]

Jennifer Seberry, Chris Charnes, Josef Pieprzyk, Rei Safavi-Naini
2009 Algorithms and Theory of Computation Handbook, Second Edition, Volume 2  
Further Information Current research in cryptology is represented in the proceedings of the conferences CRYPTO, EUROCRYPT, ASIACRYPT, and AUSCRYPT.  ...  The International Association for Cryptologic Research ePrint Server (http://eprint.iacr.org) is a source of electronically distributed  ...  Hashing functions have numerous applications in cryptology.  ... 
doi:10.1201/9781584888215-c12 fatcat:ccxkmjxrdrabpfdot2ziszmgfe

Crypto Topics and Applications I [chapter]

Jennifer Seberry, Chris Charnes, Josef Pieprzyk, Rei Safavi-Naini
1998 Algorithms and Theory of Computation Handbook  
Further Information Current research in cryptology is represented in the proceedings of the conferences CRYPTO, EUROCRYPT, ASIACRYPT, and AUSCRYPT.  ...  The International Association for Cryptologic Research ePrint Server (http://eprint.iacr.org) is a source of electronically distributed  ...  Hashing functions have numerous applications in cryptology.  ... 
doi:10.1201/9781420049503-c41 fatcat:t7ax3ugmfngrpc7hc3i3ak7yu4

Crypto-Stego Technique for Secure Data Transmission

Homer Benny Bandela, M. Ganesh Babu, Donavalli Venkata Vidya Deepthi
2019 Journal of Physics, Conference Series  
Figure 18 : 18 Background International conference on computer vision and machine learning IOP Conf. Series: Journal of Physics: Conf.  ...  Figure 1 : 1 Safe or Unsafe Network International conference on computer vision and machine learning IOP Conf. Series: Journal of Physics: Conf.  ... 
doi:10.1088/1742-6596/1228/1/012012 fatcat:7gjrcs3qa5dwnbbg5ms5mhf6ey

Research Intuitions of Asymmetric Crypto System

Rojasree V. Et. al.
2021 Turkish Journal of Computer and Mathematics Education  
The areas of risks are attended and assured to be safe by means of some sought of crypto mechanisms. The strength and vulnerability of the crypto mechanism defines the durability of the system.  ...  Research in quantum computers is booming now and it is anticipated that the supremacy of quantum computers will crack the present public key crypto algorithms.  ...  In the proceedings of Advances in Cryptology -CRYPTO '96.  ... 
doi:10.17762/turcomat.v12i3.2016 fatcat:wtuw4sszjrhcnk6tyowpm27xr4

A Partenio's Stegano-Crypto Cipher

Paolo Bonavoglia
2020 Proceedings of the 3rd International Conference on Historical Cryptology HistoCrypt 2020   unpublished
English: Things are settled.Proceedings of the 3rd International Conference on Historical Cryptology, HistoCrypt 2020 Proceedings of the 3rd International Conference on Historical Cryptology, HistoCrypt  ...  See (Pasini, 1872) .Proceedings of the 3rd International Conference on Historical Cryptology, HistoCrypt 2020 Most Serene Prince, do not be surprised if you do not receive my letters, because if I  ... 
doi:10.3384/ecp2020171006 fatcat:qctqvqiu3vgctcfweawj4opzdm

Dynamic Crypto Algorithm for Real-Time Applications DCA-RTA, Key Shifting

Ahmad H.
2016 International Journal of Advanced Computer Science and Applications  
The need for fast and attack resistance crypto algorithm is challenging issue in the era of the revolution in the information and communication technologies.  ...  The previous works presented by the authors "Dynamic Crypto Algorithm for Real-Time Applications DCA_RTA", still need more enhancements to bring up the DCA_RTA into acceptable security level.  ...  Cryptology is the science that aims to provide information security in the digital environment. Cryptology details can be found in the Handbook of Applied Cryptography by [5] .  ... 
doi:10.14569/ijacsa.2016.070110 fatcat:s6e6fozqb5duxlmqwx23brjcoq

Side-Channel Resistant Crypto for Less than 2,300 GE

Axel Poschmann, Amir Moradi, Khoongming Khoo, Chu-Wee Lim, Huaxiong Wang, San Ling
2010 Journal of Cryptology  
International conference in information security and cryptology. Lecture notes in computer science, vol. 5461, pp. 218-234, Springer, Berlin, 2008).  ...  International conference in information and communications security. Lecture notes in computer science, vol. 4307, pp. 529-545, Springer, Berlin, 2006).  ...  The crypto core FPGA on SASEBO consists of an XC2VP7 Virtex-II Pro (Package FG456 with speed grade-5) from Xilinx [46] .  ... 
doi:10.1007/s00145-010-9086-6 fatcat:ckvgw2qaangenfxhnvw62og6hi

Batch RSA [chapter]

Amos Fiat
Advances in Cryptology — CRYPTO' 89 Proceedings  
At every internal node, take the recursive result from the left branch (L), raise it to the power ER where ER is the product of the labels associated with leaves on the right branch.  ... 
doi:10.1007/0-387-34805-0_17 dblp:conf/crypto/Fiat89 fatcat:dpydqna2mrb3dkfwynaib27rxe

The Smart Diskette A Universal User Token and Personal Crypto-Engine [chapter]

Paul Barrett, Raymond Eisele
Advances in Cryptology — CRYPTO' 89 Proceedings  
Brassard (Ed.): Advances in Cryptology -CRYPT0 '89, LNCS 435, PP. 74-79, 1990. Springer-Verlag Berlin Heidelberg 1990  ...  This implies a small size, a method for self-powering, programmability for multiple applications, fast RSA 151 [ 6 1 processing to implement digital signatures and crypto-key management, tamper-resistance  ... 
doi:10.1007/0-387-34805-0_8 dblp:conf/crypto/BarrettE89 fatcat:4fz5tfhhcfefxo47uhwkb6pg6i

Some Public-Key Crypto-Functions as Intractable as Factorization [chapter]

H. C. Williams
Advances in Cryptology  
.): Advances in Cryptology -CRYPT0 '84, LNCS 196, pp. 66-70, 1985. 0 Springer-Verlag Berlin Heidelberg 1985 the functions Xn and Yn, defined by -Here a = W -W2 and we easily see that 1 an = Xn(W1,W2) i  ... 
doi:10.1007/3-540-39568-7_7 dblp:conf/crypto/Williams84 fatcat:kpyokz6lvvgalh5becrpkdqcju

Secure Computation [chapter]

Silvio Micali, Phillip Rogaway
Advances in Cryptology — CRYPTO '91  
We define what it means for a network of communicating players to securely colnpute a function of privately held inputs, Intuitively, we wish to correcfly compute its value in a manner which protects tlie pnvacy of cacli player's contribution, even though a powerful adversary may endeavor to disrupt tliis enterprlse. This highly general and desirable goal has been around a long time, inspiring a large body protocols, definitions. and ideas, starting will1 Yao [1982, 19661 and Goldreich, hlicali
more » ... Goldreich, hlicali and Wigderson [1087]. But all the while, it had resisted a full and satisfactory formulation. Our definition is built on several new ideas. Among them: Closely mimicking an Ideal eualuatzon. A securt proLoco1 must mimic this abstraction in a run-by-run manner, our definition depending as much on individual executions as on global properties of ensembles. Blending privacy and correctness i n a novel way, using a special iype of simulator designed for the purpose. Requiring adversanal awareness-capturing the idea that the adversary should know, in a very strong sense, certain information associated to the execution of a protocol. Among the noteworthy and desirable properties of our definition is tlie reducibilify of secure protocols, which we believe to be a cornerstone in a mature theory of secure computation. Invocation The last decade has witnessed the rise of secure computation as a new and exciting mathematical subject. This is t h e study of communication protocols allowing several parties to perform a correct computation on some inputs that are and should be kept private. As a simple example, t h e parties want to compute the tally of some privately held votes. This new discipline is extremely subtle, involving in novel ways fundamental concepts such as probabilism, information, and complexity theory. In the making of a new science, finding tlic right definitions can b e one of the most dincult tasks: from relatively few examples, one should handle cases t h a t have not yet arisen and reach the highest possible level of generality. It is the purpose of this work Loth t o identify t h e right notion of secure computation and prove the right fundamental properties about it. In the last few years, cryptography has been very successful in identifying its basic objectives, properly defining them, and successfully solving them. Secure encryption, secure pseudorandom generation, secure digital signatures, and zero-knowledge proofs-concepts that appeared forever clusiv-have all found successful formalizations and solutioi,;. But in contrast to these successes,
doi:10.1007/3-540-46766-1_32 dblp:conf/crypto/MicaliR91 fatcat:uep2gv7egnedzid7blwyqw6xzy

Broadcast Encryption [chapter]

Amos Fiat, Moni Naor
Advances in Cryptology — CRYPTO' 93  
We introduce new theoretical measures for the qualitative and quantitative assessment of encryption schemes designed for broadcast transmissions. The goal is to allow a central broadcast site to broadcast secure transmissions to an arbitrary set of recipients while minimizing key management related transmissions. We present several schemes that allow a center to broadcast a secret to any subset of privileged users out of a universe of size n so that coalitions of k users not in the privileged
more » ... in the privileged set cannot learn the secret. The most interesting scheme requires every user to store O( k log k log n) keys and the center to broadcast O(k2 log' k log n) messages regardless of the size of the privileged set. This scheme is resilient to any coalition of k users. We also present a scheme that is resilient with probability p against a random subset of k users. This scheme requires every user to store O(1og k log(l/p)) keys and the center to broadcast O(k log2 k log( l/p)) messages.
doi:10.1007/3-540-48329-2_40 dblp:conf/crypto/FiatN93 fatcat:nfiadndhpbehbil3fmfgjqw5tu

Partially-bent functions [chapter]

C. Carlet
Advances in Cryptology — CRYPTO' 92  
Preneel in [6] and at Las Ve- gas Conference on Finite Fields (which characterize the functions for which equa1it.y holds) are false : Proposition 3.2 . .  ...  At L a s Vegas Conference on Finite Fields, they changed t,he second part of their conjecture in : "equality holds only for functions of order 2 or satisfying P C ( n ) ( n even) or such that :Vf = 2"  ... 
doi:10.1007/3-540-48071-4_19 dblp:conf/crypto/Carlet92 fatcat:gx6xb535gzbubdt52itfc6fvue

Kid Krypto [chapter]

Michael Fellows, Neal Koblitz
Advances in Cryptology — CRYPTO' 92  
There is no sharp line between Kid Krypto and adult crypto, so it would be unwise for US to belittle the former.  ...  In the second place, developing countries (and international science development organizations such as the Kovalevskaza Fund ) have a special interest in the possibility of enhancing math and computer  ... 
doi:10.1007/3-540-48071-4_27 dblp:conf/crypto/FellowsK92 fatcat:i32kfezh6reuthhju3k2miugca

Public Key Registration [chapter]

Stephen M. Matyas
Advances in Cryptology — CRYPTO' 86  
.): Advances in Cryptology -CRYPT0 '86, LNCS 263, pp. 451-458, 1987. l l ' s t e c h n i q u e . t h e k e y v a l i d a t i o n i n f o r m a t i o n i s e x c h a n g e d v i a l e t t e r u s i n g  ... 
doi:10.1007/3-540-47721-7_33 dblp:conf/crypto/Matyas86 fatcat:pll4lrxuwjh4tm2kj3dgx7f3oy
« Previous Showing results 1 — 15 out of 1,172 results