525 Hits in 7.3 sec

Algorithms for Black-Box Fields and their Application to Cryptography [chapter]

Dan Boneh, Richard J. Lipton
1996 Lecture Notes in Computer Science  
One may view this result as a general cryptanalytic t,ool: to show that a cryptosysteni can be broken in subexponential time it suffices to show that it is algebraically homomorphic.  ...  They show that for the group G = Z/pZ the best, algorithm for finding a hidden element must t,ake time R( m). Sub-exponential algorithrns for BBFP have several consequences t o cryptography.  ...  Acknowledgments The authors wish to thank IJeli Maurer and Stefan Wolf for hclpful comments on this manuscript.  ... 
doi:10.1007/3-540-68697-5_22 fatcat:b3bhtsan7bay3m4ks5yssarbsi

Page 2737 of Mathematical Reviews Vol. , Issue 2004c [page]

2004 Mathematical Reviews  
Addenda: “An inequality of M. Radulescu and S.  ...  nonlinear problems with applications in engineering, economics and physics * 65046 Introduction to the geometry and topology of fluid flows * 00017 IUTAM Symposium: Computational Mechanics of Solid Materials  ... 

McNie: A code-based public-key cryptosystem [article]

Jon-Lark Kim, Young-Sik Kim, Lucky Galvez, Myeong Jae Kim, Nari Lee
2019 arXiv   pre-print
McNie is a hybrid version of the McEliece and Niederreiter cryptosystems and its security is reduced to the hard problem of syndrome decoding.  ...  The public key involves a random generator matrix which is also used to mask the code used in the secret key. This makes the system safer against known structural attacks.  ...  Sendrier, N.: On the concatenated structure of a linear code. Applicable Algebra in Engineering, Communication and Computing 9(3), pp. 221–242 (1998) 40.  ... 
arXiv:1812.05008v2 fatcat:wsagwr4tofd3fdn2cxpp3vogte

Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures [chapter]

Daniele Nantes Sobrinho, Mauricio Ayala-Rincón
2010 Lecture Notes in Computer Science  
The algebraic properties of the protocol are modeled by an equational theory implemented as a convergent rewriting system which involves rules for addition, multiplication and exponentiation.  ...  It is proved that the associative-commutative (AC) equality of the algebraic theory can be decided in polynomial time, provided a strategy to avoid distributivity law between the AC operators is adopted  ...  If M and N are quasi-EP terms F EP (M ) * → R EP F EP (N ), then M * → R EP N . Proof (Sketch). The proof follows by induction on the structure of M .  ... 
doi:10.1007/978-3-642-13824-9_18 fatcat:hnkrxv6ckbe2tdbncinns3ecya

An analytical survey on the role of image cryptography and related computational methods

Vivek Ranjan, Kailash Patidar, Rishi Kushwaha
2020 International Journal of Advanced Computer Research  
Conflicts of interest The authors have no conflicts of interest to declare.  ...  To explore the applicability of hybridization of cryptography and steganography. 4. To analyses the impact and influence of different methods applied.  ...  Encryption and decryption procedure can be applied based on the nature of key applicability. It can be categorized as public key cryptography and private key cryptography [4] .  ... 
doi:10.19101/ijacr.2020.10480104 fatcat:4gray5ozz5fefarsw3hwczwsci

Equivalence of DES and AES Algorithm with Cellular Automata

Sambhu Prasad Panda, Madhusmita Sahu, Umesh Prasad Rout, Surendra Kumar Nanda
2011 International Journal of Communication Networks and Security  
DES and AES are equivalent to non linear cellular automata rules providing the confusion property of cryptography.  ...  In this paper we present the equivalence of the operations involved in DES and AES algorithm with operations of cellular automata.  ...  All these works were based on Boolean functions and its applications in cellular automata in cryptography in stream cipher.  ... 
doi:10.47893/ijcns.2011.1008 fatcat:2l7jd3mgwvf4pjnfclo7kdfeeq

Page 4184 of Mathematical Reviews Vol. , Issue 2001F [page]

2001 Mathematical Reviews  
Goldreich, Modern cryptography, probabilistic proofs and pseudorandomness, Springer, Berlin, 1999; MR 2000f:94029] survey some applications to data structures, algorithm design, cryptography and complexity  ...  A beautiful theory has emerged to prove such results, and a number of important ap- plications have arisen, most notably to cryptography and to the theory of approximation algorithms.  ... 

Application of elliptic curve cryptography on data encryption over a network

G.D Bibu, S Angai
2010 Science World Journal  
CONCLUSION The climax of the work is the design and implementation of data security over a network through the use of elliptic curve cryptography, which is a very strong tool that can be implored to achieve  ...  the human eye, this is because data is encrypted only while in transit, existing as plaintext on the originating and receiving hosts.  ...  Elliptic curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields.  ... 
doi:10.4314/swj.v3i4.51822 fatcat:vdavqd3gzzhphanl7oqy3wkngm

