×

Found 355 Documents (Results 1–100)

Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields. (English) Zbl 07722924

Batina, Lejla (ed.) et al., Security, privacy, and applied cryptography engineering. 12th international conference, SPACE 2022, Jaipur, India, December 9–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13783, 138-146 (2022).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Light but tight: lightweight composition of serialized S-boxes with diffusion layers for strong ciphers. (English) Zbl 07722918

Batina, Lejla (ed.) et al., Security, privacy, and applied cryptography engineering. 12th international conference, SPACE 2022, Jaipur, India, December 9–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13783, 28-49 (2022).
MSC:  94A60 68M11 68Q80
PDFBibTeX XMLCite
Full Text: DOI

Lower bounds for monotone arithmetic circuits via communication complexity. (English) Zbl 07765210

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 786-799 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Equivalence testing of weighted automata over partially commutative monoids. (English) Zbl 07724183

Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 10, 15 p. (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

A special case of rational identity testing and the Brešar-Klep theorem. (English) Zbl 07559381

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 10, 14 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Fault template attacks on block ciphers exploiting fault propagation. (English) Zbl 1479.94251

Canteaut, Anne (ed.) et al., Advances in cryptology – EUROCRYPT 2020. 39th annual international conference on the theory and applications of cryptographic techniques, Zagreb, Croatia, May 10–14, 2020. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12105, 612-643 (2020).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI Link

Algorithms in machine learning paradigms. (English) Zbl 1465.68026

Studies in Computational Intelligence 870. Singapore: Springer (ISBN 978-981-15-1040-3/hbk; 978-981-15-1043-4/pbk; 978-981-15-1041-0/ebook). x, 195 p. (2020).
MSC:  68-06 68T05 00B15
PDFBibTeX XMLCite
Full Text: DOI

Fast exact algorithms using Hadamard product of polynomials. (English) Zbl 1518.68145

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 9, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On explicit branching programs for the rectangular determinant and permanent polynomials. (English) Zbl 07650271

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 38, 13 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Efficient black-box identity testing for free group algebras. (English) Zbl 07650124

Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 57, 16 p. (2019).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Function private predicate encryption for low min-entropy predicates. (English) Zbl 1509.94126

Lin, Dongdai (ed.) et al., Public-key cryptography – PKC 2019. 22nd IACR international conference on practice and theory of public-key cryptography, Beijing, China, April 14–17, 2019. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 11443, 189-219 (2019).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Template-based fault injection analysis of block ciphers. (English) Zbl 1525.94039

Chattopadhyay, Anupam (ed.) et al., Security, privacy, and applied cryptography engineering. 8th international conference, SPACE 2018, Kanpur, India, December 15–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11348, 21-36 (2018).
MSC:  94A60 94A62
PDFBibTeX XMLCite
Full Text: DOI

Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm. (English) Zbl 07561389

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 35, 13 p. (2018).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Univariate ideal membership parameterized by rank, degree, and number of generators. (English) Zbl 1528.68147

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 7, 18 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

A composition theorem for randomized query complexity. (English) Zbl 1491.68082

Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 10, 13 p. (2018).
MSC:  68Q25 68Q10 68Q11
PDFBibTeX XMLCite
Full Text: DOI arXiv

Feature selection using multi-objective optimization technique for supervised cancer classification. (English) Zbl 1409.90163

Mandal, Jyotsna K. (ed.) et al., Multi-objective optimization. Evolutionary to hybrid framework. Singapore: Springer. 195-213 (2018).
MSC:  90C29 62H30
PDFBibTeX XMLCite
Full Text: DOI

On characterization and decomposition of isothetic distance functions for 2-manifolds. (English) Zbl 1486.68203

Brimkov, Valentin E. (ed.) et al., Combinatorial image analysis. 18th international workshop, IWCIA 2017, Plovdiv, Bulgaria, June 19–21, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10256, 212-225 (2017).
MSC:  68U05 68U03
PDFBibTeX XMLCite
Full Text: DOI

Efficient identity testing and polynomial factorization in nonassociative free rings. (English) Zbl 1441.68299

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 38, 13 p. (2017).
MSC:  68W30 17A50 68Q06
PDFBibTeX XMLCite
Full Text: DOI arXiv

Lower bounds for elimination via weak regularity. (English) Zbl 1402.68072

Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 21, 14 p. (2017).
MSC:  68Q17 68Q10 68W20
PDFBibTeX XMLCite
Full Text: DOI

Randomized polynomial time identity testing for noncommutative circuits. (English) Zbl 1369.68347

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 831-841 (2017).
MSC:  68W20 68Q05 68Q25 68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation. (English) Zbl 1400.94139

Fehr, Serge (ed.), Public-key cryptography – PKC 2017. 20th IACR international conference on practice and theory in public-key cryptography, Amsterdam, The Netherlands, March 28–31, 2017. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-54387-0/pbk; 978-3-662-54388-7/ebook). Lecture Notes in Computer Science 10175, 463-493 (2017).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Estimation of a finite population variance under linear models for randomized response designs. (English) Zbl 1365.62040

Chaudhuri, Arijit (ed.) et al., Data gathering, analysis and protection of privacy through randomized response techniques: qualitative and quantitative human traits. Amsterdam: Elsevier/North Holland (ISBN 978-0-444-63570-9/hbk; 978-0-444-63571-6/ebook). Handbook of Statistics 34, 221-231 (2016).
MSC:  62D05 62J05
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software