Search results for "bit-security"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
40	Oded Goldreich 0001	On the Number of Close-and-Equal Pairs of Bits in a String.	EUROCRYPT	1984	DBLP DOI BibTeX RDF	the RSA Scheme, Bit Security, Combinatorial Bounds, Bit-String Properties, Cryptography, Public Key Cryptosystems, Combinatorial Analysis
30	Ian F. Blake, Theodoulos Garefalakis, Igor E. Shparlinski	On the bit security of the Diffie-Hellman key.	Appl. Algebra Eng. Commun. Comput.	2006	DBLP DOI BibTeX RDF	Diffie-Hellman protocol, Bit security, Exponential sums
24	Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham	The Bit Security of Paillier's Encryption Scheme and Its Applications.	EUROCRYPT	2001	DBLP DOI BibTeX RDF
21	Kaushik Nath 0001, Palash Sarkar 0001	Security and efficiency trade-offs for elliptic curve Diffie-Hellman at the 128-bit and 224-bit security levels.	J. Cryptogr. Eng.	2022	DBLP DOI BibTeX RDF
20	Igor E. Shparlinski	On the Generalised Hidden Number Problem and Bit Security of XTR.	AAECC	2001	DBLP DOI BibTeX RDF
17	Sanjit Chatterjee, Palash Sarkar 0001	Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model.	ICISC	2005	DBLP DOI BibTeX RDF	parameter size, security, standard model, identity based encryption
17	Louis Granboulan	A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible.	Public Key Cryptography	2005	DBLP DOI BibTeX RDF
14	Paz Morillo, Carla Ràfols	The Security of All Bits Using List Decoding.	Public Key Cryptography	2009	DBLP DOI BibTeX RDF	bit security, one-way function, list decoding
14	Johan Håstad, Mats Näslund	The security of all RSA and discrete log bits.	J. ACM	2004	DBLP DOI BibTeX RDF	RSA-encryption, bit-security, complexity, Cryptography, discrete logarithms
14	Zahra Jeddi, Ahmed K. F. Khattab, Esmaeil Amini, Magdy A. Bayoumi	Redundant Bit Security in RFIDs: Architecture Design and Security Performance Evaluation.	J. Circuits Syst. Comput.	2017	DBLP DOI BibTeX RDF
14	Xavier Boyen	Miniature CCA2 PK Encryption: Tight Security Without Redundancy.	ASIACRYPT	2007	DBLP DOI BibTeX RDF
13	Matthew Henricksen	Tiny Dragon - An Encryption Algorithm for Wireless Sensor Networks.	HPCC	2008	DBLP DOI BibTeX RDF
13	Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham	Paillier's Trapdoor Function Hides up to O(n) Bits.	J. Cryptol.	2002	DBLP DOI BibTeX RDF
13	Côme Berbain, Olivier Billet, Anne Canteaut, Nicolas T. Courtois, Blandine Debraize, Henri Gilbert, Louis Goubin, Aline Gouget, Louis Granboulan, Cédric Lauradoux, Marine Minier, Thomas Pornin, Hervé Sibert	Decimv2.	The eSTREAM Finalists	2008	DBLP DOI BibTeX RDF
13	Alex Biryukov, Sourav Mukhopadhyay, Palash Sarkar 0001	Improved Time-Memory Trade-Offs with Multiple Data.	Selected Areas in Cryptography	2005	DBLP DOI BibTeX RDF	time/memory/data trade-off, key sizes, block-cipher
11	Léonard Dallot, Damien Vergnaud	Provably Secure Code-Based Threshold Ring Signatures.	IMACC	2009	DBLP DOI BibTeX RDF
11	Vitaly Kiryukhin	About "k-bit security" of MACs based on hash function Streebog.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
11	Shun Watanabe, Kenji Yasunaga	Bit-Security Preserving Hardness Amplification.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
11	Marcus de Ree, Georgios Mantas, Jonathan Rodriguez 0001	Bit Security Estimation for Leakage-Prone Key Establishment Schemes.	IEEE Commun. Lett.	2023	DBLP DOI BibTeX RDF
11	Ruiqi Mi, Haodong Jiang, Zhenfeng Zhang	Bit Security Analysis of Lattice-Based KEMs Under Plaintext-Checking Attacks.	SAC	2023	DBLP DOI BibTeX RDF
11	Shun Watanabe, Kenji Yasunaga	Unified View for Notions of Bit Security.	ASIACRYPT (6)	2023	DBLP DOI BibTeX RDF
11	Seyit Camtepe, Jarek Duda 0001, Arash Mahboubi, Pawel Morawiecki, Surya Nepal, Marcin Pawlowski 0004, Josef Pieprzyk	ANS-based compression and encryption with 128-bit security.	Int. J. Inf. Sec.	2022	DBLP DOI BibTeX RDF
11	Keewoo Lee	Bit Security as Cost to Observe Advantage: Towards the Definition from THE BOOK.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
11	M. Rajululkahf	BÄhÄ"m: A Symmetric Cipher with Provable 128-bit Security.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
11	Shun Watanabe, Kenji Yasunaga	Unified View for Notions of Bit Security.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
11	Zihao Song, Junichi Sakamoto, Shigeo Mitsunari, Naoki Yoshida, Riku Anzai, Tsutomu Matsumoto	Efficient Software Implementation of GMT6-672 and GMT8-542 Pairing-Friendly Curves for a 128-Bit Security Level.	ACNS Workshops	2022	DBLP DOI BibTeX RDF
11	Jinkyu Cho, Yongwoo Lee 0002, ZaHyun Koo, Jong-Seon No, Young-Sik Kim	Improving Key Size and Bit-Security of Modified pqsigRM.	ICTC	2022	DBLP DOI BibTeX RDF
11	Dong-Hoon Lee, Young-Sik Kim, Jong-Seon No	Bit Security Estimation Using Various Information-Theoretic Measures.	IEEE Access	2021	DBLP DOI BibTeX RDF
11	Seyit Camtepe, Jarek Duda 0001, Arash Mahboubi, Pawel Morawiecki, Surya Nepal, Marcin Pawlowski 0004, Josef Pieprzyk	ANS-based Compression and Encryption with 128-bit Security.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
11	Shun Watanabe, Kenji Yasunaga	Bit Security as Computational Cost for Winning Games with High Probability.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
11	Shun Watanabe, Kenji Yasunaga	Bit Security as Computational Cost for Winning Games with High Probability.	ASIACRYPT (3)	2021	DBLP DOI BibTeX RDF
11	Kaushik Nath 0001, Palash Sarkar 0001	Efficient elliptic curve Diffie-Hellman computation at the 256-bit security level.	IET Inf. Secur.	2020	DBLP DOI BibTeX RDF
11	Narcisse Bang Mbang, Diego de Freitas Aranha, Emmanuel Fouotsa	Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level.	Int. J. Appl. Cryptogr.	2020	DBLP DOI BibTeX RDF
11	Narcisse Bang Mbang, Emmanuel Fouotsa, Célestin Lélé	Parallel Computation of Optimal Ate Cryptographic Pairings at the 128, 192 and 256-bit security levels using elliptic net algorithm.	CoRR	2020	DBLP BibTeX RDF
11	Dong-Hoon Lee, Young-Sik Kim, Jong-Seon No	Bit Security Estimation Using Various Information-Theoretic Measures.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
11	Yusuke Naito 0001, Yu Sasaki, Takeshi Sugawara 0001	LM-DAE: Low-Memory Deterministic Authenticated Encryption for 128-bit Security.	IACR Trans. Symmetric Cryptol.	2020	DBLP DOI BibTeX RDF
11	Aurore Guillevic	A Short-List of Pairing-Friendly Curves Resistant to Special TNFS at the 128-Bit Security Level.	Public Key Cryptography (2)	2020	DBLP DOI BibTeX RDF
11	Kaushik Nath 0001, Palash Sarkar 0001	Efficient Elliptic Curve Diffie-Hellman Computation at the 256-bit Security Level.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
11	Aurore Guillevic	A short-list of STNFS-secure pairing-friendly curves at the 128-bit security level.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
11	Atil U. Ay, Cuauhtemoc Mancillas-López, Erdinç Öztürk, Francisco Rodríguez-Henríquez, Erkay Savas	Constant-time hardware computation of elliptic curve scalar multiplication around the 128 bit security level.	Microprocess. Microsystems	2018	DBLP DOI BibTeX RDF
11	Daniele Micciancio, Michael Walter 0001	On the Bit Security of Cryptographic Primitives.	IACR Cryptol. ePrint Arch.	2018	DBLP BibTeX RDF
11	Daniele Micciancio, Michael Walter 0001	On the Bit Security of Cryptographic Primitives.	EUROCRYPT (1)	2018	DBLP DOI BibTeX RDF
11	Md. Al-Amin Khandaker, Yuki Nanjo, Loubna Ghammam, Sylvain Duquesne, Yasuyuki Nogami, Yuta Kodera	Efficient Optimal Ate Pairing at 128-bit Security Level.	IACR Cryptol. ePrint Arch.	2017	DBLP BibTeX RDF
11	Yutaro Kiyomura, Akiko Inoue, Yuto Kawahara, Masaya Yasuda, Tsuyoshi Takagi, Tetsutaro Kobayashi	Secure and Efficient Pairing at 256-Bit Security Level.	ACNS	2017	DBLP DOI BibTeX RDF
11	Barak Shani	On the Bit Security of Elliptic Curve Diffie-Hellman.	Public Key Cryptography (1)	2017	DBLP DOI BibTeX RDF
11	Md. Al-Amin Khandaker, Yuki Nanjo, Loubna Ghammam, Sylvain Duquesne, Yasuyuki Nogami, Yuta Kodera	Efficient Optimal Ate Pairing at 128-Bit Security Level.	INDOCRYPT	2017	DBLP DOI BibTeX RDF
11	Fangguo Zhang	Bit Security of the Hyperelliptic Curves Diffie-Hellman Problem.	ProvSec	2017	DBLP DOI BibTeX RDF
11	Loubna Ghammam, Emmanuel Fouotsa	On the Computation of the Optimal Ate Pairing at the 192-bit Security Level.	IACR Cryptol. ePrint Arch.	2016	DBLP BibTeX RDF
11	Barak Shani	On the Bit Security of Elliptic Curve Diffie-Hellman.	IACR Cryptol. ePrint Arch.	2016	DBLP BibTeX RDF
11	Masahiro Ishii 0002, Atsuo Inomata, Kazutoshi Fujikawa	A Construction of a Twisted Ate Pairing on a Family of Kawazoe-Takahashi Curves at 192-bit Security Level and Its Cost Estimate.	ICISSP	2016	DBLP DOI BibTeX RDF
11	Fangguo Zhang	Bit Security of the Hyperelliptic Curves Diffie-Hellman Problem.	IACR Cryptol. ePrint Arch.	2015	DBLP BibTeX RDF
11	Mingqiang Wang, Tao Zhan, Haibin Zhang	Bit Security of the CDH Problems over Finite Fields.	SAC	2015	DBLP DOI BibTeX RDF
11	Dionathan Nakamura, Routo Terada	RSA and Elliptic Curve Least Significant Bit Security.	LATINCRYPT	2014	DBLP DOI BibTeX RDF
11	Si-Wei Ren, Ke-Wei Lu	Bit Security for Lucas-Based One-Way Function.	AsiaJCIS	2014	DBLP DOI BibTeX RDF
11	Marcin Rogawski, Kris Gaj, Ekawat Homsirikamol	A high-speed unified hardware architecture for 128 and 256-bit security levels of AES and the SHA-3 candidate Grøstl.	Microprocess. Microsystems	2013	DBLP DOI BibTeX RDF
11	Diego F. Aranha, Laura Fuentes-Castañeda, Edward Knapp, Alfred Menezes, Francisco Rodríguez-Henríquez	Implementing Pairings at the 192-bit Security Level.	IACR Cryptol. ePrint Arch.	2012	DBLP BibTeX RDF
11	Diego F. Aranha, Laura Fuentes-Castañeda, Edward Knapp, Alfred Menezes, Francisco Rodríguez-Henríquez	Implementing Pairings at the 192-Bit Security Level.	Pairing	2012	DBLP DOI BibTeX RDF
11	Zahra Jeddi, Esmaeil Amini, Magdy A. Bayoumi	RBS: Redundant Bit Security Algorithm for RFID Systems.	ICCCN	2012	DBLP DOI BibTeX RDF
11	Dongyoung Roh, Sang Geun Hahn	On the bit security of the weak Diffie-Hellman problem.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
11	Nicolas Estibals	Compact hardware for computing the Tate pairing over 128-bit-security supersingular curves.	IACR Cryptol. ePrint Arch.	2010	DBLP BibTeX RDF
11	Nicolas Estibals	Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves.	Pairing	2010	DBLP DOI BibTeX RDF
11	Mats Näslund, Igor E. Shparlinski, William Whyte	On the Bit Security of NTRUEncrypt.	Public Key Cryptography	2003	DBLP DOI BibTeX RDF
11	Wen-Ching W. Li, Mats Näslund, Igor E. Shparlinski	Hidden Number Problem with the Trace and Bit Security of XTR and LUC.	CRYPTO	2002	DBLP DOI BibTeX RDF
11	Benny Chor, Oded Goldreich 0001, Shafi Goldwasser	The Bit Security of Modular Squaring Given Partial Factorization of the Modulos.	CRYPTO	1985	DBLP DOI BibTeX RDF
10	Dong Su, Kewei Lv	A New Hard-Core Predicate of Paillier's Trapdoor Function.	INDOCRYPT	2009	DBLP DOI BibTeX RDF	Paillier’s trapdoor function, Hard-core Predicate, Most significant bit
10	Takahiro Matsuda 0002, Goichiro Hanaoka, Kanta Matsuura, Hideki Imai	An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations.	CT-RSA	2009	DBLP DOI BibTeX RDF	IND-CCA security, encapsulation, public key encryption, identity-based encryption, pseudorandom generator
9	Côme Berbain, Olivier Billet, Anne Canteaut, Nicolas T. Courtois, Henri Gilbert, Louis Goubin, Aline Gouget, Louis Granboulan, Cédric Lauradoux, Marine Minier, Thomas Pornin, Hervé Sibert	Sosemanuk, a Fast Software-Oriented Stream Cipher.	The eSTREAM Finalists	2008	DBLP DOI BibTeX RDF
9	Johan Håstad, Mats Näslund	The Security of Individual RSA Bits.	FOCS	1998	DBLP DOI BibTeX RDF
8	Yuto Kawahara, Kazumaro Aoki, Tsuyoshi Takagi	Faster Implementation of eta-T Pairing over GF(3m) Using Minimum Number of Logical Instructions for GF(3)-Addition.	Pairing	2008	DBLP DOI BibTeX RDF	GF(3)-addition, logical instruction, ? T pairing
7	Mats Näslund	Universal Hash Functions & Hard Core Bits.	EUROCRYPT	1995	DBLP DOI BibTeX RDF
5	Deike Priemuth-Schmid, Alex Biryukov	Slid Pairs in Salsa20 and Trivium.	INDOCRYPT	2008	DBLP DOI BibTeX RDF	Salsa20, cryptanalysis, stream ciphers, eSTREAM, Trivium
5	Omran Ahmadi, Darrel Hankerson, Alfred Menezes	Software Implementation of Arithmetic in F3m.	WAIFI	2007	DBLP DOI BibTeX RDF
5	Joseph H. Silverman, William Whyte	Timing Attacks on NTRUEncrypt Via Variation in the Number of Hash Calls.	CT-RSA	2007	DBLP DOI BibTeX RDF
5	Hans Ulrich Simon	Spectral Norm in Learning Theory: Some Selected Topics.	Discovery Science	2006	DBLP DOI BibTeX RDF
5	Hans Ulrich Simon	Spectral Norm in Learning Theory: Some Selected Topics.	ALT	2006	DBLP DOI BibTeX RDF
5	Antoine Joux, Frédéric Muller	Chosen-Ciphertext Attacks Against MOSQUITO.	FSE	2006	DBLP DOI BibTeX RDF
5	Igor E. Shparlinski, Arne Winterhof	A Nonuniform Algorithm for the Hidden Number Problem in Subgroups.	Public Key Cryptography	2004	DBLP DOI BibTeX RDF
5	Steven D. Galbraith, Herbie J. Hopkins, Igor E. Shparlinski	Secure Bilinear Diffie-Hellman Bits.	ACISP	2004	DBLP DOI BibTeX RDF
5	Phong Q. Nguyen, Igor E. Shparlinski	The Insecurity of the Digital Signature Algorithm with Partially Known Nonces.	J. Cryptol.	2002	DBLP DOI BibTeX RDF