An Approach to Secure Data Aggregation in Wireless Sensor Networks (WSN) using Asymmetric Homomorphic Encryption (Elliptic Curve Cryptography) Scheme

Md Sirajul Huque, Sk. Bhadar Saheb, Jayaram Boga
2017 International Journal of Advanced Research in Computer Science and Software Engineering  
Elliptic curve cryptography (ECC) [1] is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields.  ...  The proposed technique of secure data aggregation is used to improve the sensor network lifetime and to reduce the energy consumption during aggregation process.  ...  Two cipher texts will be generated let it be C1 and C2. C1 = k*P C2 = M + k*Q C1 and C2 will be send. Decryption We have to get back the message "m" that was send to us, VI.  ... 
doi:10.23956/ijarcsse/v7i7/0162 fatcat:ggbcikgtrvb57agmbhnj5w6chu

Counting Techniques Specifying the Existence of Submatrices in Weighing Matrices [chapter]

C. Kravvaritis, M. Mitrouli, Jennifer Seberry
2005 Lecture Notes in Computer Science  
Two algorithmic techniques for specifying the existence of a k × k submatrix with elements 0, ±1 in a skew and symmetric conference matrix of order n are described.  ...  This specification is achieved using an appropriate computer algebra system.  ...  In Step 4 is formulated a Distribution type Lemma, which gives the number of several columns appearing in a weighing matrix and will allow us to obtain bounds on the column structure of a weighing matrix  ... 
doi:10.1007/11555964_25 fatcat:jhifa3a6kzddzgouyworq3uxua

Separable Reversible Data Hiding Scheme in Homomorphic Encrypted Domain Based on NTRU

Neng Zhou, Minqing Zhang, Han Wang, Yan Ke, Fuqiang Di
2020 IEEE Access  
cryptography and information hiding technology, and design secure and efficient reversible information hiding methods.  ...  Through excavation and effective use of redundancy in the encryption process, we compromise the information hiding technology and encryption technology, construct the theoretical model of the fusion of  ...  Though the stream cipher encrypts the image into unreadable encrypted data, it will destroy the algebraic structure of the encrypted data.  ... 
doi:10.1109/access.2020.2990903 fatcat:a4wjqg3obffelhskh3ubmuvl5i

A code-based hybrid signcryption scheme [article]

Jean Belo Klamti, M. Anwar Hasan
2021 arXiv   pre-print
The proposed scheme uses an equivalent subcode as a public code for the receiver, making the NP-completeness of the equivalent subcode problem be one of our main security assumptions.  ...  We give security analyses of both our schemes in the standard model and prove that they are secure against IND-CCA2 (indistinguishability under adaptive chosen ciphertext attack) and SUF-CMA (strong existential  ...  Couvreur, “An efficient structural attack on nist submission dags,” in International Conference on the Theory and Application of Cryptology and Information Security.  ... 
arXiv:2112.07130v1 fatcat:mxx3zwiax5hgticy4llun2pepa

Fast Hybrid Cryptosystem for Enhancing Cloud Data Security Using Elliptic Curve Cryptography and DNA Computing

Souad Hafidi, Fatima Amounas, Lahcen El Bermi, Moha Hajar
2020 International Journal of Scientific Research in Science Engineering and Technology  
Many researchers have tried to exploit the features of ECC field for security applications.  ...  This paper investigates how the integrity and secure data transfer are improved based on the Elliptic Curve cryptography and DNA computing.  ...  defined over finite fields on the basis of algebraic structures of the elliptic curves [11] .  ... 
doi:10.32628/ijsrset207264 fatcat:vm37rwlabjejjgaszfoutddwai

Page 10573 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
This formula is highly structured and far simpler than algebraic formulations of any other block cipher we know.  ...  Both proposed schemes use O(k) bits to commit to one bit and can be based on the existence of trapdoor commitments and non-malleable encryption.  ... 

RC4 Stream Cipher with a Random Initial State [chapter]

Maytham M. Hammood, Kenji Yoshigoe, Ali M. Sagheer
2013 Lecture Notes in Electrical Engineering  
Rivest Cipher 4 (RC4) is one of the modern encryption techniques utilized in many real time security applications; however, it has several weaknesses including a correlation problem in the initially generated  ...  Moreover, RRC4's high resistivity protects against many attacks vulnerable to RC4 and solves several weaknesses of RC4 such as predictable first bytes of intermediate outputs by RC4.  ...  Acknowledgments This work is based in part, upon research supported by the National Science Foundation (under Grant Nos. CNS-0855248 and EPS-0918970). Any opinions, findings and  ... 
doi:10.1007/978-94-007-6996-0_42 fatcat:uehxe4s3svfrhkc22g377kigou
« Previous Showing results 1 — 15 out of 525 results